/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 13:15:52,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 13:15:52,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 13:15:52,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 13:15:52,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 13:15:52,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 13:15:52,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 13:15:52,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 13:15:52,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 13:15:52,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 13:15:52,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 13:15:52,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 13:15:52,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 13:15:52,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 13:15:52,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 13:15:52,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 13:15:52,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 13:15:52,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 13:15:52,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 13:15:52,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 13:15:52,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 13:15:52,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 13:15:52,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 13:15:52,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 13:15:52,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 13:15:52,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 13:15:52,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 13:15:52,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 13:15:52,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 13:15:52,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 13:15:52,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 13:15:52,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 13:15:52,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 13:15:52,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 13:15:52,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 13:15:52,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 13:15:52,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 13:15:52,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 13:15:52,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 13:15:52,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 13:15:52,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 13:15:52,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 13:15:52,669 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 13:15:52,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 13:15:52,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 13:15:52,671 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 13:15:52,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 13:15:52,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 13:15:52,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 13:15:52,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 13:15:52,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 13:15:52,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 13:15:52,673 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 13:15:52,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 13:15:52,673 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 13:15:52,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 13:15:52,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 13:15:52,674 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 13:15:52,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 13:15:52,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 13:15:52,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:15:52,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 13:15:52,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 13:15:52,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 13:15:52,676 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-17 13:15:52,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 13:15:52,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 13:15:52,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 13:15:52,997 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 13:15:52,997 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 13:15:52,998 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-07-17 13:15:53,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6868926/df0ac8e864184a7487801a7d7e80f706/FLAG352f26190 [2020-07-17 13:15:53,552 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 13:15:53,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-07-17 13:15:53,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6868926/df0ac8e864184a7487801a7d7e80f706/FLAG352f26190 [2020-07-17 13:15:53,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6868926/df0ac8e864184a7487801a7d7e80f706 [2020-07-17 13:15:53,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 13:15:53,912 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 13:15:53,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 13:15:53,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 13:15:53,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 13:15:53,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:15:53" (1/1) ... [2020-07-17 13:15:53,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3676aee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:53, skipping insertion in model container [2020-07-17 13:15:53,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:15:53" (1/1) ... [2020-07-17 13:15:53,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 13:15:53,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 13:15:54,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:15:54,144 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 13:15:54,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:15:54,186 INFO L208 MainTranslator]: Completed translation [2020-07-17 13:15:54,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54 WrapperNode [2020-07-17 13:15:54,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 13:15:54,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 13:15:54,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 13:15:54,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 13:15:54,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 13:15:54,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 13:15:54,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 13:15:54,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 13:15:54,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:15:54,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 13:15:54,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 13:15:54,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 13:15:54,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 13:15:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-17 13:15:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 13:15:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-17 13:15:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 13:15:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 13:15:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 13:15:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 13:15:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 13:15:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 13:15:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 13:15:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-17 13:15:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 13:15:54,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 13:15:54,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 13:15:54,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-17 13:15:54,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 13:15:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 13:15:54,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 13:15:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 13:15:54,798 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 13:15:54,798 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 13:15:54,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:15:54 BoogieIcfgContainer [2020-07-17 13:15:54,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 13:15:54,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 13:15:54,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 13:15:54,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 13:15:54,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 01:15:53" (1/3) ... [2020-07-17 13:15:54,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703d8b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:15:54, skipping insertion in model container [2020-07-17 13:15:54,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (2/3) ... [2020-07-17 13:15:54,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703d8b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:15:54, skipping insertion in model container [2020-07-17 13:15:54,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:15:54" (3/3) ... [2020-07-17 13:15:54,812 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-07-17 13:15:54,823 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 13:15:54,832 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 13:15:54,862 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 13:15:54,903 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 13:15:54,904 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 13:15:54,904 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-17 13:15:54,904 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 13:15:54,904 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 13:15:54,904 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 13:15:54,905 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 13:15:54,905 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 13:15:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-17 13:15:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 13:15:54,936 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:54,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:15:54,937 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1490874143, now seen corresponding path program 1 times [2020-07-17 13:15:54,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:54,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990828369] [2020-07-17 13:15:54,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:55,467 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-17 13:15:55,470 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:55,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990828369] [2020-07-17 13:15:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-17 13:15:55,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994662929] [2020-07-17 13:15:55,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 13:15:55,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 13:15:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-17 13:15:55,502 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 10 states. [2020-07-17 13:15:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:15:56,497 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2020-07-17 13:15:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 13:15:56,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-17 13:15:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:15:56,520 INFO L225 Difference]: With dead ends: 209 [2020-07-17 13:15:56,520 INFO L226 Difference]: Without dead ends: 123 [2020-07-17 13:15:56,534 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-07-17 13:15:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-17 13:15:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2020-07-17 13:15:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-17 13:15:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2020-07-17 13:15:56,638 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 31 [2020-07-17 13:15:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:15:56,639 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2020-07-17 13:15:56,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 13:15:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2020-07-17 13:15:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 13:15:56,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:56,643 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:15:56,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 13:15:56,644 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1249778318, now seen corresponding path program 1 times [2020-07-17 13:15:56,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:56,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376526353] [2020-07-17 13:15:56,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,983 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-17 13:15:56,983 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:56,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376526353] [2020-07-17 13:15:56,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:56,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-17 13:15:56,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270798753] [2020-07-17 13:15:56,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 13:15:56,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 13:15:56,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-17 13:15:56,987 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2020-07-17 13:15:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:15:58,569 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2020-07-17 13:15:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 13:15:58,569 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-07-17 13:15:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:15:58,575 INFO L225 Difference]: With dead ends: 189 [2020-07-17 13:15:58,575 INFO L226 Difference]: Without dead ends: 187 [2020-07-17 13:15:58,577 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-07-17 13:15:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-17 13:15:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 153. [2020-07-17 13:15:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-17 13:15:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2020-07-17 13:15:58,617 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 52 [2020-07-17 13:15:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:15:58,618 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2020-07-17 13:15:58,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 13:15:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2020-07-17 13:15:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 13:15:58,620 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:58,620 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:15:58,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 13:15:58,621 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:58,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash -448975570, now seen corresponding path program 1 times [2020-07-17 13:15:58,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:58,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938738234] [2020-07-17 13:15:58,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,763 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-17 13:15:58,765 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:58,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938738234] [2020-07-17 13:15:58,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:58,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-17 13:15:58,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480834232] [2020-07-17 13:15:58,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 13:15:58,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:58,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 13:15:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-17 13:15:58,768 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 11 states. [2020-07-17 13:15:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:15:59,245 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2020-07-17 13:15:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 13:15:59,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-07-17 13:15:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:15:59,248 INFO L225 Difference]: With dead ends: 230 [2020-07-17 13:15:59,248 INFO L226 Difference]: Without dead ends: 137 [2020-07-17 13:15:59,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-17 13:15:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-17 13:15:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-17 13:15:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-17 13:15:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2020-07-17 13:15:59,300 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 52 [2020-07-17 13:15:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:15:59,302 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2020-07-17 13:15:59,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 13:15:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2020-07-17 13:15:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-17 13:15:59,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:59,312 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:15:59,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 13:15:59,313 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1366237712, now seen corresponding path program 1 times [2020-07-17 13:15:59,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:59,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312012749] [2020-07-17 13:15:59,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 13:15:59,623 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:59,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312012749] [2020-07-17 13:15:59,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:59,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-17 13:15:59,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305165477] [2020-07-17 13:15:59,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 13:15:59,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:59,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 13:15:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-17 13:15:59,626 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 15 states. [2020-07-17 13:16:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:00,394 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-07-17 13:16:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 13:16:00,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-07-17 13:16:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:00,397 INFO L225 Difference]: With dead ends: 147 [2020-07-17 13:16:00,397 INFO L226 Difference]: Without dead ends: 87 [2020-07-17 13:16:00,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-07-17 13:16:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-17 13:16:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2020-07-17 13:16:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 13:16:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-07-17 13:16:00,413 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2020-07-17 13:16:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:00,414 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-07-17 13:16:00,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 13:16:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-07-17 13:16:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-17 13:16:00,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:00,416 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:16:00,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 13:16:00,416 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:00,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2045890305, now seen corresponding path program 2 times [2020-07-17 13:16:00,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:00,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408837723] [2020-07-17 13:16:00,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,866 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-17 13:16:00,867 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:00,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408837723] [2020-07-17 13:16:00,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:00,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-17 13:16:00,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954181982] [2020-07-17 13:16:00,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 13:16:00,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 13:16:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-17 13:16:00,870 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2020-07-17 13:16:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:02,022 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-07-17 13:16:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 13:16:02,023 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-07-17 13:16:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:02,024 INFO L225 Difference]: With dead ends: 87 [2020-07-17 13:16:02,024 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 13:16:02,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1424, Unknown=0, NotChecked=0, Total=1722 [2020-07-17 13:16:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 13:16:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 13:16:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 13:16:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 13:16:02,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-07-17 13:16:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:02,027 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 13:16:02,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 13:16:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 13:16:02,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 13:16:02,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 13:16:02,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 13:16:03,194 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-07-17 13:16:03,314 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-07-17 13:16:03,436 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-07-17 13:16:03,565 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-07-17 13:16:03,708 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-17 13:16:03,862 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-17 13:16:03,997 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-17 13:16:04,109 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-17 13:16:04,252 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-07-17 13:16:04,356 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-17 13:16:04,467 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2020-07-17 13:16:04,639 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-07-17 13:16:04,776 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-07-17 13:16:04,922 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-07-17 13:16:05,106 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-17 13:16:05,428 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-17 13:16:05,655 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-07-17 13:16:05,808 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-07-17 13:16:05,952 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-17 13:16:06,189 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-17 13:16:06,315 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-07-17 13:16:06,487 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-07-17 13:16:06,714 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-07-17 13:16:06,880 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-07-17 13:16:06,886 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,886 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,886 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,886 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 13:16:06,886 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,887 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,887 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,887 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,887 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:16:06,887 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-17 13:16:06,887 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 13:16:06,887 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-17 13:16:06,888 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-17 13:16:06,888 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-17 13:16:06,888 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 39 48) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:06,888 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 39 48) the Hoare annotation is: true [2020-07-17 13:16:06,888 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-17 13:16:06,888 INFO L271 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: true [2020-07-17 13:16:06,889 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 39 48) the Hoare annotation is: true [2020-07-17 13:16:06,889 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:06,889 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-17 13:16:06,889 INFO L271 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: true [2020-07-17 13:16:06,889 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:06,889 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|)) [2020-07-17 13:16:06,890 INFO L271 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: true [2020-07-17 13:16:06,890 INFO L264 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:06,890 INFO L271 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: true [2020-07-17 13:16:06,890 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:06,890 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:06,891 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))))) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse3 .cse4)))) [2020-07-17 13:16:06,891 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= 0 |check_#t~mem8|)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-17 13:16:06,891 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-07-17 13:16:06,891 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,891 INFO L264 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|)))) (.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= 0 |check_#t~mem8|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base)))) (and (or (and .cse0 .cse1 .cse2 .cse3) (not (<= 1 |check_#in~x|)) .cse4 .cse5) (or .cse4 .cse5 (not (= 0 |check_#in~x|)) (and .cse0 .cse1 .cse2 .cse3 (or (= 0 check_~x) (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x))))))))) [2020-07-17 13:16:06,892 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,892 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-17 13:16:06,892 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (<= .cse7 |check_#in~n|)) (.cse1 (= .cse6 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse7 check_~n)) (.cse3 (= 0 |check_#t~mem1|)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x) .cse1 .cse2 .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse4 .cse5 (and .cse0 .cse1 .cse2 (<= 1 check_~x) .cse3)) (or .cse4 (not (<= 2 |check_#in~x|)) .cse5 (<= 2 check_~x))))) [2020-07-17 13:16:06,893 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-17 13:16:06,893 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse1 (<= .cse8 |check_#in~n|)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse8 check_~n)) (.cse4 (= 0 |check_#t~mem1|)) (.cse5 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 (<= 1 check_~x) .cse3 .cse4 .cse5) .cse6) (or (and .cse1 (= 0 check_~x) .cse2 .cse3 .cse4 .cse5) .cse0 .cse6 (not (= 0 |check_#in~x|))) (or .cse0 (not (<= 2 |check_#in~x|)) .cse6 (<= 2 check_~x))))) [2020-07-17 13:16:06,893 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse1 (<= .cse8 |check_#in~n|)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse8 check_~n)) (.cse4 (= 0 |check_#t~mem1|)) (.cse5 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 (<= 1 check_~x) .cse3 .cse4 .cse5) .cse6) (or (and .cse1 (= 0 check_~x) .cse2 .cse3 .cse4 .cse5) .cse0 .cse6 (not (= 0 |check_#in~x|))) (or .cse0 (not (<= 2 |check_#in~x|)) .cse6 (<= 2 check_~x))))) [2020-07-17 13:16:06,893 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-17 13:16:06,894 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-17 13:16:06,894 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or (and (= 0 |check_#t~post3|) .cse0 (= 0 check_~x) .cse1 .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or .cse3 (not (<= 2 |check_#in~x|)) .cse4 (<= 2 check_~x))))) [2020-07-17 13:16:06,894 INFO L264 CegarLoopResult]: At program point L23-7(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse3 .cse4) (or (and (= 0 |check_#t~post3|) .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-17 13:16:06,894 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-17 13:16:06,895 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse0 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse1 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 (= .cse1 (select |#memory_int| check_~a.base)) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or (and .cse0 (= 0 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-17 13:16:06,895 INFO L264 CegarLoopResult]: At program point L23-9(line 23) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 13:16:06,895 INFO L264 CegarLoopResult]: At program point L23-10(line 23) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 13:16:06,895 INFO L264 CegarLoopResult]: At program point L23-11(lines 23 24) the Hoare annotation is: (let ((.cse5 (+ check_~y 1)) (.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|)))) (.cse0 (<= .cse5 |check_#in~n|)) (.cse1 (= .cse6 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse5 check_~n))) (and (or (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse3 .cse4 (and .cse0 .cse1 .cse2 (<= 2 check_~x)))))) [2020-07-17 13:16:06,896 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-17 13:16:06,896 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-17 13:16:06,896 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (= 0 check_~ai~0) (= .cse0 (select |#memory_int| check_~a.base))) (not (<= 1 |check_#in~x|)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-17 13:16:06,896 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (= 0 |check_#t~mem7|)) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x)))) .cse4)) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse2 .cse4) .cse1)))) [2020-07-17 13:16:06,897 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 .cse3) .cse4) (or (and .cse1 .cse2 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x)))) .cse3) .cse0 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-17 13:16:06,897 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,897 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,897 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,898 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,898 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,898 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 13:16:06,898 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-17 13:16:06,899 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 13:16:06,899 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-17 13:16:06,899 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-17 13:16:06,899 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-17 13:16:06,899 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-17 13:16:06,900 INFO L264 CegarLoopResult]: At program point L14(lines 14 37) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or (= 0 check_~x) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) (<= 1 check_~x) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x)))) [2020-07-17 13:16:06,900 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 37) the Hoare annotation is: (let ((.cse0 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x)) .cse1 .cse2 (not (= 0 |check_#in~x|))) (or (and .cse0 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse1 (not (<= 2 |check_#in~x|)) .cse2 (<= 2 check_~x)))) [2020-07-17 13:16:06,900 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 37) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x) .cse1) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse2 (and .cse0 .cse1 (<= 1 check_~x)) .cse3) (or .cse2 (not (<= 2 |check_#in~x|)) .cse3 (<= 2 check_~x))))) [2020-07-17 13:16:06,900 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-17 13:16:06,900 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-17 13:16:06,901 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-17 13:16:06,901 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-17 13:16:06,901 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-17 13:16:06,901 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-17 13:16:06,901 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-17 13:16:06,901 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-17 13:16:06,902 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-17 13:16:06,920 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-17 13:16:06,924 INFO L168 Benchmark]: Toolchain (without parser) took 13012.97 ms. Allocated memory was 134.7 MB in the beginning and 376.4 MB in the end (delta: 241.7 MB). Free memory was 99.8 MB in the beginning and 282.7 MB in the end (delta: -183.0 MB). Peak memory consumption was 258.0 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:06,924 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 13:16:06,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.08 ms. Allocated memory is still 134.7 MB. Free memory was 99.4 MB in the beginning and 88.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:06,926 INFO L168 Benchmark]: Boogie Preprocessor took 147.02 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 88.9 MB in the beginning and 176.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:06,927 INFO L168 Benchmark]: RCFGBuilder took 467.55 ms. Allocated memory is still 198.7 MB. Free memory was 176.1 MB in the beginning and 155.2 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:06,928 INFO L168 Benchmark]: TraceAbstraction took 12117.22 ms. Allocated memory was 198.7 MB in the beginning and 376.4 MB in the end (delta: 177.7 MB). Free memory was 154.1 MB in the beginning and 282.7 MB in the end (delta: -128.6 MB). Peak memory consumption was 248.4 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:06,931 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.08 ms. Allocated memory is still 134.7 MB. Free memory was 99.4 MB in the beginning and 88.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.02 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 88.9 MB in the beginning and 176.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 467.55 ms. Allocated memory is still 198.7 MB. Free memory was 176.1 MB in the beginning and 155.2 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12117.22 ms. Allocated memory was 198.7 MB in the beginning and 376.4 MB in the end (delta: 177.7 MB). Free memory was 154.1 MB in the beginning and 282.7 MB in the end (delta: -128.6 MB). Peak memory consumption was 248.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 39]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...