/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-86f66a4 [2020-07-07 13:19:41,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:19:41,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:19:41,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:19:41,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:19:41,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:19:41,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:19:41,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:19:41,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:19:41,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:19:41,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:19:41,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:19:41,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:19:41,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:19:41,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:19:41,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:19:41,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:19:41,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:19:41,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:19:41,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:19:41,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:19:41,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:19:41,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:19:41,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:19:41,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:19:41,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:19:41,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:19:41,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:19:41,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:19:41,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:19:41,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:19:41,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:19:41,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:19:41,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:19:41,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:19:41,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:19:41,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:19:41,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:19:41,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:19:41,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:19:41,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:19:41,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:19:41,612 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:19:41,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:19:41,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:19:41,614 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:19:41,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:19:41,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:19:41,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:19:41,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:19:41,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:19:41,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:19:41,621 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:19:41,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:19:41,621 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:19:41,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:19:41,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:19:41,622 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:19:41,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:19:41,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:19:41,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:19:41,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:19:41,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:19:41,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:19:41,623 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:19:41,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:19:41,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:19:41,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:19:41,931 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:19:41,931 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:19:41,932 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-07 13:19:42,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57af0330/98bca628e91744f8a6f352e6b8672c17/FLAG4a85fb962 [2020-07-07 13:19:42,479 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:19:42,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-07-07 13:19:42,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57af0330/98bca628e91744f8a6f352e6b8672c17/FLAG4a85fb962 [2020-07-07 13:19:42,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57af0330/98bca628e91744f8a6f352e6b8672c17 [2020-07-07 13:19:42,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:19:42,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:19:42,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:19:42,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:19:42,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:19:42,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:19:42" (1/1) ... [2020-07-07 13:19:42,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a43687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:42, skipping insertion in model container [2020-07-07 13:19:42,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:19:42" (1/1) ... [2020-07-07 13:19:42,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:19:42,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:19:43,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:19:43,143 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:19:43,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:19:43,185 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:19:43,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43 WrapperNode [2020-07-07 13:19:43,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:19:43,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:19:43,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:19:43,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:19:43,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (1/1) ... [2020-07-07 13:19:43,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (1/1) ... [2020-07-07 13:19:43,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (1/1) ... [2020-07-07 13:19:43,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (1/1) ... [2020-07-07 13:19:43,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (1/1) ... [2020-07-07 13:19:43,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (1/1) ... [2020-07-07 13:19:43,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (1/1) ... [2020-07-07 13:19:43,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:19:43,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:19:43,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:19:43,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:19:43,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (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-07 13:19:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:19:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:19:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-07 13:19:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-07 13:19:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-07 13:19:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:19:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-07 13:19:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-07 13:19:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-07 13:19:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:19:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 13:19:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-07 13:19:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-07 13:19:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:19:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-07 13:19:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-07 13:19:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:19:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-07 13:19:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-07 13:19:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-07 13:19:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:19:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:19:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-07 13:19:43,760 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:19:43,760 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:19:43,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:19:43 BoogieIcfgContainer [2020-07-07 13:19:43,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:19:43,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:19:43,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:19:43,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:19:43,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:19:42" (1/3) ... [2020-07-07 13:19:43,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d3a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:19:43, skipping insertion in model container [2020-07-07 13:19:43,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:43" (2/3) ... [2020-07-07 13:19:43,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d3a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:19:43, skipping insertion in model container [2020-07-07 13:19:43,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:19:43" (3/3) ... [2020-07-07 13:19:43,774 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-07-07 13:19:43,785 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:19:43,794 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:19:43,807 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:19:43,826 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:19:43,827 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:19:43,827 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:19:43,827 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:19:43,827 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:19:43,827 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:19:43,827 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:19:43,828 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:19:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-07 13:19:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-07 13:19:43,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:43,855 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-07 13:19:43,856 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:43,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1490874143, now seen corresponding path program 1 times [2020-07-07 13:19:43,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:43,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2122633547] [2020-07-07 13:19:43,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:44,357 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-07 13:19:44,358 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:44,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2122633547] [2020-07-07 13:19:44,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:44,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:19:44,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644774231] [2020-07-07 13:19:44,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:19:44,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:19:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:19:44,395 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 10 states. [2020-07-07 13:19:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:45,387 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2020-07-07 13:19:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 13:19:45,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-07 13:19:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:45,403 INFO L225 Difference]: With dead ends: 209 [2020-07-07 13:19:45,404 INFO L226 Difference]: Without dead ends: 123 [2020-07-07 13:19:45,411 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-07-07 13:19:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-07 13:19:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2020-07-07 13:19:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-07 13:19:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2020-07-07 13:19:45,503 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 31 [2020-07-07 13:19:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:45,505 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2020-07-07 13:19:45,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:19:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2020-07-07 13:19:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:19:45,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:45,514 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-07 13:19:45,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:19:45,516 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1249778318, now seen corresponding path program 1 times [2020-07-07 13:19:45,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:45,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581324041] [2020-07-07 13:19:45,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,945 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-07 13:19:45,945 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:45,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581324041] [2020-07-07 13:19:45,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:45,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:19:45,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599547976] [2020-07-07 13:19:45,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:19:45,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:45,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:19:45,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:19:45,949 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2020-07-07 13:19:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:47,502 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2020-07-07 13:19:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 13:19:47,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-07-07 13:19:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:47,512 INFO L225 Difference]: With dead ends: 189 [2020-07-07 13:19:47,512 INFO L226 Difference]: Without dead ends: 187 [2020-07-07 13:19:47,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 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-07 13:19:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-07 13:19:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 153. [2020-07-07 13:19:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-07 13:19:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2020-07-07 13:19:47,566 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 52 [2020-07-07 13:19:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:47,567 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2020-07-07 13:19:47,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:19:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2020-07-07 13:19:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:19:47,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:47,572 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-07 13:19:47,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:19:47,572 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -448975570, now seen corresponding path program 1 times [2020-07-07 13:19:47,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:47,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091839357] [2020-07-07 13:19:47,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,830 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-07 13:19:47,831 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:47,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091839357] [2020-07-07 13:19:47,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:47,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 13:19:47,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513319178] [2020-07-07 13:19:47,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 13:19:47,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 13:19:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:19:47,834 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 11 states. [2020-07-07 13:19:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:48,513 INFO L93 Difference]: Finished difference Result 217 states and 233 transitions. [2020-07-07 13:19:48,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 13:19:48,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-07-07 13:19:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:48,516 INFO L225 Difference]: With dead ends: 217 [2020-07-07 13:19:48,519 INFO L226 Difference]: Without dead ends: 147 [2020-07-07 13:19:48,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:19:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-07-07 13:19:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-07-07 13:19:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-07 13:19:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2020-07-07 13:19:48,578 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 52 [2020-07-07 13:19:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:48,578 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2020-07-07 13:19:48,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 13:19:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2020-07-07 13:19:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-07 13:19:48,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:48,589 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-07 13:19:48,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:19:48,590 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1366237712, now seen corresponding path program 1 times [2020-07-07 13:19:48,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:48,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503009315] [2020-07-07 13:19:48,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,900 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-07 13:19:48,900 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:48,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1503009315] [2020-07-07 13:19:48,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:48,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-07 13:19:48,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203067720] [2020-07-07 13:19:48,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 13:19:48,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 13:19:48,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:19:48,903 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 16 states. [2020-07-07 13:19:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:49,953 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2020-07-07 13:19:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:19:49,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2020-07-07 13:19:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:49,959 INFO L225 Difference]: With dead ends: 157 [2020-07-07 13:19:49,959 INFO L226 Difference]: Without dead ends: 97 [2020-07-07 13:19:49,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2020-07-07 13:19:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-07 13:19:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2020-07-07 13:19:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-07 13:19:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2020-07-07 13:19:49,986 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 72 [2020-07-07 13:19:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:49,987 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2020-07-07 13:19:49,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 13:19:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2020-07-07 13:19:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-07 13:19:49,990 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:49,991 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-07 13:19:49,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:19:49,991 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2045890305, now seen corresponding path program 2 times [2020-07-07 13:19:49,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:49,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [362030902] [2020-07-07 13:19:49,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,396 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-07 13:19:50,397 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:50,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [362030902] [2020-07-07 13:19:50,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:50,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:19:50,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309072683] [2020-07-07 13:19:50,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:19:50,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:19:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:19:50,402 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 20 states. [2020-07-07 13:19:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:51,782 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2020-07-07 13:19:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-07 13:19:51,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-07-07 13:19:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:51,784 INFO L225 Difference]: With dead ends: 127 [2020-07-07 13:19:51,785 INFO L226 Difference]: Without dead ends: 125 [2020-07-07 13:19:51,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-07-07 13:19:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-07 13:19:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2020-07-07 13:19:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-07 13:19:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2020-07-07 13:19:51,816 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 73 [2020-07-07 13:19:51,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:51,819 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2020-07-07 13:19:51,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:19:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2020-07-07 13:19:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-07 13:19:51,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:51,824 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:19:51,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:19:51,831 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 347136417, now seen corresponding path program 1 times [2020-07-07 13:19:51,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:51,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589884018] [2020-07-07 13:19:51,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,202 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-07 13:19:52,202 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:52,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589884018] [2020-07-07 13:19:52,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:52,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:19:52,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924860711] [2020-07-07 13:19:52,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:19:52,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:52,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:19:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:19:52,205 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 20 states. [2020-07-07 13:19:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:53,651 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2020-07-07 13:19:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-07 13:19:53,653 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-07-07 13:19:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:53,655 INFO L225 Difference]: With dead ends: 148 [2020-07-07 13:19:53,655 INFO L226 Difference]: Without dead ends: 146 [2020-07-07 13:19:53,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-07-07 13:19:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-07 13:19:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2020-07-07 13:19:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-07-07 13:19:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2020-07-07 13:19:53,686 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 73 [2020-07-07 13:19:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:53,686 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2020-07-07 13:19:53,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:19:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2020-07-07 13:19:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-07 13:19:53,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:53,690 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:19:53,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:19:53,690 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1872198898, now seen corresponding path program 2 times [2020-07-07 13:19:53,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:53,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1861701968] [2020-07-07 13:19:53,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:54,373 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-07 13:19:54,373 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:54,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1861701968] [2020-07-07 13:19:54,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:54,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-07 13:19:54,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371475722] [2020-07-07 13:19:54,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-07 13:19:54,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-07 13:19:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-07 13:19:54,376 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 25 states. [2020-07-07 13:19:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:56,491 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions. [2020-07-07 13:19:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-07 13:19:56,492 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2020-07-07 13:19:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:56,494 INFO L225 Difference]: With dead ends: 175 [2020-07-07 13:19:56,494 INFO L226 Difference]: Without dead ends: 113 [2020-07-07 13:19:56,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-07-07 13:19:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-07 13:19:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2020-07-07 13:19:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-07 13:19:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2020-07-07 13:19:56,510 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 94 [2020-07-07 13:19:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:56,510 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2020-07-07 13:19:56,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-07 13:19:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2020-07-07 13:19:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-07 13:19:56,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:56,512 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:19:56,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:19:56,512 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1392394702, now seen corresponding path program 3 times [2020-07-07 13:19:56,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:56,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2100474336] [2020-07-07 13:19:56,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,047 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-07 13:19:57,048 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:57,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2100474336] [2020-07-07 13:19:57,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:57,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-07 13:19:57,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658033303] [2020-07-07 13:19:57,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-07 13:19:57,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-07 13:19:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-07 13:19:57,050 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 25 states. [2020-07-07 13:19:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:59,221 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2020-07-07 13:19:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-07 13:19:59,222 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2020-07-07 13:19:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:59,222 INFO L225 Difference]: With dead ends: 120 [2020-07-07 13:19:59,223 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:19:59,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=625, Invalid=2915, Unknown=0, NotChecked=0, Total=3540 [2020-07-07 13:19:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:19:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:19:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:19:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:19:59,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2020-07-07 13:19:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:59,226 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:19:59,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-07 13:19:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:19:59,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:19:59,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:19:59,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:20:00,984 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:01,166 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-07-07 13:20:01,379 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2020-07-07 13:20:01,585 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2020-07-07 13:20:01,754 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:01,959 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2020-07-07 13:20:02,143 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2020-07-07 13:20:02,296 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-07-07 13:20:02,474 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2020-07-07 13:20:02,673 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2020-07-07 13:20:02,863 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-07-07 13:20:03,093 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-07-07 13:20:03,287 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-07-07 13:20:03,451 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:03,629 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-07-07 13:20:03,758 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2020-07-07 13:20:03,917 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:04,189 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2020-07-07 13:20:04,359 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-07-07 13:20:04,560 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2020-07-07 13:20:04,782 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2020-07-07 13:20:04,996 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2020-07-07 13:20:05,377 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-07-07 13:20:05,535 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:05,694 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:06,007 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-07-07 13:20:06,167 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:06,463 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-07-07 13:20:06,740 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-07-07 13:20:06,938 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-07-07 13:20:07,084 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2020-07-07 13:20:07,298 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-07-07 13:20:07,483 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2020-07-07 13:20:07,692 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2020-07-07 13:20:08,056 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2020-07-07 13:20:08,255 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-07-07 13:20:08,260 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,260 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,260 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,261 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-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-07 13:20:08,261 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-07 13:20:08,262 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-07 13:20:08,262 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 39 48) the Hoare annotation is: true [2020-07-07 13:20:08,262 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-07 13:20:08,262 INFO L271 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: true [2020-07-07 13:20:08,262 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 39 48) the Hoare annotation is: true [2020-07-07 13:20:08,262 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-07 13:20:08,262 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-07 13:20:08,262 INFO L271 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: true [2020-07-07 13:20:08,262 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:08,262 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-07 13:20:08,263 INFO L271 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: true [2020-07-07 13:20:08,263 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-07 13:20:08,263 INFO L271 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: true [2020-07-07 13:20:08,263 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:08,263 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-07 13:20:08,263 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-07 13:20:08,263 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-07 13:20:08,263 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-07-07 13:20:08,264 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-07 13:20:08,264 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-07 13:20:08,264 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-07 13:20:08,264 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse5 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse1) (or .cse5 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,264 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= 1 |check_#in~x|))) (.cse1 (<= .cse8 |check_#in~n|)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse8 check_~n)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) .cse4 .cse5) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5) (or .cse0 .cse4 .cse5 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse1 (= 0 check_~x) .cse2 .cse3 (= 0 |check_#t~mem1|)) .cse4 .cse5 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:08,264 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse5 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse1) (or .cse5 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,265 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 ((.cse0 (not (<= 1 |check_#in~x|))) (.cse1 (<= .cse8 |check_#in~n|)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse8 check_~n)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) .cse4 .cse5) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5) (or .cse0 .cse4 .cse5 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse1 (= 0 check_~x) .cse2 .cse3 (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|)) .cse4 .cse5 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:08,265 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 ((.cse0 (not (<= 1 |check_#in~x|))) (.cse1 (<= .cse8 |check_#in~n|)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse8 check_~n)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) .cse4 .cse5) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5) (or .cse0 .cse4 .cse5 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse1 (= 0 check_~x) .cse2 .cse3 (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|)) .cse4 .cse5 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:08,265 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse5 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse1) (or .cse5 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,265 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse5 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse1) (or .cse5 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,266 INFO L264 CegarLoopResult]: At program point L23-6(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)) (.cse0 (not (<= 1 |check_#in~x|))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and .cse1 .cse2 (<= 1 |check_#t~post3|) .cse3 (<= 1 check_~x)) .cse4 .cse5) (or (and (= 0 |check_#t~post3|) .cse1 (= 0 check_~x) .cse2 .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5) (or .cse0 .cse4 .cse5 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,266 INFO L264 CegarLoopResult]: At program point L23-7(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (<= .cse8 |check_#in~n|)) (.cse1 (= .cse7 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse8 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse4 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (and (= 0 |check_#t~post3|) .cse0 .cse1 (<= 1 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 2 check_~x)) .cse5 .cse3 .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse4)))) [2020-07-07 13:20:08,266 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse5 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse1) (or .cse5 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,266 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) .cse1 .cse2) (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (= 0 check_~x) (<= .cse3 check_~n))) .cse1 .cse2 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:08,267 INFO L264 CegarLoopResult]: At program point L23-9(line 23) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or .cse2 (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (= .cse4 (select |#memory_int| check_~a.base)) (<= .cse3 check_~n) (<= 1 check_~x))) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse1) (or .cse2 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,267 INFO L264 CegarLoopResult]: At program point L23-10(line 23) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or .cse2 (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (= .cse4 (select |#memory_int| check_~a.base)) (<= .cse3 check_~n) (<= 1 check_~x))) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse1) (or .cse2 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,267 INFO L264 CegarLoopResult]: At program point L23-11(lines 23 24) the Hoare annotation is: (let ((.cse10 (+ check_~y 1)) (.cse9 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= 1 |check_#in~x|))) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse9 (select |#memory_int| |check_#in~a.base|)))) (.cse4 (<= .cse10 |check_#in~n|)) (.cse7 (<= .cse10 check_~n)) (.cse8 (<= 2 check_~x)) (.cse5 (= .cse9 (select |#memory_int| check_~a.base))) (.cse6 (<= 1 check_~x)) (.cse2 (<= (+ check_~y 2) check_~n))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 .cse1 .cse2) (or .cse3 .cse1 (not (= 0 |check_#in~x|)) (and .cse4 .cse5 .cse6 .cse7)) (or .cse0 .cse3 .cse1 (not (<= 2 |check_#in~x|)) .cse8) (or .cse0 .cse3 .cse1 (and .cse4 .cse5 .cse7 .cse8) (and .cse5 .cse6 .cse2))))) [2020-07-07 13:20:08,267 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-07 13:20:08,267 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-07 13:20:08,267 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-07 13:20:08,268 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 (= .cse5 (select |#memory_int| |check_#in~a.base|)))) (.cse2 (= .cse5 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|))) (and (or (not (<= 1 |check_#in~x|)) .cse0 .cse1 (and .cse2 .cse3)) (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (or (= 0 check_~x) (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x)))) .cse3))))) [2020-07-07 13:20:08,268 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-07 13:20:08,268 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-07 13:20:08,268 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-07 13:20:08,268 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-07 13:20:08,268 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-07 13:20:08,269 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-07 13:20:08,269 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or .cse2 (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (= .cse4 (select |#memory_int| check_~a.base)) (<= .cse3 check_~n) (<= 1 check_~x))) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse1) (or .cse2 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,269 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-07 13:20:08,269 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 1 |check_#in~x|))) (.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|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse1) (or .cse2 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (= .cse5 (select |#memory_int| check_~a.base)) (<= .cse4 check_~n) (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n))) .cse2 .cse0 .cse1)))) [2020-07-07 13:20:08,269 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse3 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or .cse2 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse2 .cse0 (and (= .cse3 (select |#memory_int| check_~a.base)) (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n) (<= (+ check_~y 2) check_~n)) .cse1)))) [2020-07-07 13:20:08,270 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-07 13:20:08,270 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse5 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse1) (or .cse5 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,270 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse5 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse1) (or .cse5 .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x))))) [2020-07-07 13:20:08,270 INFO L264 CegarLoopResult]: At program point L14(lines 14 37) the Hoare annotation is: (let ((.cse0 (not (<= 1 |check_#in~x|))) (.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 .cse0 .cse1 .cse2 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (= 0 check_~x) .cse1 .cse2 (not (= 0 |check_#in~x|))) (or .cse0 (<= 1 check_~x) .cse1 .cse2))) [2020-07-07 13:20:08,270 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 37) the Hoare annotation is: (let ((.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (not (<= 1 |check_#in~x|))) (.cse2 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x)) .cse1 .cse2 (not (= 0 |check_#in~x|))) (or (and .cse3 (<= 1 check_~x)) .cse0 .cse1 .cse2) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 .cse2 (<= (+ check_~y 2) |check_#in~n|)))) [2020-07-07 13:20:08,270 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 37) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (<= 1 |check_#in~x|))) (.cse3 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x) .cse1) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or .cse4 .cse2 (and .cse0 .cse1 (<= 1 check_~x)) .cse3) (or .cse4 .cse2 .cse3 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse3 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-07 13:20:08,271 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-07 13:20:08,271 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-07 13:20:08,271 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-07 13:20:08,271 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 13:20:08,271 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-07 13:20:08,271 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 13:20:08,271 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-07 13:20:08,271 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-07 13:20:08,271 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-07 13:20:08,287 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-07 13:20:08,291 INFO L168 Benchmark]: Toolchain (without parser) took 25388.23 ms. Allocated memory was 146.3 MB in the beginning and 399.5 MB in the end (delta: 253.2 MB). Free memory was 104.2 MB in the beginning and 272.4 MB in the end (delta: -168.3 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:08,292 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 13:20:08,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.99 ms. Allocated memory is still 146.3 MB. Free memory was 104.0 MB in the beginning and 93.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:08,293 INFO L168 Benchmark]: Boogie Preprocessor took 135.26 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.6 MB in the beginning and 181.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:08,294 INFO L168 Benchmark]: RCFGBuilder took 442.99 ms. Allocated memory is still 203.9 MB. Free memory was 181.1 MB in the beginning and 160.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:08,295 INFO L168 Benchmark]: TraceAbstraction took 24522.88 ms. Allocated memory was 203.9 MB in the beginning and 399.5 MB in the end (delta: 195.6 MB). Free memory was 159.7 MB in the beginning and 272.4 MB in the end (delta: -112.7 MB). Peak memory consumption was 264.9 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:08,299 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.28 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.99 ms. Allocated memory is still 146.3 MB. Free memory was 104.0 MB in the beginning and 93.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.26 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.6 MB in the beginning and 181.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 442.99 ms. Allocated memory is still 203.9 MB. Free memory was 181.1 MB in the beginning and 160.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24522.88 ms. Allocated memory was 203.9 MB in the beginning and 399.5 MB in the end (delta: 195.6 MB). Free memory was 159.7 MB in the beginning and 272.4 MB in the end (delta: -112.7 MB). Peak memory consumption was 264.9 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...