/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 22:12:21,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:12:21,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:12:21,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:12:21,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:12:21,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:12:21,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:12:21,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:12:21,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:12:21,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:12:21,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:12:21,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:12:21,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:12:21,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:12:21,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:12:21,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:12:21,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:12:21,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:12:21,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:12:21,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:12:21,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:12:21,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:12:21,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:12:21,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:12:21,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:12:21,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:12:21,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:12:21,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:12:21,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:12:21,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:12:21,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:12:21,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:12:21,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:12:21,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:12:21,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:12:21,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:12:21,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:12:21,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:12:21,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:12:21,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:12:21,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:12:21,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 22:12:21,662 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:12:21,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:12:21,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:12:21,664 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:12:21,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:12:21,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:12:21,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:12:21,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:12:21,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:12:21,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:12:21,667 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:12:21,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:12:21,667 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:12:21,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:12:21,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:12:21,668 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:12:21,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:12:21,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:12:21,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:12:21,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:12:21,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:12:21,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:12:21,669 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 22:12:21,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:12:22,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:12:22,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:12:22,012 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:12:22,013 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:12:22,014 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-08-22 22:12:22,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01264ec60/2d9286786c664950acb4218872a2ccda/FLAG90b7385b5 [2020-08-22 22:12:22,591 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:12:22,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-08-22 22:12:22,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01264ec60/2d9286786c664950acb4218872a2ccda/FLAG90b7385b5 [2020-08-22 22:12:22,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01264ec60/2d9286786c664950acb4218872a2ccda [2020-08-22 22:12:22,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:12:22,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:12:22,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:12:22,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:12:22,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:12:22,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:12:22" (1/1) ... [2020-08-22 22:12:22,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e925358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:22, skipping insertion in model container [2020-08-22 22:12:22,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:12:22" (1/1) ... [2020-08-22 22:12:22,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:12:22,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:12:23,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:12:23,180 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:12:23,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:12:23,221 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:12:23,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23 WrapperNode [2020-08-22 22:12:23,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:12:23,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:12:23,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:12:23,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:12:23,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (1/1) ... [2020-08-22 22:12:23,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (1/1) ... [2020-08-22 22:12:23,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (1/1) ... [2020-08-22 22:12:23,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (1/1) ... [2020-08-22 22:12:23,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (1/1) ... [2020-08-22 22:12:23,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (1/1) ... [2020-08-22 22:12:23,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (1/1) ... [2020-08-22 22:12:23,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:12:23,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:12:23,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:12:23,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:12:23,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (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-08-22 22:12:23,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:12:23,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:12:23,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 22:12:23,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-08-22 22:12:23,425 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-08-22 22:12:23,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:12:23,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-08-22 22:12:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-08-22 22:12:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-08-22 22:12:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:12:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 22:12:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 22:12:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-08-22 22:12:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:12:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-08-22 22:12:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-08-22 22:12:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:12:23,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-08-22 22:12:23,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-08-22 22:12:23,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-08-22 22:12:23,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:12:23,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:12:23,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-08-22 22:12:23,833 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:12:23,834 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 22:12:23,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:12:23 BoogieIcfgContainer [2020-08-22 22:12:23,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:12:23,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:12:23,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:12:23,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:12:23,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:12:22" (1/3) ... [2020-08-22 22:12:23,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ffa4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:12:23, skipping insertion in model container [2020-08-22 22:12:23,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:12:23" (2/3) ... [2020-08-22 22:12:23,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ffa4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:12:23, skipping insertion in model container [2020-08-22 22:12:23,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:12:23" (3/3) ... [2020-08-22 22:12:23,848 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-08-22 22:12:23,860 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:12:23,866 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:12:23,879 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:12:23,901 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:12:23,901 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:12:23,902 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:12:23,902 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:12:23,902 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:12:23,902 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:12:23,902 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:12:23,902 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:12:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-08-22 22:12:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 22:12:23,932 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:23,933 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-08-22 22:12:23,933 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-08-22 22:12:23,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:23,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [158447576] [2020-08-22 22:12:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:24,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:24,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:24,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:24,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 22:12:24,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [158447576] [2020-08-22 22:12:24,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:12:24,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 22:12:24,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743997260] [2020-08-22 22:12:24,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 22:12:24,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:24,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 22:12:24,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-08-22 22:12:24,419 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-08-22 22:12:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:25,397 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-08-22 22:12:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 22:12:25,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-08-22 22:12:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:25,415 INFO L225 Difference]: With dead ends: 221 [2020-08-22 22:12:25,415 INFO L226 Difference]: Without dead ends: 138 [2020-08-22 22:12:25,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 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-08-22 22:12:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-08-22 22:12:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-08-22 22:12:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-08-22 22:12:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-08-22 22:12:25,509 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-08-22 22:12:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:25,510 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-08-22 22:12:25,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 22:12:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-08-22 22:12:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 22:12:25,514 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:25,514 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-08-22 22:12:25,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:12:25,515 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-08-22 22:12:25,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:25,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845378307] [2020-08-22 22:12:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:25,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:25,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:25,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:25,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:25,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 22:12:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 22:12:25,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845378307] [2020-08-22 22:12:25,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:12:25,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 22:12:25,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987956268] [2020-08-22 22:12:25,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 22:12:25,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:25,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 22:12:25,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-08-22 22:12:25,779 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-08-22 22:12:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:26,673 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-08-22 22:12:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 22:12:26,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-08-22 22:12:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:26,678 INFO L225 Difference]: With dead ends: 128 [2020-08-22 22:12:26,678 INFO L226 Difference]: Without dead ends: 108 [2020-08-22 22:12:26,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 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-08-22 22:12:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-08-22 22:12:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-08-22 22:12:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-08-22 22:12:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-08-22 22:12:26,722 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-08-22 22:12:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:26,722 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-08-22 22:12:26,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 22:12:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-08-22 22:12:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-22 22:12:26,730 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:26,732 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-08-22 22:12:26,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:12:26,736 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-08-22 22:12:26,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:26,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [742430238] [2020-08-22 22:12:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:27,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:27,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:27,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:27,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:27,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:27,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 22:12:27,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [742430238] [2020-08-22 22:12:27,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:12:27,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 22:12:27,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461175851] [2020-08-22 22:12:27,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 22:12:27,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:27,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 22:12:27,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-08-22 22:12:27,074 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-08-22 22:12:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:28,555 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-08-22 22:12:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 22:12:28,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-08-22 22:12:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:28,559 INFO L225 Difference]: With dead ends: 179 [2020-08-22 22:12:28,559 INFO L226 Difference]: Without dead ends: 177 [2020-08-22 22:12:28,560 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 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-08-22 22:12:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-08-22 22:12:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-08-22 22:12:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-08-22 22:12:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-08-22 22:12:28,589 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-08-22 22:12:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:28,590 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-08-22 22:12:28,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 22:12:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-08-22 22:12:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-22 22:12:28,592 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:28,592 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-08-22 22:12:28,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:12:28,593 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-08-22 22:12:28,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:28,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270793186] [2020-08-22 22:12:28,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:28,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:28,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:28,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:28,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:28,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:28,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 22:12:28,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270793186] [2020-08-22 22:12:28,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:12:28,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-08-22 22:12:28,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969522742] [2020-08-22 22:12:28,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 22:12:28,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 22:12:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-08-22 22:12:28,874 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-08-22 22:12:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:30,286 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-08-22 22:12:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-22 22:12:30,287 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-08-22 22:12:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:30,291 INFO L225 Difference]: With dead ends: 221 [2020-08-22 22:12:30,291 INFO L226 Difference]: Without dead ends: 219 [2020-08-22 22:12:30,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 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-08-22 22:12:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-22 22:12:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-08-22 22:12:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-08-22 22:12:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-08-22 22:12:30,365 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-08-22 22:12:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:30,367 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-08-22 22:12:30,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 22:12:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-08-22 22:12:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-22 22:12:30,379 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:30,379 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-08-22 22:12:30,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:12:30,380 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-08-22 22:12:30,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:30,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089901640] [2020-08-22 22:12:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 22:12:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 22:12:30,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089901640] [2020-08-22 22:12:30,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:12:30,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 22:12:30,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053705505] [2020-08-22 22:12:30,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 22:12:30,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 22:12:30,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-08-22 22:12:30,749 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-08-22 22:12:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:31,549 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-08-22 22:12:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 22:12:31,550 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-08-22 22:12:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:31,552 INFO L225 Difference]: With dead ends: 206 [2020-08-22 22:12:31,552 INFO L226 Difference]: Without dead ends: 142 [2020-08-22 22:12:31,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 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-08-22 22:12:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-08-22 22:12:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-08-22 22:12:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-08-22 22:12:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-08-22 22:12:31,570 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-08-22 22:12:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:31,571 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-08-22 22:12:31,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 22:12:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-08-22 22:12:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-22 22:12:31,573 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:31,573 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-08-22 22:12:31,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:12:31,573 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-08-22 22:12:31,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:31,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1298100378] [2020-08-22 22:12:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 22:12:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 22:12:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-08-22 22:12:31,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1298100378] [2020-08-22 22:12:31,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:12:31,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-22 22:12:31,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421842475] [2020-08-22 22:12:31,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-22 22:12:31,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:31,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-22 22:12:31,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-08-22 22:12:31,993 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-08-22 22:12:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:33,671 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-08-22 22:12:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 22:12:33,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-08-22 22:12:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:33,674 INFO L225 Difference]: With dead ends: 168 [2020-08-22 22:12:33,676 INFO L226 Difference]: Without dead ends: 166 [2020-08-22 22:12:33,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-08-22 22:12:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-08-22 22:12:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-08-22 22:12:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-08-22 22:12:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-08-22 22:12:33,703 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-08-22 22:12:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:33,705 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-08-22 22:12:33,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-22 22:12:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-08-22 22:12:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-22 22:12:33,706 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:33,707 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-08-22 22:12:33,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:12:33,707 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-08-22 22:12:33,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:33,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1941706126] [2020-08-22 22:12:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 22:12:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 22:12:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-08-22 22:12:34,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1941706126] [2020-08-22 22:12:34,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:12:34,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-22 22:12:34,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040333627] [2020-08-22 22:12:34,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-22 22:12:34,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:34,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-22 22:12:34,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-08-22 22:12:34,177 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-08-22 22:12:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:35,920 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-08-22 22:12:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-22 22:12:35,920 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-08-22 22:12:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:35,924 INFO L225 Difference]: With dead ends: 191 [2020-08-22 22:12:35,924 INFO L226 Difference]: Without dead ends: 189 [2020-08-22 22:12:35,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 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-08-22 22:12:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-08-22 22:12:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-08-22 22:12:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-08-22 22:12:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-08-22 22:12:35,947 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-08-22 22:12:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:35,947 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-08-22 22:12:35,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-22 22:12:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-08-22 22:12:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-22 22:12:35,949 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:35,949 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-08-22 22:12:35,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:12:35,949 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-08-22 22:12:35,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:35,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346905174] [2020-08-22 22:12:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 22:12:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 22:12:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-08-22 22:12:36,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346905174] [2020-08-22 22:12:36,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:12:36,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-22 22:12:36,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544239906] [2020-08-22 22:12:36,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-22 22:12:36,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-22 22:12:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-08-22 22:12:36,325 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-08-22 22:12:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:38,127 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-08-22 22:12:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-22 22:12:38,128 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-08-22 22:12:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:38,130 INFO L225 Difference]: With dead ends: 208 [2020-08-22 22:12:38,130 INFO L226 Difference]: Without dead ends: 206 [2020-08-22 22:12:38,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-08-22 22:12:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-08-22 22:12:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-08-22 22:12:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-08-22 22:12:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-08-22 22:12:38,156 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-08-22 22:12:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:38,156 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-08-22 22:12:38,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-22 22:12:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-08-22 22:12:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-22 22:12:38,158 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:38,158 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-08-22 22:12:38,158 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:12:38,159 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:38,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:38,159 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-08-22 22:12:38,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:38,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183144879] [2020-08-22 22:12:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 22:12:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 22:12:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 22:12:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 22:12:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-08-22 22:12:38,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183144879] [2020-08-22 22:12:38,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:12:38,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-08-22 22:12:38,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197160369] [2020-08-22 22:12:38,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-08-22 22:12:38,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:38,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-08-22 22:12:38,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-08-22 22:12:38,724 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-08-22 22:12:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:41,352 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-08-22 22:12:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 22:12:41,352 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-08-22 22:12:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:41,355 INFO L225 Difference]: With dead ends: 237 [2020-08-22 22:12:41,355 INFO L226 Difference]: Without dead ends: 171 [2020-08-22 22:12:41,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 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-08-22 22:12:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-08-22 22:12:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-08-22 22:12:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-08-22 22:12:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-08-22 22:12:41,377 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-08-22 22:12:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:41,378 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-08-22 22:12:41,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-08-22 22:12:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-08-22 22:12:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-22 22:12:41,379 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:12:41,380 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-08-22 22:12:41,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:12:41,380 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:12:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:12:41,381 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-08-22 22:12:41,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:12:41,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1336025017] [2020-08-22 22:12:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:12:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:12:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 22:12:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 22:12:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 22:12:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 22:12:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 22:12:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 22:12:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 22:12:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 22:12:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 22:12:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:12:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-08-22 22:12:41,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1336025017] [2020-08-22 22:12:41,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 22:12:41,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 22:12:41,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713074374] [2020-08-22 22:12:41,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 22:12:41,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:12:41,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 22:12:41,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-08-22 22:12:41,562 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 11 states. [2020-08-22 22:12:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:12:41,981 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-08-22 22:12:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 22:12:41,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-08-22 22:12:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:12:41,983 INFO L225 Difference]: With dead ends: 163 [2020-08-22 22:12:41,983 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 22:12:41,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-08-22 22:12:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 22:12:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 22:12:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 22:12:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 22:12:41,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-08-22 22:12:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:12:41,985 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 22:12:41,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 22:12:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 22:12:41,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 22:12:41,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:12:41,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 22:12:43,906 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-08-22 22:12:44,120 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-08-22 22:12:44,477 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-08-22 22:12:44,660 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-08-22 22:12:44,789 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 22:12:45,009 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-08-22 22:12:45,184 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 22:12:45,437 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 22:12:45,754 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-08-22 22:12:46,071 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-08-22 22:12:46,400 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-08-22 22:12:46,517 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 22:12:46,849 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-08-22 22:12:47,056 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2020-08-22 22:12:47,348 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-08-22 22:12:47,652 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-08-22 22:12:47,930 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-08-22 22:12:48,133 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-08-22 22:12:48,363 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-08-22 22:12:48,557 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-08-22 22:12:48,844 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 22:12:49,105 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 22:12:49,278 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-08-22 22:12:49,660 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 22:12:49,852 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-08-22 22:12:50,176 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 22:12:50,465 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 22:12:50,660 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 22:12:50,922 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2020-08-22 22:12:50,939 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,939 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,939 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,940 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,940 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,940 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,940 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,940 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,940 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:12:50,941 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-08-22 22:12:50,941 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 22:12:50,941 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 22:12:50,941 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-08-22 22:12:50,941 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-08-22 22:12:50,942 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-08-22 22:12:50,942 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-08-22 22:12:50,942 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (<= main_~ai~1 main_~ax~1) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,942 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-08-22 22:12:50,942 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,942 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0) (= |main_#t~mem12| 0))) [2020-08-22 22:12:50,943 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-08-22 22:12:50,943 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-08-22 22:12:50,943 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0) (= |main_#t~mem12| 0))) [2020-08-22 22:12:50,943 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= (select |#memory_int| |main_#t~malloc10.base|) ((as const (Array Int Int)) 0)) [2020-08-22 22:12:50,943 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,943 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,943 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,943 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,944 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) (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,944 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,944 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) (= (select |#memory_int| main_~a~0.base) .cse0) (<= main_~ai~1 main_~ax~1) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,944 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,944 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,944 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,944 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,944 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 22:12:50,945 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,945 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,945 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,945 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 22:12:50,945 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2020-08-22 22:12:50,946 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2020-08-22 22:12:50,946 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-08-22 22:12:50,946 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,946 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= |check_#t~mem6| 0)) (.cse1 (= (select |#memory_int| check_~a.base) .cse5)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (and .cse0 .cse1) .cse2 (not (<= 1 |check_#in~x|)) .cse3) (or .cse2 (and .cse0 (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1) (not (= |check_#in~x| 0)) .cse3)))) [2020-08-22 22:12:50,946 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse2 (= |check_#t~mem6| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4 .cse5)) (or (and .cse2 .cse4 .cse5) .cse0 (not (<= 1 |check_#in~x|)) .cse1)))) [2020-08-22 22:12:50,946 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,947 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,947 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 22:12:50,947 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,947 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 22:12:50,947 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 22:12:50,947 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 ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,948 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,948 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2020-08-22 22:12:50,948 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-08-22 22:12:50,948 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2020-08-22 22:12:50,948 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= |check_#t~mem7| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and .cse1 (or (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4) (not (= |check_#in~x| 0)) .cse5) (or (and .cse1 .cse3 .cse4) .cse0 (not (<= 1 |check_#in~x|)) .cse5)))) [2020-08-22 22:12:50,949 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (= check_~ax~0 0)) (.cse2 (= |check_#t~mem7| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse6 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (and .cse1 .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4 .cse5) (not (= |check_#in~x| 0)) .cse6) (or .cse0 (and .cse1 .cse2 .cse4 .cse5) (not (<= 1 |check_#in~x|)) .cse6)))) [2020-08-22 22:12:50,949 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,949 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse6 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse9 |check_#in~n|)) (.cse3 (<= .cse9 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse8)) (.cse5 (= |check_#t~mem1| 0)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x))) (or .cse0 .cse1 .cse6 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse7 (+ check_~y 2))) (and (<= .cse7 check_~n) (<= .cse7 |check_#in~n|))) .cse6) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,949 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,950 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse10 (+ check_~y 1)) (.cse9 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (<= .cse10 |check_#in~n|)) (.cse4 (<= .cse10 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse9)) (.cse6 (= |check_#t~mem2| 0)) (.cse7 (= |check_#t~mem1| 0))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse8 (+ check_~y 2))) (and (<= .cse8 check_~n) (<= .cse8 |check_#in~n|))) .cse2) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 check_~x)))))) [2020-08-22 22:12:50,950 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse3 .cse4 .cse5 (= |check_#t~mem2| 0) (= |check_#t~mem1| 0) (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2)))) [2020-08-22 22:12:50,950 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 ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,950 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,950 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-08-22 22:12:50,951 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,951 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|))) .cse2) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse4 (<= 1 |check_#t~post3|) .cse5 .cse6 (<= 1 check_~x)) .cse1) (or (and (= |check_#t~post3| 0) .cse4 .cse5 .cse6 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,951 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 22:12:50,951 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse1 (<= .cse7 |check_#in~n|)) (.cse2 (<= .cse7 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and (= |check_#t~post3| 0) .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|))) (not (<= 2 |check_#in~x|))) (or (and .cse1 (<= 1 |check_#t~post3|) .cse2 .cse3 (<= 2 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse4)))) [2020-08-22 22:12:50,951 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 22:12:50,952 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 (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2020-08-22 22:12:50,952 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 22:12:50,952 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (<= (+ check_~y 2) |check_#in~n|) .cse2) (or .cse0 (and .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2020-08-22 22:12:50,952 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (<= (+ check_~y 2) check_~n) (not (<= 2 |check_#in~x|))) (or .cse1 (and .cse2 .cse3 .cse4 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse0) (or .cse1 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse0)))) [2020-08-22 22:12:50,952 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or (and .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-08-22 22:12:50,953 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or (and .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-08-22 22:12:50,953 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-08-22 22:12:50,953 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 22:12:50,953 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 22:12:50,953 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 22:12:50,953 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 22:12:50,953 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 22:12:50,953 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-08-22 22:12:50,953 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-08-22 22:12:50,954 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-08-22 22:12:50,975 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-08-22 22:12:50,979 INFO L168 Benchmark]: Toolchain (without parser) took 28047.67 ms. Allocated memory was 137.9 MB in the beginning and 447.7 MB in the end (delta: 309.9 MB). Free memory was 102.4 MB in the beginning and 299.7 MB in the end (delta: -197.3 MB). Peak memory consumption was 314.2 MB. Max. memory is 7.1 GB. [2020-08-22 22:12:50,980 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 137.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 22:12:50,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.81 ms. Allocated memory is still 137.9 MB. Free memory was 102.0 MB in the beginning and 91.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-08-22 22:12:50,982 INFO L168 Benchmark]: Boogie Preprocessor took 131.60 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 178.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-08-22 22:12:50,983 INFO L168 Benchmark]: RCFGBuilder took 485.37 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 156.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2020-08-22 22:12:50,986 INFO L168 Benchmark]: TraceAbstraction took 27136.94 ms. Allocated memory was 201.3 MB in the beginning and 447.7 MB in the end (delta: 246.4 MB). Free memory was 155.8 MB in the beginning and 299.7 MB in the end (delta: -144.0 MB). Peak memory consumption was 304.1 MB. Max. memory is 7.1 GB. [2020-08-22 22:12:50,994 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.29 ms. Allocated memory is still 137.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.81 ms. Allocated memory is still 137.9 MB. Free memory was 102.0 MB in the beginning and 91.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.60 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 178.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 485.37 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 156.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27136.94 ms. Allocated memory was 201.3 MB in the beginning and 447.7 MB in the end (delta: 246.4 MB). Free memory was 155.8 MB in the beginning and 299.7 MB in the end (delta: -144.0 MB). Peak memory consumption was 304.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...