/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:05:36,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:05:36,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:05:36,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:05:36,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:05:36,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:05:36,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:05:36,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:05:36,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:05:36,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:05:36,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:05:36,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:05:36,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:05:36,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:05:36,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:05:36,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:05:36,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:05:36,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:05:36,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:05:36,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:05:36,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:05:36,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:05:36,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:05:36,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:05:36,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:05:36,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:05:36,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:05:36,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:05:36,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:05:36,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:05:36,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:05:36,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:05:36,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:05:36,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:05:36,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:05:36,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:05:36,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:05:36,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:05:36,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:05:36,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:05:36,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:05:36,726 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:05:36,741 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:05:36,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:05:36,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:05:36,742 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:05:36,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:05:36,743 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:05:36,743 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:05:36,743 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:05:36,743 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:05:36,743 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:05:36,743 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:05:36,744 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:05:36,744 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:05:36,744 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:05:36,744 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:05:36,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:05:36,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:05:36,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:05:36,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:05:36,745 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:05:36,745 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:05:36,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:05:36,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:05:36,746 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:05:36,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:05:36,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:05:36,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:05:36,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:05:36,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:05:36,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:05:36,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:05:36,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:05:36,926 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:05:36,926 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:05:36,927 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:05:36,988 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_gEVnq5/tmp/59274d49073f48e4ab0abad61b9ce1e3/FLAG6442aab6d [2020-07-01 13:05:37,331 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:05:37,332 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:05:37,332 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:05:37,339 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_gEVnq5/tmp/59274d49073f48e4ab0abad61b9ce1e3/FLAG6442aab6d [2020-07-01 13:05:37,736 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_gEVnq5/tmp/59274d49073f48e4ab0abad61b9ce1e3 [2020-07-01 13:05:37,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:05:37,748 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:05:37,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:05:37,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:05:37,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:05:37,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:05:37" (1/1) ... [2020-07-01 13:05:37,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2cb152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:37, skipping insertion in model container [2020-07-01 13:05:37,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:05:37" (1/1) ... [2020-07-01 13:05:37,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:05:37,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:05:38,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:05:38,022 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:05:38,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:05:38,053 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:05:38,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38 WrapperNode [2020-07-01 13:05:38,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:05:38,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:05:38,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:05:38,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:05:38,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:05:38,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:05:38,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:05:38,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:05:38,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:05:38,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:05:38,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:05:38,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:05:38,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:05:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:05:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:05:38,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:05:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:05:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:05:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:05:38,396 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:05:38,397 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:05:38,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:38 BoogieIcfgContainer [2020-07-01 13:05:38,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:05:38,402 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:05:38,402 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:05:38,404 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:05:38,405 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:38" (1/1) ... [2020-07-01 13:05:38,418 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 20 edges [2020-07-01 13:05:38,420 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:05:38,420 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:05:38,421 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:05:38,421 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:05:38,423 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:05:38,424 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:05:38,424 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:05:38,445 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:05:38,471 INFO L200 BlockEncoder]: SBE split 8 edges [2020-07-01 13:05:38,475 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:05:38,477 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:05:38,496 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-07-01 13:05:38,499 INFO L70 RemoveSinkStates]: Removed 9 edges and 2 locations by removing sink states [2020-07-01 13:05:38,502 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:05:38,503 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:05:38,503 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:05:38,504 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:05:38,504 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges [2020-07-01 13:05:38,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:38 BasicIcfg [2020-07-01 13:05:38,505 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:05:38,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:05:38,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:05:38,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:05:38,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:05:37" (1/4) ... [2020-07-01 13:05:38,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c89f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:05:38, skipping insertion in model container [2020-07-01 13:05:38,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (2/4) ... [2020-07-01 13:05:38,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c89f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:05:38, skipping insertion in model container [2020-07-01 13:05:38,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:38" (3/4) ... [2020-07-01 13:05:38,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c89f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:38, skipping insertion in model container [2020-07-01 13:05:38,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:38" (4/4) ... [2020-07-01 13:05:38,514 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:05:38,525 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:05:38,532 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-07-01 13:05:38,546 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-07-01 13:05:38,570 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:05:38,571 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:05:38,571 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:05:38,571 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:05:38,571 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:05:38,571 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:05:38,571 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:05:38,572 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:05:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-01 13:05:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:05:38,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:38,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:05:38,594 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:38,600 INFO L82 PathProgramCache]: Analyzing trace with hash 3555860, now seen corresponding path program 1 times [2020-07-01 13:05:38,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:38,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329125665] [2020-07-01 13:05:38,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:38,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329125665] [2020-07-01 13:05:38,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:38,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:38,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194939294] [2020-07-01 13:05:38,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:38,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:38,796 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-07-01 13:05:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:38,867 INFO L93 Difference]: Finished difference Result 12 states and 20 transitions. [2020-07-01 13:05:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:38,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:05:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:38,880 INFO L225 Difference]: With dead ends: 12 [2020-07-01 13:05:38,880 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 13:05:38,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 13:05:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 13:05:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 13:05:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-07-01 13:05:38,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 4 [2020-07-01 13:05:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:38,918 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-07-01 13:05:38,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. [2020-07-01 13:05:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:05:38,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:38,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:05:38,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:05:38,920 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:38,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash 3555862, now seen corresponding path program 1 times [2020-07-01 13:05:38,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:38,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877005828] [2020-07-01 13:05:38,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:38,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877005828] [2020-07-01 13:05:38,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:38,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:38,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426685834] [2020-07-01 13:05:38,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:38,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:38,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:38,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:38,956 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 3 states. [2020-07-01 13:05:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:38,997 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-01 13:05:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:38,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:05:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:38,999 INFO L225 Difference]: With dead ends: 12 [2020-07-01 13:05:38,999 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 13:05:39,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 13:05:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 13:05:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 13:05:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 13:05:39,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 [2020-07-01 13:05:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,003 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 13:05:39,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 13:05:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:05:39,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:05:39,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:05:39,005 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash 3555863, now seen corresponding path program 1 times [2020-07-01 13:05:39,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948909325] [2020-07-01 13:05:39,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948909325] [2020-07-01 13:05:39,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:39,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:05:39,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753752933] [2020-07-01 13:05:39,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:05:39,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:05:39,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:05:39,042 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2020-07-01 13:05:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:39,078 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-07-01 13:05:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:05:39,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 13:05:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:39,079 INFO L225 Difference]: With dead ends: 11 [2020-07-01 13:05:39,080 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 13:05:39,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:05:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 13:05:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 13:05:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 13:05:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-07-01 13:05:39,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 4 [2020-07-01 13:05:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,084 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-07-01 13:05:39,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:05:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-07-01 13:05:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:05:39,084 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:05:39,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:05:39,085 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,085 INFO L82 PathProgramCache]: Analyzing trace with hash 110232382, now seen corresponding path program 1 times [2020-07-01 13:05:39,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155323158] [2020-07-01 13:05:39,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155323158] [2020-07-01 13:05:39,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:39,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:39,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997002390] [2020-07-01 13:05:39,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:39,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:39,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:39,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:39,121 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2020-07-01 13:05:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:39,150 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. [2020-07-01 13:05:39,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:39,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:05:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:39,151 INFO L225 Difference]: With dead ends: 10 [2020-07-01 13:05:39,152 INFO L226 Difference]: Without dead ends: 9 [2020-07-01 13:05:39,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-01 13:05:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-01 13:05:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 13:05:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-07-01 13:05:39,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 5 [2020-07-01 13:05:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,155 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-07-01 13:05:39,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2020-07-01 13:05:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:05:39,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:05:39,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:05:39,156 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash 110232384, now seen corresponding path program 1 times [2020-07-01 13:05:39,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224820321] [2020-07-01 13:05:39,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224820321] [2020-07-01 13:05:39,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:39,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:05:39,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413650099] [2020-07-01 13:05:39,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:05:39,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:39,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:05:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:05:39,193 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2020-07-01 13:05:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:39,235 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-07-01 13:05:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:05:39,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 13:05:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:39,238 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:05:39,238 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:05:39,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:05:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:05:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2020-07-01 13:05:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 13:05:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-07-01 13:05:39,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 5 [2020-07-01 13:05:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,243 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-07-01 13:05:39,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:05:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-07-01 13:05:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:05:39,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:05:39,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:05:39,244 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash 110232385, now seen corresponding path program 1 times [2020-07-01 13:05:39,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253192210] [2020-07-01 13:05:39,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253192210] [2020-07-01 13:05:39,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:39,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:05:39,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930941361] [2020-07-01 13:05:39,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:05:39,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:05:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:05:39,297 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2020-07-01 13:05:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:39,366 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-07-01 13:05:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:05:39,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-07-01 13:05:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:39,368 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:05:39,368 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:05:39,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:05:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:05:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-07-01 13:05:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 13:05:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-01 13:05:39,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 [2020-07-01 13:05:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,372 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-01 13:05:39,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:05:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-07-01 13:05:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:05:39,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:39,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:05:39,373 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1440887682, now seen corresponding path program 1 times [2020-07-01 13:05:39,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873481355] [2020-07-01 13:05:39,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873481355] [2020-07-01 13:05:39,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:39,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:39,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263860536] [2020-07-01 13:05:39,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:39,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:39,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:39,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:39,410 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 3 states. [2020-07-01 13:05:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:39,431 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2020-07-01 13:05:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:39,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 13:05:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:39,432 INFO L225 Difference]: With dead ends: 10 [2020-07-01 13:05:39,432 INFO L226 Difference]: Without dead ends: 8 [2020-07-01 13:05:39,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-01 13:05:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-01 13:05:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 13:05:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-07-01 13:05:39,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2020-07-01 13:05:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,436 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-07-01 13:05:39,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-07-01 13:05:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:05:39,437 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:39,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:05:39,437 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1440886537, now seen corresponding path program 1 times [2020-07-01 13:05:39,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051236902] [2020-07-01 13:05:39,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051236902] [2020-07-01 13:05:39,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221614506] [2020-07-01 13:05:39,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:05:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:05:39,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:05:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:05:39,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:05:39,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153001170] [2020-07-01 13:05:39,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:05:39,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:39,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:05:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:05:39,549 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2020-07-01 13:05:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:39,580 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-01 13:05:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:05:39,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:05:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:39,581 INFO L225 Difference]: With dead ends: 10 [2020-07-01 13:05:39,581 INFO L226 Difference]: Without dead ends: 9 [2020-07-01 13:05:39,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:05:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-01 13:05:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-01 13:05:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 13:05:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-01 13:05:39,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2020-07-01 13:05:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,584 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-01 13:05:39,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:05:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-01 13:05:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:05:39,585 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:39,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 13:05:39,787 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1440886536, now seen corresponding path program 1 times [2020-07-01 13:05:39,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681463066] [2020-07-01 13:05:39,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:39,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681463066] [2020-07-01 13:05:39,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:39,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 13:05:39,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002869260] [2020-07-01 13:05:39,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:05:39,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:39,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:05:39,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:05:39,870 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2020-07-01 13:05:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:39,951 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-07-01 13:05:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:05:39,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 13:05:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:39,952 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:05:39,952 INFO L226 Difference]: Without dead ends: 8 [2020-07-01 13:05:39,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:05:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-01 13:05:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-01 13:05:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 13:05:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-01 13:05:39,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 [2020-07-01 13:05:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:39,956 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-01 13:05:39,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:05:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-01 13:05:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:05:39,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:39,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:39,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:05:39,957 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:39,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash -982820120, now seen corresponding path program 1 times [2020-07-01 13:05:39,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:39,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001483926] [2020-07-01 13:05:39,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:40,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001483926] [2020-07-01 13:05:40,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466631791] [2020-07-01 13:05:40,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:05:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:40,133 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 13:05:40,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:05:40,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 13:05:40,191 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:05:40,209 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:40,212 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 13:05:40,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 13:05:40,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:40,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 13:05:40,280 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:05:40,283 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:05:40,296 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:40,299 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:05:40,302 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:05:40,305 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 13:05:40,305 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 13:05:40,341 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:05:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:40,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:05:40,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-07-01 13:05:40,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705689732] [2020-07-01 13:05:40,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 13:05:40,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 13:05:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-01 13:05:40,346 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 9 states. [2020-07-01 13:05:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:40,572 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-01 13:05:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 13:05:40,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2020-07-01 13:05:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:40,574 INFO L225 Difference]: With dead ends: 11 [2020-07-01 13:05:40,574 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 13:05:40,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-01 13:05:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 13:05:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 13:05:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 13:05:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-01 13:05:40,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2020-07-01 13:05:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:40,578 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-01 13:05:40,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 13:05:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-01 13:05:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:05:40,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:40,579 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-07-01 13:05:40,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 13:05:40,780 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 402643679, now seen corresponding path program 2 times [2020-07-01 13:05:40,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:40,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637643980] [2020-07-01 13:05:40,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:40,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637643980] [2020-07-01 13:05:40,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081034092] [2020-07-01 13:05:40,966 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:05:40,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:05:40,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:05:40,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-01 13:05:41,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:05:41,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 13:05:41,007 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,011 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,011 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,011 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 13:05:41,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 13:05:41,032 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,038 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,039 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:05:41,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 13:05:41,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 13:05:41,081 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:05:41,081 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:05:41,095 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,096 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:05:41,098 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-07-01 13:05:41,126 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:05:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:05:41,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:05:41,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-01 13:05:41,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758371894] [2020-07-01 13:05:41,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 13:05:41,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 13:05:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:05:41,144 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-01 13:05:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:41,518 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-01 13:05:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:05:41,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2020-07-01 13:05:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:41,519 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:05:41,520 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:05:41,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-07-01 13:05:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:05:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-01 13:05:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 13:05:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-01 13:05:41,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2020-07-01 13:05:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:41,524 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-01 13:05:41,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 13:05:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-01 13:05:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:05:41,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:41,525 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:41,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-01 13:05:41,726 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:05:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 393492789, now seen corresponding path program 1 times [2020-07-01 13:05:41,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:41,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184875605] [2020-07-01 13:05:41,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:05:41,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184875605] [2020-07-01 13:05:41,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009647398] [2020-07-01 13:05:41,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:05:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:41,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 13:05:41,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:05:41,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 13:05:41,863 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,867 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,868 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 13:05:41,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:05:41,878 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,881 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,881 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 13:05:41,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 13:05:41,896 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:05:41,896 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:05:41,905 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:05:41,905 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:05:41,905 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 13:05:41,924 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:05:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:05:41,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:05:41,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-01 13:05:41,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550185460] [2020-07-01 13:05:41,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 13:05:41,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:05:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:05:41,937 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. [2020-07-01 13:05:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:42,014 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-01 13:05:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:05:42,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-01 13:05:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:42,015 INFO L225 Difference]: With dead ends: 12 [2020-07-01 13:05:42,015 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:05:42,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:05:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:05:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:05:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:05:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:05:42,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-07-01 13:05:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:42,016 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:05:42,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 13:05:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:05:42,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:05:42,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:05:42,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:05:42,556 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-07-01 13:05:42,560 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:05:42,560 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-01 13:05:42,560 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-01 13:05:42,560 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-07-01 13:05:42,561 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 15) no Hoare annotation was computed. [2020-07-01 13:05:42,561 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 14) no Hoare annotation was computed. [2020-07-01 13:05:42,561 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 14) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_cstrlen_~p~0.offset)) (.cse3 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse0 (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0)) (.cse2 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse7 (select |#length| ULTIMATE.start_cstrlen_~p~0.base)) (.cse4 (= 1 (select |#valid| ULTIMATE.start_cstrlen_~p~0.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse6 (= ULTIMATE.start_cstrlen_~s.base ULTIMATE.start_cstrlen_~p~0.base)) (.cse8 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrlen_~p~0.base) (- 1)))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_main_~length1~0 1) .cse6 (<= 1 .cse7) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base) ULTIMATE.start_cstrlen_~p~0.offset))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrlen_~p~0.offset ULTIMATE.start_main_~nondetString1~0.offset) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_cstrlen_~p~0.base))))) (and .cse0 .cse2 (or (< 1 ULTIMATE.start_main_~length1~0) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (<= (+ ULTIMATE.start_cstrlen_~p~0.offset 1) .cse7) .cse4 .cse5 (<= 1 ULTIMATE.start_cstrlen_~p~0.offset) .cse6 .cse8))) [2020-07-01 13:05:42,561 INFO L268 CegarLoopResult]: For program point L13-4(lines 13 14) no Hoare annotation was computed. [2020-07-01 13:05:42,561 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:42,562 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 13:05:42,562 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:42,562 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 13:05:42,564 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:05:42,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,581 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:42 BasicIcfg [2020-07-01 13:05:42,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:05:42,599 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:05:42,599 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:05:42,602 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:05:42,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:42,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:05:37" (1/5) ... [2020-07-01 13:05:42,604 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6618852e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:05:42, skipping insertion in model container [2020-07-01 13:05:42,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:42,604 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:38" (2/5) ... [2020-07-01 13:05:42,605 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6618852e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:05:42, skipping insertion in model container [2020-07-01 13:05:42,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:42,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:38" (3/5) ... [2020-07-01 13:05:42,605 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6618852e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:05:42, skipping insertion in model container [2020-07-01 13:05:42,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:42,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:38" (4/5) ... [2020-07-01 13:05:42,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6618852e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:05:42, skipping insertion in model container [2020-07-01 13:05:42,606 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:42,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:42" (5/5) ... [2020-07-01 13:05:42,607 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:05:42,630 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:05:42,630 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:05:42,630 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:05:42,631 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:05:42,631 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:05:42,631 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:05:42,631 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:05:42,631 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:05:42,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-01 13:05:42,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:05:42,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:05:42,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:05:42,643 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 13:05:42,643 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:05:42,643 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:05:42,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-01 13:05:42,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 13:05:42,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:05:42,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:05:42,645 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 13:05:42,645 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 13:05:42,650 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [87] ULTIMATE.startENTRY-->L20: Formula: (and (= 0 |v_#NULL.base_2|) (= |v_#valid_11| (store |v_#valid_12| 0 0)) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 13#L20true [56] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 8#L20-2true [66] L20-2-->L24: Formula: (and (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4|)) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc3.base_4| 1)) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_4|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_4|) (> 0 |v_ULTIMATE.start_main_#t~malloc3.base_4|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 9#L24true [88] L24-->L13-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlen_#in~s.offset_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_cstrlen_~s.base_5) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrlen_#in~s.offset_2| v_ULTIMATE.start_cstrlen_~s.offset_4) (= v_ULTIMATE.start_cstrlen_~s.base_5 v_ULTIMATE.start_cstrlen_~p~0.base_10) (<= .cse0 (select |v_#length_7| v_ULTIMATE.start_main_~nondetString1~0.base_8)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_cstrlen_~p~0.offset_8 v_ULTIMATE.start_cstrlen_~s.offset_4) (= (store |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8 (store (select |v_#memory_int_5| v_ULTIMATE.start_main_~nondetString1~0.base_8) (+ v_ULTIMATE.start_main_~nondetString1~0.offset_7 v_ULTIMATE.start_main_~length1~0_11 (- 1)) 0)) |v_#memory_int_4|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_8, ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_7|, ULTIMATE.start_cstrlen_~s.base=v_ULTIMATE.start_cstrlen_~s.base_5, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_11, ULTIMATE.start_cstrlen_#in~s.base=|v_ULTIMATE.start_cstrlen_#in~s.base_2|, ULTIMATE.start_cstrlen_~s.offset=v_ULTIMATE.start_cstrlen_~s.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_10, ULTIMATE.start_cstrlen_#in~s.offset=|v_ULTIMATE.start_cstrlen_#in~s.offset_2|, ULTIMATE.start_cstrlen_#t~post1.offset=|v_ULTIMATE.start_cstrlen_#t~post1.offset_4|, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrlen_#t~post1.base=|v_ULTIMATE.start_cstrlen_#t~post1.base_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~mem0, ULTIMATE.start_cstrlen_~s.base, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#in~s.offset, ULTIMATE.start_cstrlen_#t~post1.offset, ULTIMATE.start_cstrlen_#res, #memory_int, ULTIMATE.start_cstrlen_#t~post1.base, ULTIMATE.start_cstrlen_#in~s.base, ULTIMATE.start_cstrlen_~s.offset] 3#L13-3true [2020-07-01 13:05:42,650 INFO L796 eck$LassoCheckResult]: Loop: 3#L13-3true [44] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrlen_~p~0.offset_3) (<= (+ v_ULTIMATE.start_cstrlen_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~p~0.base_3)) (= |v_ULTIMATE.start_cstrlen_#t~mem0_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~p~0.base_3) v_ULTIMATE.start_cstrlen_~p~0.offset_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_cstrlen_~p~0.base_3))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_3, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_3, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_2|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_3, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem0] 7#L13-1true [85] L13-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cstrlen_~p~0.base_7 v_ULTIMATE.start_cstrlen_~p~0.base_6) (> 0 |v_ULTIMATE.start_cstrlen_#t~mem0_6|) (= (+ v_ULTIMATE.start_cstrlen_~p~0.offset_6 1) v_ULTIMATE.start_cstrlen_~p~0.offset_5)) InVars {ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_6|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_6, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_7} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_5, ULTIMATE.start_cstrlen_#t~mem0=|v_ULTIMATE.start_cstrlen_#t~mem0_5|, ULTIMATE.start_cstrlen_#t~post1.base=|v_ULTIMATE.start_cstrlen_#t~post1.base_2|, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_6, ULTIMATE.start_cstrlen_#t~post1.offset=|v_ULTIMATE.start_cstrlen_#t~post1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~mem0, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#t~post1.offset, ULTIMATE.start_cstrlen_#t~post1.base] 3#L13-3true [2020-07-01 13:05:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 3571288, now seen corresponding path program 1 times [2020-07-01 13:05:42,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:42,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586960545] [2020-07-01 13:05:42,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:42,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586960545] [2020-07-01 13:05:42,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:42,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:42,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733616746] [2020-07-01 13:05:42,665 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:05:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2410, now seen corresponding path program 1 times [2020-07-01 13:05:42,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:42,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140246493] [2020-07-01 13:05:42,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:05:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:05:42,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:05:42,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:42,717 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-07-01 13:05:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:42,735 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2020-07-01 13:05:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:42,738 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:05:42,742 INFO L168 Benchmark]: Toolchain (without parser) took 4993.36 ms. Allocated memory was 649.6 MB in the beginning and 752.4 MB in the end (delta: 102.8 MB). Free memory was 557.5 MB in the beginning and 467.0 MB in the end (delta: 90.4 MB). Peak memory consumption was 193.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,742 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 579.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:05:42,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.74 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 557.5 MB in the beginning and 648.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.23 ms. Allocated memory is still 686.3 MB. Free memory was 648.1 MB in the beginning and 646.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,743 INFO L168 Benchmark]: Boogie Preprocessor took 25.31 ms. Allocated memory is still 686.3 MB. Free memory was 646.8 MB in the beginning and 645.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,744 INFO L168 Benchmark]: RCFGBuilder took 282.37 ms. Allocated memory is still 686.3 MB. Free memory was 644.1 MB in the beginning and 624.4 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,744 INFO L168 Benchmark]: BlockEncodingV2 took 102.80 ms. Allocated memory is still 686.3 MB. Free memory was 624.4 MB in the beginning and 616.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,745 INFO L168 Benchmark]: TraceAbstraction took 4092.47 ms. Allocated memory was 686.3 MB in the beginning and 752.4 MB in the end (delta: 66.1 MB). Free memory was 616.3 MB in the beginning and 483.1 MB in the end (delta: 133.3 MB). Peak memory consumption was 199.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,745 INFO L168 Benchmark]: BuchiAutomizer took 141.09 ms. Allocated memory is still 752.4 MB. Free memory was 483.1 MB in the beginning and 467.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:42,748 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 20 edges - StatisticsResult: Encoded RCFG 12 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 579.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 304.74 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 557.5 MB in the beginning and 648.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.23 ms. Allocated memory is still 686.3 MB. Free memory was 648.1 MB in the beginning and 646.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.31 ms. Allocated memory is still 686.3 MB. Free memory was 646.8 MB in the beginning and 645.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 282.37 ms. Allocated memory is still 686.3 MB. Free memory was 644.1 MB in the beginning and 624.4 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 102.80 ms. Allocated memory is still 686.3 MB. Free memory was 624.4 MB in the beginning and 616.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4092.47 ms. Allocated memory was 686.3 MB in the beginning and 752.4 MB in the end (delta: 66.1 MB). Free memory was 616.3 MB in the beginning and 483.1 MB in the end (delta: 133.3 MB). Peak memory consumption was 199.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 141.09 ms. Allocated memory is still 752.4 MB. Free memory was 483.1 MB in the beginning and 467.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-07-01 13:05:42,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:05:42,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:05:42,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:42,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:05:42,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == p) && 0 == nondetString1) && 1 <= length1) && 1 == \valid[p]) && 1 == \valid[nondetString1]) && length1 <= 1) && s == p) && 1 <= unknown-#length-unknown[p]) && 0 == unknown-#memory_int-unknown[p][p]) || ((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == p) && 0 == nondetString1) && 1 <= length1) && 1 == \valid[p]) && 1 == \valid[nondetString1]) && s == p) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[p] + -1])) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((0 == unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] && 1 <= ULTIMATE.start_main_~length1~0) && p <= ULTIMATE.start_main_~nondetString1~0.offset) && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[p]))) || ((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == nondetString1) && (1 < length1 || 1 == nondetString1 + length1)) && p + 1 <= unknown-#length-unknown[p]) && 1 == \valid[p]) && 1 == \valid[nondetString1]) && 1 <= p) && s == p) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[p][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[p] + -1])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.6s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 SDtfs, 142 SDslu, 67 SDs, 0 SdLazy, 295 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 178 HoareAnnotationTreeSize, 1 FomulaSimplifications, 95 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 93 ConstructedInterpolants, 4 QuantifiedInterpolants, 4869 SizeOfPredicates, 25 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 9/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:05:34.496 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_gEVnq5/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:05:42.995 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check