/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_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 13:15:53,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 13:15:53,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 13:15:53,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 13:15:53,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 13:15:53,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 13:15:53,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 13:15:53,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 13:15:53,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 13:15:53,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 13:15:53,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 13:15:53,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 13:15:53,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 13:15:53,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 13:15:53,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 13:15:53,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 13:15:53,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 13:15:53,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 13:15:53,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 13:15:53,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 13:15:53,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 13:15:53,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 13:15:53,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 13:15:53,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 13:15:53,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 13:15:53,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 13:15:53,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 13:15:53,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 13:15:53,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 13:15:53,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 13:15:53,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 13:15:53,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 13:15:53,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 13:15:53,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 13:15:53,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 13:15:53,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 13:15:53,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 13:15:53,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 13:15:53,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 13:15:53,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 13:15:53,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 13:15:53,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 13:15:53,436 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 13:15:53,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 13:15:53,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 13:15:53,438 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 13:15:53,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 13:15:53,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 13:15:53,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 13:15:53,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 13:15:53,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 13:15:53,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 13:15:53,439 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 13:15:53,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 13:15:53,440 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 13:15:53,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 13:15:53,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 13:15:53,440 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 13:15:53,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 13:15:53,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 13:15:53,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:15:53,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 13:15:53,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 13:15:53,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 13:15:53,442 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-17 13:15:53,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 13:15:53,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 13:15:53,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 13:15:53,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 13:15:53,773 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 13:15:53,773 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-17 13:15:53,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d2536d5/7aa7890ce44241fca08bd382eac195fe/FLAG6fa5aec15 [2020-07-17 13:15:54,295 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 13:15:54,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-17 13:15:54,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d2536d5/7aa7890ce44241fca08bd382eac195fe/FLAG6fa5aec15 [2020-07-17 13:15:54,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d2536d5/7aa7890ce44241fca08bd382eac195fe [2020-07-17 13:15:54,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 13:15:54,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 13:15:54,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 13:15:54,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 13:15:54,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 13:15:54,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79180976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54, skipping insertion in model container [2020-07-17 13:15:54,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:54,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 13:15:54,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 13:15:54,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:15:54,929 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 13:15:54,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:15:54,968 INFO L208 MainTranslator]: Completed translation [2020-07-17 13:15:54,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54 WrapperNode [2020-07-17 13:15:54,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 13:15:54,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 13:15:54,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 13:15:54,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 13:15:55,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:55,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:55,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:55,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:55,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:55,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:55,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... [2020-07-17 13:15:55,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 13:15:55,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 13:15:55,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 13:15:55,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 13:15:55,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:15:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 13:15:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 13:15:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 13:15:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 13:15:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-17 13:15:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 13:15:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-17 13:15:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 13:15:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 13:15:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 13:15:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 13:15:55,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 13:15:55,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 13:15:55,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 13:15:55,173 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-17 13:15:55,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 13:15:55,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 13:15:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 13:15:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-17 13:15:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 13:15:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 13:15:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 13:15:55,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 13:15:55,514 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 13:15:55,514 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 13:15:55,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:15:55 BoogieIcfgContainer [2020-07-17 13:15:55,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 13:15:55,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 13:15:55,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 13:15:55,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 13:15:55,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 01:15:54" (1/3) ... [2020-07-17 13:15:55,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef5a2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:15:55, skipping insertion in model container [2020-07-17 13:15:55,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:54" (2/3) ... [2020-07-17 13:15:55,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef5a2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:15:55, skipping insertion in model container [2020-07-17 13:15:55,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:15:55" (3/3) ... [2020-07-17 13:15:55,531 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-17 13:15:55,542 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 13:15:55,550 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 13:15:55,565 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 13:15:55,585 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 13:15:55,585 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 13:15:55,585 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-17 13:15:55,585 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 13:15:55,585 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 13:15:55,586 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 13:15:55,586 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 13:15:55,586 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 13:15:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-17 13:15:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 13:15:55,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:55,619 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 13:15:55,620 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:55,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-07-17 13:15:55,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:55,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749686041] [2020-07-17 13:15:55,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 13:15:56,136 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:56,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749686041] [2020-07-17 13:15:56,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:56,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-17 13:15:56,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608294536] [2020-07-17 13:15:56,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 13:15:56,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 13:15:56,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-17 13:15:56,168 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-07-17 13:15:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:15:57,093 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-07-17 13:15:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 13:15:57,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-17 13:15:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:15:57,109 INFO L225 Difference]: With dead ends: 221 [2020-07-17 13:15:57,110 INFO L226 Difference]: Without dead ends: 138 [2020-07-17 13:15:57,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 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-17 13:15:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-17 13:15:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-07-17 13:15:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-17 13:15:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-07-17 13:15:57,189 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-07-17 13:15:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:15:57,190 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-07-17 13:15:57,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 13:15:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-07-17 13:15:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 13:15:57,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:57,194 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 13:15:57,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 13:15:57,195 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-07-17 13:15:57,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:57,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [288090786] [2020-07-17 13:15:57,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 13:15:57,475 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:57,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [288090786] [2020-07-17 13:15:57,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:57,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-17 13:15:57,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056265700] [2020-07-17 13:15:57,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 13:15:57,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 13:15:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-17 13:15:57,478 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-07-17 13:15:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:15:58,345 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-17 13:15:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 13:15:58,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-17 13:15:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:15:58,350 INFO L225 Difference]: With dead ends: 128 [2020-07-17 13:15:58,351 INFO L226 Difference]: Without dead ends: 108 [2020-07-17 13:15:58,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-07-17 13:15:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-17 13:15:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-07-17 13:15:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-17 13:15:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-07-17 13:15:58,389 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-07-17 13:15:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:15:58,390 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-07-17 13:15:58,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 13:15:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-17 13:15:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-17 13:15:58,392 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:58,393 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2020-07-17 13:15:58,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 13:15:58,396 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-07-17 13:15:58,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:58,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1916384486] [2020-07-17 13:15:58,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 13:15:58,763 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:58,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1916384486] [2020-07-17 13:15:58,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:58,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-17 13:15:58,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567004430] [2020-07-17 13:15:58,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 13:15:58,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 13:15:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-17 13:15:58,766 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-07-17 13:16:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:00,299 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-07-17 13:16:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 13:16:00,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-17 13:16:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:00,303 INFO L225 Difference]: With dead ends: 179 [2020-07-17 13:16:00,303 INFO L226 Difference]: Without dead ends: 177 [2020-07-17 13:16:00,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-07-17 13:16:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-17 13:16:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-07-17 13:16:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-17 13:16:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-07-17 13:16:00,333 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-07-17 13:16:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:00,334 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-07-17 13:16:00,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 13:16:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-07-17 13:16:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-17 13:16:00,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:00,337 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2020-07-17 13:16:00,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 13:16:00,337 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-07-17 13:16:00,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:00,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112004918] [2020-07-17 13:16:00,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 13:16:00,610 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:00,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112004918] [2020-07-17 13:16:00,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:00,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-17 13:16:00,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151695043] [2020-07-17 13:16:00,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 13:16:00,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:00,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 13:16:00,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-17 13:16:00,614 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-07-17 13:16:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:02,060 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-07-17 13:16:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 13:16:02,061 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-17 13:16:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:02,064 INFO L225 Difference]: With dead ends: 221 [2020-07-17 13:16:02,064 INFO L226 Difference]: Without dead ends: 219 [2020-07-17 13:16:02,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-07-17 13:16:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-17 13:16:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-07-17 13:16:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-17 13:16:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-07-17 13:16:02,100 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-07-17 13:16:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:02,100 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-07-17 13:16:02,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 13:16:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-07-17 13:16:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-17 13:16:02,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:02,104 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:16:02,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 13:16:02,104 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:02,105 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-07-17 13:16:02,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:02,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702356401] [2020-07-17 13:16:02,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 13:16:02,311 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:02,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702356401] [2020-07-17 13:16:02,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:02,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-17 13:16:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575809203] [2020-07-17 13:16:02,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 13:16:02,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 13:16:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-17 13:16:02,314 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-07-17 13:16:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:03,222 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-17 13:16:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 13:16:03,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-17 13:16:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:03,230 INFO L225 Difference]: With dead ends: 206 [2020-07-17 13:16:03,230 INFO L226 Difference]: Without dead ends: 142 [2020-07-17 13:16:03,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-07-17 13:16:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-17 13:16:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-07-17 13:16:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-17 13:16:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-07-17 13:16:03,266 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-07-17 13:16:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:03,267 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-07-17 13:16:03,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 13:16:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-07-17 13:16:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-17 13:16:03,273 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:03,273 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1] [2020-07-17 13:16:03,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 13:16:03,277 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-07-17 13:16:03,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:03,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1468746240] [2020-07-17 13:16:03,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-17 13:16:03,684 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:03,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1468746240] [2020-07-17 13:16:03,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:03,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-17 13:16:03,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914635321] [2020-07-17 13:16:03,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 13:16:03,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:03,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 13:16:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-17 13:16:03,687 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-07-17 13:16:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:05,305 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-07-17 13:16:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-17 13:16:05,307 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-17 13:16:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:05,309 INFO L225 Difference]: With dead ends: 168 [2020-07-17 13:16:05,309 INFO L226 Difference]: Without dead ends: 166 [2020-07-17 13:16:05,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 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-17 13:16:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-17 13:16:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-07-17 13:16:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-17 13:16:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-07-17 13:16:05,327 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-07-17 13:16:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:05,328 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-07-17 13:16:05,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 13:16:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-07-17 13:16:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-17 13:16:05,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:05,330 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:16:05,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 13:16:05,330 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-07-17 13:16:05,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:05,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379104492] [2020-07-17 13:16:05,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-17 13:16:05,736 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:05,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379104492] [2020-07-17 13:16:05,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:05,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-17 13:16:05,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532154715] [2020-07-17 13:16:05,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 13:16:05,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:05,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 13:16:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-17 13:16:05,741 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-07-17 13:16:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:07,465 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-07-17 13:16:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-17 13:16:07,466 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-17 13:16:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:07,469 INFO L225 Difference]: With dead ends: 191 [2020-07-17 13:16:07,469 INFO L226 Difference]: Without dead ends: 189 [2020-07-17 13:16:07,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 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-17 13:16:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-17 13:16:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-07-17 13:16:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-17 13:16:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-07-17 13:16:07,494 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-07-17 13:16:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:07,495 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-07-17 13:16:07,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 13:16:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-17 13:16:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-17 13:16:07,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:07,497 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:16:07,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 13:16:07,497 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-07-17 13:16:07,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:07,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821135526] [2020-07-17 13:16:07,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-17 13:16:07,865 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:07,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821135526] [2020-07-17 13:16:07,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:07,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-17 13:16:07,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729190720] [2020-07-17 13:16:07,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 13:16:07,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 13:16:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-17 13:16:07,868 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-07-17 13:16:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:09,614 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-07-17 13:16:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-17 13:16:09,615 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-17 13:16:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:09,618 INFO L225 Difference]: With dead ends: 208 [2020-07-17 13:16:09,618 INFO L226 Difference]: Without dead ends: 206 [2020-07-17 13:16:09,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-07-17 13:16:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-17 13:16:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-07-17 13:16:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-17 13:16:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-07-17 13:16:09,644 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-07-17 13:16:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:09,645 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-07-17 13:16:09,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 13:16:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-07-17 13:16:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-17 13:16:09,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:09,647 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1] [2020-07-17 13:16:09,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 13:16:09,648 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:09,648 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-07-17 13:16:09,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:09,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939870047] [2020-07-17 13:16:09,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-17 13:16:10,198 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:10,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939870047] [2020-07-17 13:16:10,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:10,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-17 13:16:10,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666364683] [2020-07-17 13:16:10,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-17 13:16:10,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-17 13:16:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-17 13:16:10,204 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-07-17 13:16:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:12,715 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-07-17 13:16:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-17 13:16:12,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-17 13:16:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:12,718 INFO L225 Difference]: With dead ends: 237 [2020-07-17 13:16:12,718 INFO L226 Difference]: Without dead ends: 171 [2020-07-17 13:16:12,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 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-17 13:16:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-17 13:16:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-07-17 13:16:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-17 13:16:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-17 13:16:12,740 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-07-17 13:16:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:12,740 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-17 13:16:12,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-17 13:16:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-17 13:16:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-17 13:16:12,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:16:12,742 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1] [2020-07-17 13:16:12,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 13:16:12,743 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:16:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:16:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-07-17 13:16:12,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:16:12,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938286763] [2020-07-17 13:16:12,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:16:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:16:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-17 13:16:13,833 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:16:13,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938286763] [2020-07-17 13:16:13,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:16:13,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2020-07-17 13:16:13,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498528951] [2020-07-17 13:16:13,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-17 13:16:13,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:16:13,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-17 13:16:13,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2020-07-17 13:16:13,836 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 31 states. [2020-07-17 13:16:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:16:15,359 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-07-17 13:16:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-17 13:16:15,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2020-07-17 13:16:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:16:15,361 INFO L225 Difference]: With dead ends: 163 [2020-07-17 13:16:15,361 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 13:16:15,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=367, Invalid=2285, Unknown=0, NotChecked=0, Total=2652 [2020-07-17 13:16:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 13:16:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 13:16:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 13:16:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 13:16:15,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-07-17 13:16:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:16:15,364 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 13:16:15,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-07-17 13:16:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 13:16:15,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 13:16:15,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 13:16:15,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 13:16:17,533 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2020-07-17 13:16:17,778 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-07-17 13:16:18,135 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2020-07-17 13:16:18,396 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-07-17 13:16:18,602 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-17 13:16:18,955 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-07-17 13:16:19,177 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-17 13:16:19,403 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-17 13:16:19,728 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-07-17 13:16:19,837 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-07-17 13:16:20,179 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-17 13:16:20,553 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2020-07-17 13:16:20,676 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-07-17 13:16:21,014 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-07-17 13:16:21,235 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-17 13:16:21,587 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2020-07-17 13:16:21,847 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-07-17 13:16:22,105 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-07-17 13:16:22,242 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2020-07-17 13:16:22,403 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2020-07-17 13:16:22,612 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-17 13:16:22,886 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-07-17 13:16:23,051 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2020-07-17 13:16:23,294 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-07-17 13:16:23,538 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-07-17 13:16:23,822 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-07-17 13:16:24,084 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-07-17 13:16:24,206 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-07-17 13:16:24,542 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-07-17 13:16:24,898 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-07-17 13:16:25,136 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2020-07-17 13:16:25,296 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2020-07-17 13:16:25,647 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-07-17 13:16:25,910 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-07-17 13:16:26,044 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2020-07-17 13:16:26,375 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-07-17 13:16:26,735 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2020-07-17 13:16:26,960 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-17 13:16:27,173 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-17 13:16:27,549 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2020-07-17 13:16:27,585 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,585 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,585 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 13:16:27,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,585 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-07-17 13:16:27,586 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-17 13:16:27,587 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,587 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-07-17 13:16:27,587 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,587 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,588 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-07-17 13:16:27,588 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-17 13:16:27,588 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,589 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|)) [2020-07-17 13:16:27,589 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,589 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,589 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,589 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,590 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,590 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,590 INFO L264 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,590 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,590 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,591 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,591 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,591 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-17 13:16:27,591 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,591 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,591 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,591 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-17 13:16:27,592 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse9 (select |#memory_int| check_~a.base))) (.cse7 (<= 1 |check_#in~x|)) (.cse8 (= .cse9 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse6 (and .cse0 .cse1 .cse2 .cse7 .cse8)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not .cse8))) (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 .cse6 .cse4 .cse5 (not (<= 2 |check_#in~x|))) (or .cse6 (not .cse7) .cse4 (not (= |check_#in~y| check_~y0~0)) .cse5 (not (= |check_#in~x| (+ check_~x0~0 1)))))))) [2020-07-17 13:16:27,592 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse3 (<= 1 |check_#in~x|)) (.cse4 (= .cse5 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse0 (and (= 0 check_~ax~0) (= 0 check_~ai~0) (= .cse5 (select |#memory_int| check_~a.base)) .cse3 .cse4)) (.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not .cse4))) (and (or .cse0 .cse1 .cse2 (not (<= 2 |check_#in~x|))) (or .cse0 (not .cse3) .cse1 (not (= |check_#in~y| check_~y0~0)) .cse2 (not (= |check_#in~x| (+ check_~x0~0 1)))))))) [2020-07-17 13:16:27,592 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-17 13:16:27,592 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse4 (= .cse8 (select |#memory_int| check_~a.base))) (.cse0 (<= 1 |check_#in~x|)) (.cse7 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse6 (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse1 (and .cse4 .cse0 .cse7 .cse6)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or (not .cse0) .cse1 .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse1 .cse2 .cse3 (not (<= 2 |check_#in~x|))) (or (and .cse4 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))))))) [2020-07-17 13:16:27,593 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 |check_#t~mem6|)) (.cse1 (= .cse9 (select |#memory_int| check_~a.base))) (.cse6 (<= 1 |check_#in~x|)) (.cse8 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse7 (= .cse9 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse5 (and .cse0 .cse1 .cse6 .cse8 .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse7))) (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 .cse5 .cse3 .cse4 (not (<= 2 |check_#in~x|))) (or .cse5 (not .cse6) .cse3 (not (= |check_#in~y| check_~y0~0)) .cse4 (not (= |check_#in~x| (+ check_~x0~0 1)))))))) [2020-07-17 13:16:27,593 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0))) (let ((.cse4 (= 0 check_~ai~0)) (.cse5 (= 0 |check_#t~mem6|)) (.cse6 (= .cse9 (select |#memory_int| check_~a.base))) (.cse1 (<= 1 |check_#in~x|)) (.cse8 (= .cse9 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse0 (and .cse4 .cse5 .cse6 .cse1 .cse8)) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not .cse8))) (and (or .cse0 (not .cse1) .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (and .cse4 .cse5 .cse6 (or (= 0 check_~x) (let ((.cse7 (+ check_~y 1))) (and (<= .cse7 |check_#in~n|) (<= .cse7 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or .cse0 .cse2 .cse3 (not (<= 2 |check_#in~x|))))))) [2020-07-17 13:16:27,593 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse4 (= .cse8 (select |#memory_int| check_~a.base))) (.cse0 (<= 1 |check_#in~x|)) (.cse7 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse6 (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse1 (and .cse4 .cse0 .cse7 .cse6)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or (not .cse0) .cse1 .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse1 .cse2 .cse3 (not (<= 2 |check_#in~x|))) (or (and .cse4 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))))))) [2020-07-17 13:16:27,593 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse4 (= .cse8 (select |#memory_int| check_~a.base))) (.cse0 (<= 1 |check_#in~x|)) (.cse7 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse6 (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse1 (and .cse4 .cse0 .cse7 .cse6)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or (not .cse0) .cse1 .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse1 .cse2 .cse3 (not (<= 2 |check_#in~x|))) (or (and .cse4 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))))))) [2020-07-17 13:16:27,594 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= 2 |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|)) (let ((.cse2 (+ check_~y 2))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n))) .cse3 .cse1) (or .cse0 .cse1 .cse3 (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (= .cse5 (select |#memory_int| check_~a.base)) (<= .cse4 check_~n) (<= 2 check_~x)))) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,594 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse4 (= .cse8 (select |#memory_int| check_~a.base))) (.cse0 (<= 1 |check_#in~x|)) (.cse7 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse6 (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse1 (and .cse4 .cse0 .cse7 .cse6)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or (not .cse0) .cse1 .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse1 .cse2 .cse3 (not (<= 2 |check_#in~x|))) (or (and .cse4 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))))))) [2020-07-17 13:16:27,594 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse2 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (= .cse2 (select |#memory_int| check_~a.base)) (<= .cse1 check_~n) (<= (+ |check_#t~post4| 1) check_~n) (<= 2 check_~x))) .cse3 .cse4) (or .cse0 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse4 .cse3) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,594 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse2 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (and (= .cse2 (select |#memory_int| check_~a.base)) (<= (+ |check_#t~post4| 1) check_~n) (<= (+ check_~y 2) check_~n) (<= 2 check_~x)) .cse0 .cse1 (not (<= 2 |check_#in~x|)))))) [2020-07-17 13:16:27,594 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse6 (not (<= 2 |check_#in~x|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.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 (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse6 .cse1) (or .cse0 .cse1 .cse6 (and .cse2 .cse3 .cse4 (<= 2 check_~x))) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1))) (and (= |check_#in~i| check_~i) (< check_~x check_~y) (= |check_#in~y| check_~y) (= check_~a.offset |check_#in~a.offset|) (= |check_#in~x| check_~x) (= check_~a.base |check_#in~a.base|) (= |check_#in~n| check_~n)))))) [2020-07-17 13:16:27,595 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 ((.cse6 (not (<= 2 |check_#in~x|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.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 (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse6 .cse1) (or .cse0 .cse1 .cse6 (and .cse2 .cse3 .cse4 (<= 2 check_~x))) (or (not (<= 1 |check_#in~x|)) (and (= |check_#in~i| check_~i) (= |check_#in~y| check_~y) (= check_~a.offset |check_#in~a.offset|) (= |check_#in~x| check_~x) (= check_~a.base |check_#in~a.base|) (= |check_#in~n| check_~n)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,595 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse4 (<= .cse9 |check_#in~n|)) (.cse1 (<= 1 |check_#in~x|)) (.cse5 (<= .cse9 check_~n)) (.cse7 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse6 (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse0 (and .cse4 .cse1 (= .cse8 (select |#memory_int| check_~a.base)) .cse5 (<= 1 check_~x) .cse7 .cse6)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or .cse0 (not .cse1) .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse0 .cse2 .cse3 (not (<= 2 |check_#in~x|))) (or (and .cse4 (= 0 check_~x) .cse5) .cse2 .cse3 (not (= 0 |check_#in~x|))))))) [2020-07-17 13:16:27,595 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (<= 1 |check_#in~x|)) (.cse6 (= .cse4 (select |#memory_int| |check_#in~a.base|))) (.cse5 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse1 (not .cse5)) (.cse2 (not .cse6)) (.cse3 (and .cse0 (= .cse4 (select |#memory_int| check_~a.base)) .cse5 .cse6))) (and (or (not .cse0) .cse1 (not (= |check_#in~y| check_~y0~0)) .cse2 .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse1 .cse2 (not (<= 2 |check_#in~x|)) .cse3))))) [2020-07-17 13:16:27,595 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0))) (let ((.cse4 (= 0 check_~ai~0)) (.cse5 (= .cse9 (select |#memory_int| check_~a.base))) (.cse0 (<= 1 |check_#in~x|)) (.cse8 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse7 (= .cse9 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse1 (and .cse4 .cse5 .cse0 .cse8 .cse7)) (.cse2 (not .cse8)) (.cse3 (not .cse7))) (and (or (not .cse0) .cse1 .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (and .cse4 .cse5 (or (= 0 check_~x) (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or .cse1 .cse2 .cse3 (not (<= 2 |check_#in~x|))))))) [2020-07-17 13:16:27,595 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse10 ((as const (Array Int Int)) 0))) (let ((.cse3 (= 0 check_~ai~0)) (.cse4 (= .cse10 (select |#memory_int| check_~a.base))) (.cse7 (<= 1 |check_#in~x|)) (.cse6 (= 0 |check_#t~mem7|)) (.cse9 (= .cse10 (select |#memory_int| |check_#in~a.base|))) (.cse8 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (and .cse3 .cse4 .cse7 .cse8 .cse6 .cse9))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) .cse2) (or (and .cse3 .cse4 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x)))) .cse6) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not .cse7) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 .cse2 (not (= |check_#in~x| (+ check_~x0~0 1)))))))) [2020-07-17 13:16:27,596 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse11 ((as const (Array Int Int)) 0))) (let ((.cse4 (= 0 check_~ax~0)) (.cse5 (= 0 check_~ai~0)) (.cse6 (= .cse11 (select |#memory_int| check_~a.base))) (.cse0 (<= 1 |check_#in~x|)) (.cse10 (<= (+ |check_#in~y| 1) |check_#in~n|)) (.cse8 (= 0 |check_#t~mem7|)) (.cse9 (= .cse11 (select |#memory_int| |check_#in~a.base|)))) (let ((.cse1 (and .cse4 .cse5 .cse6 .cse0 .cse10 .cse8 .cse9)) (.cse2 (not .cse10)) (.cse3 (not .cse9))) (and (or (not .cse0) .cse1 .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (and .cse4 .cse5 .cse6 (or (= 0 check_~x) (let ((.cse7 (+ check_~y 1))) (and (<= .cse7 |check_#in~n|) (<= .cse7 check_~n) (<= 1 check_~x)))) .cse8) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or .cse1 .cse2 .cse3 (not (<= 2 |check_#in~x|))))))) [2020-07-17 13:16:27,596 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse8 (not (<= 2 |check_#in~x|))) (.cse0 (<= .cse10 |check_#in~n|)) (.cse2 (= .cse9 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse10 check_~n)) (.cse1 (= check_~y0~0 check_~y)) (.cse4 (= check_~x0~0 check_~x)) (.cse5 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (= .cse9 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse7 (+ check_~y 2))) (and (<= .cse7 |check_#in~n|) (<= .cse7 check_~n))) .cse8 .cse6) (or .cse5 .cse6 .cse8 (and .cse0 .cse2 .cse3 (<= 2 check_~x))) (or (not (<= 1 |check_#in~x|)) (and .cse1 (<= 1 check_~x) .cse4) .cse5 (not (= |check_#in~y| check_~y0~0)) .cse6 (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,596 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse10 ((as const (Array Int Int)) 0)) (.cse11 (+ check_~y 1))) (let ((.cse1 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse11 |check_#in~n|)) (.cse7 (= check_~y0~0 check_~y)) (.cse5 (= .cse10 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse11 check_~n)) (.cse8 (= check_~x0~0 check_~x)) (.cse9 (= 0 |check_#t~mem1|)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (= .cse10 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse0 (+ check_~y 2))) (and (<= .cse0 |check_#in~n|) (<= .cse0 check_~n))) .cse1 .cse2) (or .cse3 .cse2 .cse1 (and .cse4 .cse5 .cse6 (<= 2 check_~x))) (or (and .cse7 (<= 1 check_~x) .cse8 .cse9) (not (<= 1 |check_#in~x|)) .cse3 (not (= |check_#in~y| check_~y0~0)) .cse2 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (and .cse4 (= 0 check_~x) .cse7 .cse5 .cse6 .cse8 .cse9) .cse3 .cse2 (not (= 0 |check_#in~x|)))))) [2020-07-17 13:16:27,596 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse7 (not (<= 2 |check_#in~x|))) (.cse0 (<= .cse9 |check_#in~n|)) (.cse1 (= .cse8 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse9 check_~n)) (.cse3 (= check_~x0~0 check_~x)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse8 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x) .cse1 .cse2 .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse7 .cse5) (or .cse4 .cse5 .cse7 (and .cse0 .cse1 .cse2 (<= 2 check_~x))) (or (not (<= 1 |check_#in~x|)) (and (= check_~y0~0 check_~y) (<= 1 check_~x) .cse3) .cse4 (not (= |check_#in~y| check_~y0~0)) .cse5 (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,597 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse11 ((as const (Array Int Int)) 0)) (.cse12 (+ check_~y 1))) (let ((.cse1 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse12 |check_#in~n|)) (.cse6 (= .cse11 (select |#memory_int| check_~a.base))) (.cse7 (<= .cse12 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (= .cse11 (select |#memory_int| |check_#in~a.base|)))) (.cse5 (= check_~y0~0 check_~y)) (.cse8 (= check_~x0~0 check_~x)) (.cse9 (= 0 |check_#t~mem1|)) (.cse10 (= 0 |check_#t~mem2|))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse0 (+ check_~y 2))) (and (<= .cse0 |check_#in~n|) (<= .cse0 check_~n))) .cse1 .cse2) (or .cse3 .cse2 (not (= 0 |check_#in~x|)) (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse3 .cse2 .cse1 (and .cse4 .cse6 .cse7 (<= 2 check_~x))) (or (not (<= 1 |check_#in~x|)) .cse3 (not (= |check_#in~y| check_~y0~0)) .cse2 (and .cse5 (<= 1 check_~x) .cse8 .cse9 .cse10) (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,597 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 (+ check_~y 1)) (.cse8 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (.cse6 (not (<= 2 |check_#in~x|))) (.cse0 (<= .cse7 |check_#in~n|)) (.cse1 (= .cse8 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse7 check_~n))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 (not (= |check_#in~y| check_~y0~0)) .cse4 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse3 .cse4 (and .cse0 (= 0 check_~x) (= check_~y0~0 check_~y) .cse1 .cse2 (= check_~x0~0 check_~x) (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|)) (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse6 .cse4) (or .cse3 .cse4 .cse6 (and .cse0 .cse1 .cse2 (<= 2 check_~x)))))) [2020-07-17 13:16:27,597 INFO L264 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse6 (not (<= 2 |check_#in~x|))) (.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|))) (.cse4 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 (not (= |check_#in~y| check_~y0~0)) .cse4 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse6 .cse4) (or .cse3 .cse4 .cse6 (and .cse0 .cse1 .cse2 (<= 2 check_~x))) (or (and .cse0 (= 0 check_~x) (= check_~y0~0 check_~y) .cse1 .cse2 (= check_~x0~0 check_~x) (= 0 |check_#t~mem1|)) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-17 13:16:27,597 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 (+ check_~y 1)) (.cse8 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (.cse6 (not (<= 2 |check_#in~x|))) (.cse0 (<= .cse7 |check_#in~n|)) (.cse1 (= .cse8 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse7 check_~n))) (and (or (and .cse0 (= 0 check_~x) (= check_~y0~0 check_~y) .cse1 .cse2 (= check_~x0~0 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 (not (= |check_#in~y| check_~y0~0)) .cse4 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse6 .cse4) (or .cse3 .cse4 .cse6 (and .cse0 .cse1 .cse2 (<= 2 check_~x)))))) [2020-07-17 13:16:27,598 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (<= 1 |check_#in~x|)) (.cse6 (= .cse4 (select |#memory_int| |check_#in~a.base|))) (.cse5 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse1 (not .cse5)) (.cse2 (not .cse6)) (.cse3 (and .cse0 (= .cse4 (select |#memory_int| check_~a.base)) .cse5 .cse6))) (and (or (not .cse0) .cse1 (not (= |check_#in~y| check_~y0~0)) .cse2 .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or .cse1 .cse2 (not (<= 2 |check_#in~x|)) .cse3))))) [2020-07-17 13:16:27,598 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 ((.cse6 (not (<= 2 |check_#in~x|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.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 (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse6 .cse1) (or .cse0 .cse1 .cse6 (and .cse2 .cse3 .cse4 (<= 2 check_~x))) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1))) (and (= |check_#in~i| check_~i) (< check_~x check_~y) (= |check_#in~y| check_~y) (= check_~a.offset |check_#in~a.offset|) (= |check_#in~x| check_~x) (= check_~a.base |check_#in~a.base|) (= |check_#in~n| check_~n)))))) [2020-07-17 13:16:27,598 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse0 (<= .cse9 |check_#in~n|)) (.cse2 (<= 1 |check_#t~post3|)) (.cse1 (= .cse8 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse9 check_~n)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse8 (select |#memory_int| |check_#in~a.base|)))) (.cse7 (not (<= 2 |check_#in~x|)))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 .cse2 .cse3 (<= 1 check_~x)) .cse4 (not (= |check_#in~y| check_~y0~0)) .cse5 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse7 .cse5) (or (and (= 0 |check_#t~post3|) .cse0 (= |check_#t~post3| check_~x) (= check_~y0~0 check_~y) .cse1 .cse3 (= check_~x0~0 check_~x)) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse2 .cse1 .cse3 (<= 2 check_~x)) .cse4 .cse5 .cse7)))) [2020-07-17 13:16:27,598 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 ((.cse6 (not (<= 2 |check_#in~x|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.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 (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) .cse6 .cse1) (or .cse0 .cse1 .cse6 (and .cse2 .cse3 .cse4 (<= 2 check_~x))) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1))) (and (= |check_#in~i| check_~i) (< check_~x check_~y) (= |check_#in~y| check_~y) (= check_~a.offset |check_#in~a.offset|) (= |check_#in~x| check_~x) (= check_~a.base |check_#in~a.base|) (= |check_#in~n| check_~n)))))) [2020-07-17 13:16:27,598 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse1 (<= .cse9 |check_#in~n|)) (.cse2 (= .cse8 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse9 check_~n))) (let ((.cse5 (and .cse1 .cse2 (<= 1 |check_#t~post3|) .cse3 (<= 2 check_~x))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (<= 2 |check_#in~x|))) (.cse4 (not (= .cse8 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 (and (= 0 |check_#t~post3|) .cse1 (= check_~y0~0 check_~y) (= |check_#t~post3| check_~x0~0) .cse2 .cse3 (= (+ |check_#t~post3| 1) check_~x)) .cse4 (not (= 0 |check_#in~x|))) (or .cse5 .cse0 .cse4 .cse6) (or .cse5 (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse4 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse7 (+ check_~y 2))) (and (<= .cse7 |check_#in~n|) (<= .cse7 check_~n))) .cse6 .cse4))))) [2020-07-17 13:16:27,599 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= 2 |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|)) (let ((.cse2 (+ check_~y 2))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n))) .cse3 .cse1) (or .cse0 .cse1 .cse3 (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (= .cse5 (select |#memory_int| check_~a.base)) (<= .cse4 check_~n) (<= 2 check_~x)))) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,599 INFO L264 CegarLoopResult]: At program point L14(lines 14 36) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (= 0 check_~x) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (= |check_#in~x| check_~x) (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1)))))) [2020-07-17 13:16:27,599 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= 2 |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|)) (let ((.cse2 (+ check_~y 2))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n))) .cse3 .cse1) (or .cse0 .cse1 .cse3 (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (= .cse5 (select |#memory_int| check_~a.base)) (<= .cse4 check_~n) (<= 2 check_~x)))) (or (not (<= 1 |check_#in~x|)) .cse0 (not (= |check_#in~y| check_~y0~0)) .cse1 (not (= |check_#in~x| (+ check_~x0~0 1))))))) [2020-07-17 13:16:27,599 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse0 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (<= 2 |check_#in~x|))) (.cse2 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (<= 2 check_~x)) .cse1 .cse2 .cse3) (or (and (= |check_#in~y| check_~y) (= |check_#in~x| check_~x)) (not (<= 1 |check_#in~x|)) .cse1 (not (= |check_#in~y| check_~y0~0)) .cse2 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (and .cse0 (= 0 check_~x)) .cse1 .cse2 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse3 .cse2 (<= (+ check_~y 2) |check_#in~n|)))) [2020-07-17 13:16:27,599 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse10 ((as const (Array Int Int)) 0)) (.cse11 (+ check_~y 1))) (let ((.cse4 (<= .cse11 |check_#in~n|)) (.cse5 (= .cse10 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse11 check_~n)) (.cse9 (<= 2 check_~x))) (let ((.cse3 (+ check_~x0~0 1)) (.cse8 (<= (+ check_~y 2) check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (= .cse10 (select |#memory_int| |check_#in~a.base|)))) (.cse7 (not (<= 2 |check_#in~x|))) (.cse1 (and .cse4 .cse5 .cse6 .cse9))) (and (or (not (<= 1 |check_#in~x|)) .cse0 .cse1 (not (= |check_#in~y| check_~y0~0)) .cse2 (not (= |check_#in~x| .cse3))) (or (and .cse4 (= check_~y0~0 check_~y) .cse5 (= .cse3 check_~x) (<= 1 check_~x) .cse6) .cse0 .cse2 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse7 .cse2 .cse8) (or (and .cse5 .cse8 .cse9) .cse0 .cse2 .cse7 .cse1))))) [2020-07-17 13:16:27,600 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) 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 (<= 2 |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 (and .cse0 .cse1 (<= 2 check_~x)) .cse2 .cse3 .cse4) (or (and (= |check_#in~y| check_~y) (= check_~a.offset |check_#in~a.offset|) (= |check_#in~x| check_~x) (= check_~a.base |check_#in~a.base|)) (not (<= 1 |check_#in~x|)) .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse3 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-17 13:16:27,600 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) 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 (<= 2 |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 (and .cse0 .cse1 (<= 2 check_~x)) .cse2 .cse3 .cse4) (or (and (= |check_#in~i| check_~i) (= |check_#in~y| check_~y) (= check_~a.offset |check_#in~a.offset|) (= |check_#in~x| check_~x) (= check_~a.base |check_#in~a.base|)) (not (<= 1 |check_#in~x|)) .cse2 (not (= |check_#in~y| check_~y0~0)) .cse3 (not (= |check_#in~x| (+ check_~x0~0 1)))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse3 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-17 13:16:27,600 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-17 13:16:27,600 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (let ((.cse0 (= 0 |__VERIFIER_assert_#in~cond|))) (and (or .cse0 (not (= 0 __VERIFIER_assert_~cond))) (or (not (= |check_#in~i| check_~i)) (not (= check_~a.base |check_#in~a.base|)) .cse0 (not (= check_~a.offset |check_#in~a.offset|)) (not (= |__VERIFIER_assert_#in~cond| (ite (and (<= 0 |check_#in~x|) (< |check_#in~y| |check_#in~n|)) 1 0))) (not (< |check_#in~x| |check_#in~y|)) (not (let ((.cse1 (select |#memory_int| |check_#in~a.base|))) (<= (select .cse1 (+ |check_#in~a.offset| (* check_~x0~0 4))) (select .cse1 (+ |check_#in~a.offset| (* check_~y0~0 4)))))) (not (= |check_#in~y| check_~y0~0)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (= |check_#in~x| (+ check_~x0~0 1)))))) [2020-07-17 13:16:27,601 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (let ((.cse0 (= 0 |__VERIFIER_assert_#in~cond|))) (and (or .cse0 (not (= 0 __VERIFIER_assert_~cond))) (or (not (= |check_#in~i| check_~i)) (not (= check_~a.base |check_#in~a.base|)) .cse0 (not (= check_~a.offset |check_#in~a.offset|)) (not (= |__VERIFIER_assert_#in~cond| (ite (and (<= 0 |check_#in~x|) (< |check_#in~y| |check_#in~n|)) 1 0))) (not (< |check_#in~x| |check_#in~y|)) (not (let ((.cse1 (select |#memory_int| |check_#in~a.base|))) (<= (select .cse1 (+ |check_#in~a.offset| (* check_~x0~0 4))) (select .cse1 (+ |check_#in~a.offset| (* check_~y0~0 4)))))) (not (= |check_#in~y| check_~y0~0)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (= |check_#in~x| (+ check_~x0~0 1)))))) [2020-07-17 13:16:27,601 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-17 13:16:27,601 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (let ((.cse0 (= 0 |__VERIFIER_assert_#in~cond|))) (and (or .cse0 (not (= 0 __VERIFIER_assert_~cond))) (or (not (= |check_#in~i| check_~i)) (not (= check_~a.base |check_#in~a.base|)) .cse0 (not (= check_~a.offset |check_#in~a.offset|)) (not (= |__VERIFIER_assert_#in~cond| (ite (and (<= 0 |check_#in~x|) (< |check_#in~y| |check_#in~n|)) 1 0))) (not (< |check_#in~x| |check_#in~y|)) (not (let ((.cse1 (select |#memory_int| |check_#in~a.base|))) (<= (select .cse1 (+ |check_#in~a.offset| (* check_~x0~0 4))) (select .cse1 (+ |check_#in~a.offset| (* check_~y0~0 4)))))) (not (= |check_#in~y| check_~y0~0)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (= |check_#in~x| (+ check_~x0~0 1)))))) [2020-07-17 13:16:27,601 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-17 13:16:27,602 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-17 13:16:27,602 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-17 13:16:27,602 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-17 13:16:27,621 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 13:16:27,622 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 13:16:27,627 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-17 13:16:27,633 INFO L168 Benchmark]: Toolchain (without parser) took 32957.59 ms. Allocated memory was 138.4 MB in the beginning and 420.0 MB in the end (delta: 281.5 MB). Free memory was 103.5 MB in the beginning and 253.1 MB in the end (delta: -149.7 MB). Peak memory consumption was 290.6 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:27,634 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 13:16:27,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.11 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:27,635 INFO L168 Benchmark]: Boogie Preprocessor took 124.82 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.4 MB in the beginning and 180.4 MB in the end (delta: -87.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:27,636 INFO L168 Benchmark]: RCFGBuilder took 424.59 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 158.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:27,637 INFO L168 Benchmark]: TraceAbstraction took 32110.43 ms. Allocated memory was 202.9 MB in the beginning and 420.0 MB in the end (delta: 217.1 MB). Free memory was 157.6 MB in the beginning and 253.1 MB in the end (delta: -95.5 MB). Peak memory consumption was 280.3 MB. Max. memory is 7.1 GB. [2020-07-17 13:16:27,640 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.11 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.82 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.4 MB in the beginning and 180.4 MB in the end (delta: -87.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.59 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 158.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32110.43 ms. Allocated memory was 202.9 MB in the beginning and 420.0 MB in the end (delta: 217.1 MB). Free memory was 157.6 MB in the beginning and 253.1 MB in the end (delta: -95.5 MB). Peak memory consumption was 280.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert [2020-07-17 13:16:27,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 13:16:27,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 13:16:27,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 13:16:27,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure __VERIFIER_assert: (0 == \old(cond) || !(0 == cond)) && (((((((((!(\old(i) == i) || !(a == a)) || 0 == \old(cond)) || !(a == a)) || !(\old(cond) == (if 0 <= \old(x) && \old(y) < \old(n) then 1 else 0))) || !(\old(x) < \old(y))) || !(unknown-#memory_int-unknown[a][a + x0 * 4] <= unknown-#memory_int-unknown[a][a + y0 * 4])) || !(\old(y) == y0)) || \old(cond) == cond) || !(\old(x) == x0 + 1)) - 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...