/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:57:54,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:57:54,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:57:54,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:57:54,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:57:54,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:57:54,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:57:54,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:57:54,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:57:54,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:57:54,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:57:54,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:57:54,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:57:54,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:57:54,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:57:54,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:57:54,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:57:54,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:57:54,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:57:54,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:57:54,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:57:54,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:57:54,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:57:54,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:57:54,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:57:54,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:57:54,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:57:54,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:57:54,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:57:54,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:57:54,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:57:54,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:57:54,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:57:54,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:57:54,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:57:54,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:57:54,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:57:54,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:57:54,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:57:54,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:57:54,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:57:54,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:57:54,698 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:57:54,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:57:54,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:57:54,700 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:57:54,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:57:54,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:57:54,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:57:54,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:57:54,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:57:54,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:57:54,703 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:57:54,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:57:54,703 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:57:54,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:57:54,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:57:54,705 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:57:54,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:57:54,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:57:54,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:57:54,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:57:54,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:57:54,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:57:54,706 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:57:55,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:57:55,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:57:55,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:57:55,189 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:57:55,189 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:57:55,190 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-09-04 21:57:55,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e485e1b1a/0a555be76fd24eba9b078506e61d71bf/FLAG8ef7ecca1 [2020-09-04 21:57:55,826 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:57:55,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-09-04 21:57:55,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e485e1b1a/0a555be76fd24eba9b078506e61d71bf/FLAG8ef7ecca1 [2020-09-04 21:57:56,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e485e1b1a/0a555be76fd24eba9b078506e61d71bf [2020-09-04 21:57:56,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:57:56,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:57:56,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:56,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:57:56,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:57:56,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb34a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56, skipping insertion in model container [2020-09-04 21:57:56,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:57:56,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:57:56,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:56,450 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:57:56,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:56,497 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:57:56,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56 WrapperNode [2020-09-04 21:57:56,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:56,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:57:56,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:57:56,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:57:56,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:57:56,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:57:56,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:57:56,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:57:56,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:57:56,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:57:56,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:57:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 21:57:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 21:57:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-09-04 21:57:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:57:56,694 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-09-04 21:57:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 21:57:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 21:57:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:57:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 21:57:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 21:57:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 21:57:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:57:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-04 21:57:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 21:57:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:57:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 21:57:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-09-04 21:57:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 21:57:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:57:56,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:57:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 21:57:57,066 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:57:57,066 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:57:57,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:57 BoogieIcfgContainer [2020-09-04 21:57:57,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:57:57,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:57:57,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:57:57,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:57:57,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:57:56" (1/3) ... [2020-09-04 21:57:57,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c546c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:57, skipping insertion in model container [2020-09-04 21:57:57,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56" (2/3) ... [2020-09-04 21:57:57,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c546c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:57, skipping insertion in model container [2020-09-04 21:57:57,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:57" (3/3) ... [2020-09-04 21:57:57,091 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-09-04 21:57:57,102 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:57:57,111 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:57:57,133 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:57:57,161 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:57:57,161 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:57:57,161 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:57:57,161 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:57:57,161 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:57:57,162 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:57:57,162 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:57:57,162 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:57:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-09-04 21:57:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 21:57:57,194 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:57,195 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-09-04 21:57:57,195 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:57,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1490874143, now seen corresponding path program 1 times [2020-09-04 21:57:57,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:57,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [598687576] [2020-09-04 21:57:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:57,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:57,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:57:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:57,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 21:57:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:57,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [598687576] [2020-09-04 21:57:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:57:57,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 21:57:57,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321592326] [2020-09-04 21:57:57,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:57:57,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:57:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:57:57,711 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 10 states. [2020-09-04 21:57:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:58,721 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2020-09-04 21:57:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:57:58,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-04 21:57:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:58,747 INFO L225 Difference]: With dead ends: 209 [2020-09-04 21:57:58,748 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 21:57:58,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:57:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 21:57:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2020-09-04 21:57:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 21:57:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2020-09-04 21:57:58,895 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 31 [2020-09-04 21:57:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:58,897 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2020-09-04 21:57:58,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:57:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2020-09-04 21:57:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:57:58,903 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:58,904 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-09-04 21:57:58,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:57:58,905 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:58,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1249778318, now seen corresponding path program 1 times [2020-09-04 21:57:58,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:58,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32214089] [2020-09-04 21:57:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:57:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 21:57:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:57:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:57:59,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32214089] [2020-09-04 21:57:59,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:57:59,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:57:59,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761869795] [2020-09-04 21:57:59,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:57:59,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:57:59,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:57:59,402 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2020-09-04 21:58:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:01,138 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2020-09-04 21:58:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:58:01,139 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-09-04 21:58:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:01,149 INFO L225 Difference]: With dead ends: 189 [2020-09-04 21:58:01,149 INFO L226 Difference]: Without dead ends: 187 [2020-09-04 21:58:01,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-09-04 21:58:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-09-04 21:58:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 153. [2020-09-04 21:58:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-04 21:58:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2020-09-04 21:58:01,200 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 52 [2020-09-04 21:58:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:01,201 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2020-09-04 21:58:01,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:58:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2020-09-04 21:58:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:58:01,204 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:01,204 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-09-04 21:58:01,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:58:01,204 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash -448975570, now seen corresponding path program 1 times [2020-09-04 21:58:01,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:01,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371527469] [2020-09-04 21:58:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 21:58:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:58:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:58:01,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371527469] [2020-09-04 21:58:01,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:58:01,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 21:58:01,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589865895] [2020-09-04 21:58:01,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:58:01,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:01,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:58:01,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:58:01,421 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 11 states. [2020-09-04 21:58:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:01,996 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2020-09-04 21:58:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:58:01,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-09-04 21:58:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:01,998 INFO L225 Difference]: With dead ends: 230 [2020-09-04 21:58:01,998 INFO L226 Difference]: Without dead ends: 137 [2020-09-04 21:58:02,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:58:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-09-04 21:58:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-09-04 21:58:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-09-04 21:58:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2020-09-04 21:58:02,027 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 52 [2020-09-04 21:58:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:02,028 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2020-09-04 21:58:02,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:58:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2020-09-04 21:58:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:58:02,030 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:02,030 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-09-04 21:58:02,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:58:02,030 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1366237712, now seen corresponding path program 1 times [2020-09-04 21:58:02,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:02,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752744684] [2020-09-04 21:58:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 21:58:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:58:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 21:58:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 21:58:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:58:02,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752744684] [2020-09-04 21:58:02,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:02,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:58:02,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727174971] [2020-09-04 21:58:02,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:58:02,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:58:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:58:02,316 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 15 states. [2020-09-04 21:58:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:03,328 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-09-04 21:58:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:58:03,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-09-04 21:58:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:03,330 INFO L225 Difference]: With dead ends: 147 [2020-09-04 21:58:03,330 INFO L226 Difference]: Without dead ends: 87 [2020-09-04 21:58:03,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:58:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-09-04 21:58:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2020-09-04 21:58:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 21:58:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-09-04 21:58:03,353 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2020-09-04 21:58:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:03,355 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-09-04 21:58:03,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:58:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-09-04 21:58:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 21:58:03,359 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:03,359 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-09-04 21:58:03,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:58:03,360 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2045890305, now seen corresponding path program 2 times [2020-09-04 21:58:03,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:03,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621569994] [2020-09-04 21:58:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 21:58:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 21:58:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 21:58:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:58:03,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621569994] [2020-09-04 21:58:03,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:03,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:58:03,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708336885] [2020-09-04 21:58:03,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:58:03,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:03,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:58:03,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:58:03,917 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2020-09-04 21:58:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:05,251 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-09-04 21:58:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:58:05,252 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-09-04 21:58:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:05,253 INFO L225 Difference]: With dead ends: 87 [2020-09-04 21:58:05,253 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:58:05,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=298, Invalid=1424, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 21:58:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:58:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:58:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:58:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:58:05,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-09-04 21:58:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:05,258 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:58:05,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:58:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:58:05,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:58:05,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:58:05,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:58:07,332 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 21:58:07,620 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-09-04 21:58:07,742 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-09-04 21:58:07,880 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-09-04 21:58:08,029 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-09-04 21:58:08,194 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 21:58:08,397 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 21:58:08,528 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 21:58:08,652 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 21:58:08,824 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-09-04 21:58:08,943 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 21:58:09,072 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2020-09-04 21:58:09,248 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-09-04 21:58:09,403 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-09-04 21:58:09,561 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-09-04 21:58:09,789 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 21:58:09,909 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 21:58:10,042 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 21:58:10,211 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 21:58:10,338 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 21:58:10,484 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-09-04 21:58:10,661 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-09-04 21:58:10,831 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 21:58:10,952 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 21:58:11,118 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 21:58:11,261 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-09-04 21:58:11,446 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-09-04 21:58:11,713 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-09-04 21:58:11,911 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-09-04 21:58:11,916 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,916 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,916 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,917 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:11,917 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,917 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,918 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,918 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,918 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:58:11,918 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-09-04 21:58:11,919 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 21:58:11,919 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 21:58:11,919 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-09-04 21:58:11,919 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-09-04 21:58:11,919 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 39 48) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:11,920 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 39 48) the Hoare annotation is: true [2020-09-04 21:58:11,920 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-09-04 21:58:11,920 INFO L271 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: true [2020-09-04 21:58:11,920 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 39 48) the Hoare annotation is: true [2020-09-04 21:58:11,920 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:11,920 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-09-04 21:58:11,921 INFO L271 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: true [2020-09-04 21:58:11,921 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:11,921 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (= (select |#memory_int| |main_#t~malloc10.base|) ((as const (Array Int Int)) 0)) [2020-09-04 21:58:11,921 INFO L271 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: true [2020-09-04 21:58:11,922 INFO L264 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:11,923 INFO L271 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: true [2020-09-04 21:58:11,923 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:11,923 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:11,924 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2020-09-04 21:58:11,924 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem8| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (and .cse2 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,924 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-09-04 21:58:11,924 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,925 INFO L264 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem8| 0)) (.cse5 (= check_~ai~0 0)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse5 .cse6)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse5 .cse6) .cse1)))) [2020-09-04 21:58:11,925 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,925 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,926 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 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse5 (= |check_#t~mem1| 0)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x))) (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,926 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,926 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 24) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (= |check_#t~mem2| 0)) (.cse6 (= |check_#t~mem1| 0))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 check_~x)))))) [2020-09-04 21:58:11,927 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (= |check_#t~mem2| 0)) (.cse6 (= |check_#t~mem1| 0))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 check_~x)))))) [2020-09-04 21:58:11,928 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,928 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,928 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 ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 (<= 1 |check_#t~post3|) .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (and (= |check_#t~post3| 0) .cse2 .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,928 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 ((.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and (= |check_#t~post3| 0) .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4) (or (and .cse1 (<= 1 |check_#t~post3|) .cse2 .cse3 (<= 2 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse4)))) [2020-09-04 21:58:11,929 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,929 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 21:58:11,929 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 (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:11,930 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 (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:11,930 INFO L264 CegarLoopResult]: At program point L23-11(lines 23 24) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 21:58:11,930 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-09-04 21:58:11,930 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 21:58:11,930 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2020-09-04 21:58:11,931 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|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= |check_#t~mem7| 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4))))) [2020-09-04 21:58:11,931 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= |check_#t~mem7| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and .cse1 (or (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4) (not (= |check_#in~x| 0)) .cse5) (or (and .cse1 .cse3 .cse4) .cse0 (not (<= 1 |check_#in~x|)) .cse5)))) [2020-09-04 21:58:11,932 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,932 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,932 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,933 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,933 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,933 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 (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:11,933 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,934 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 (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:11,934 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 (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:11,934 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-09-04 21:58:11,934 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,935 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:11,935 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 (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2020-09-04 21:58:11,935 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 37) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2020-09-04 21:58:11,935 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 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-09-04 21:58:11,935 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-09-04 21:58:11,936 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 21:58:11,936 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 21:58:11,936 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 21:58:11,936 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 21:58:11,936 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 21:58:11,937 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-09-04 21:58:11,937 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-09-04 21:58:11,937 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-09-04 21:58:11,964 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.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-09-04 21:58:11,976 INFO L168 Benchmark]: Toolchain (without parser) took 15808.65 ms. Allocated memory was 137.9 MB in the beginning and 357.6 MB in the end (delta: 219.7 MB). Free memory was 101.8 MB in the beginning and 289.3 MB in the end (delta: -187.5 MB). Peak memory consumption was 208.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:11,978 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:58:11,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.67 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:11,980 INFO L168 Benchmark]: Boogie Preprocessor took 123.56 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 180.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:11,981 INFO L168 Benchmark]: RCFGBuilder took 450.51 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 158.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:11,981 INFO L168 Benchmark]: TraceAbstraction took 14894.53 ms. Allocated memory was 201.9 MB in the beginning and 357.6 MB in the end (delta: 155.7 MB). Free memory was 157.5 MB in the beginning and 289.3 MB in the end (delta: -131.7 MB). Peak memory consumption was 200.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:11,993 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.67 ms. Allocated memory is still 137.9 MB. Free memory was 101.6 MB in the beginning and 91.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.56 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.2 MB in the beginning and 180.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 450.51 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 158.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14894.53 ms. Allocated memory was 201.9 MB in the beginning and 357.6 MB in the end (delta: 155.7 MB). Free memory was 157.5 MB in the beginning and 289.3 MB in the end (delta: -131.7 MB). Peak memory consumption was 200.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: \old(cond) == 0 || !(cond == 0) - 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...