/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/recursive-simple/id_i20_o20-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:07:17,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:07:17,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:07:17,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:07:17,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:07:17,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:07:17,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:07:17,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:07:17,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:07:17,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:07:17,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:07:17,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:07:17,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:07:17,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:07:17,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:07:17,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:07:17,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:07:17,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:07:17,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:07:17,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:07:17,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:07:17,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:07:17,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:07:17,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:07:17,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:07:17,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:07:17,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:07:17,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:07:17,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:07:17,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:07:17,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:07:17,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:07:17,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:07:17,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:07:17,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:07:17,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:07:17,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:07:17,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:07:17,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:07:17,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:07:17,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:07:17,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:07:17,754 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:07:17,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:07:17,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:07:17,756 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:07:17,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:07:17,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:07:17,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:07:17,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:07:17,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:07:17,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:07:17,757 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:07:17,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:07:17,758 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:07:17,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:07:17,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:07:17,759 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:07:17,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:07:17,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:07:17,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:17,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:07:17,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:07:17,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:07:17,760 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-11-07 05:07:18,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:07:18,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:07:18,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:07:18,164 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:07:18,164 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:07:18,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-11-07 05:07:18,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10526595d/ad10ee7fb9a24fa2bc7154994a7271c2/FLAG6ce8b3ca4 [2020-11-07 05:07:18,926 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:07:18,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i20_o20-1.c [2020-11-07 05:07:18,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10526595d/ad10ee7fb9a24fa2bc7154994a7271c2/FLAG6ce8b3ca4 [2020-11-07 05:07:19,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10526595d/ad10ee7fb9a24fa2bc7154994a7271c2 [2020-11-07 05:07:19,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:07:19,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:07:19,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:19,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:07:19,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:07:19,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae72c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19, skipping insertion in model container [2020-11-07 05:07:19,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:07:19,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:07:19,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:19,537 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:07:19,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:19,574 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:07:19,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19 WrapperNode [2020-11-07 05:07:19,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:19,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:07:19,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:07:19,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:07:19,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (1/1) ... [2020-11-07 05:07:19,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:07:19,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:07:19,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:07:19,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:07:19,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (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-11-07 05:07:19,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:07:19,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:07:19,739 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:07:19,739 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:07:19,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:07:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:07:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:07:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:07:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:07:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:07:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:07:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:07:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:07:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:07:19,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:07:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:07:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:07:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:07:19,993 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:07:19,994 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:07:19,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:19 BoogieIcfgContainer [2020-11-07 05:07:19,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:07:19,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:07:19,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:07:20,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:07:20,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:07:19" (1/3) ... [2020-11-07 05:07:20,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c744a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:20, skipping insertion in model container [2020-11-07 05:07:20,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:19" (2/3) ... [2020-11-07 05:07:20,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c744a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:20, skipping insertion in model container [2020-11-07 05:07:20,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:19" (3/3) ... [2020-11-07 05:07:20,006 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-1.c [2020-11-07 05:07:20,026 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:07:20,030 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:07:20,049 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:07:20,085 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:07:20,086 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:07:20,086 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:07:20,086 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:07:20,086 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:07:20,086 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:07:20,087 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:07:20,087 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:07:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 05:07:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:07:20,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:20,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:20,157 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 05:07:20,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:20,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [665304021] [2020-11-07 05:07:20,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:07:20,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [665304021] [2020-11-07 05:07:20,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:07:20,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:07:20,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629240594] [2020-11-07 05:07:20,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:07:20,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:07:20,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:07:20,709 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 05:07:20,931 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-07 05:07:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:21,149 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-11-07 05:07:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:07:21,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:07:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:21,164 INFO L225 Difference]: With dead ends: 50 [2020-11-07 05:07:21,164 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 05:07:21,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 05:07:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 05:07:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 05:07:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 05:07:21,230 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 05:07:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:21,230 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 05:07:21,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:07:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 05:07:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 05:07:21,234 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:21,234 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:07:21,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:07:21,235 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 05:07:21,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:21,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [739576800] [2020-11-07 05:07:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:07:21,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [739576800] [2020-11-07 05:07:21,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:21,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:07:21,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522065937] [2020-11-07 05:07:21,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:07:21,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:07:21,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:07:21,417 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 05:07:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:21,719 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 05:07:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:21,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 05:07:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:21,722 INFO L225 Difference]: With dead ends: 44 [2020-11-07 05:07:21,722 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:07:21,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:07:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:07:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:07:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 05:07:21,740 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 05:07:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:21,741 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 05:07:21,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:07:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 05:07:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 05:07:21,743 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:21,743 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:07:21,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:07:21,744 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 05:07:21,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:21,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890171603] [2020-11-07 05:07:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:07:21,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1890171603] [2020-11-07 05:07:21,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:21,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:07:21,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10857276] [2020-11-07 05:07:21,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:07:21,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:07:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:07:21,960 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 05:07:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:22,250 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 05:07:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:07:22,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 05:07:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:22,253 INFO L225 Difference]: With dead ends: 49 [2020-11-07 05:07:22,253 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 05:07:22,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 05:07:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 05:07:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 05:07:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 05:07:22,268 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 05:07:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:22,268 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 05:07:22,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:07:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 05:07:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 05:07:22,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:22,271 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:22,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:07:22,271 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 05:07:22,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:22,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545734354] [2020-11-07 05:07:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:07:22,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545734354] [2020-11-07 05:07:22,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:22,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:07:22,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590255375] [2020-11-07 05:07:22,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:07:22,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:07:22,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:22,548 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 05:07:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:22,858 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 05:07:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:07:22,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 05:07:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:22,860 INFO L225 Difference]: With dead ends: 54 [2020-11-07 05:07:22,860 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 05:07:22,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 05:07:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 05:07:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 05:07:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 05:07:22,874 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 05:07:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:22,875 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 05:07:22,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:07:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 05:07:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:07:22,877 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:22,877 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:22,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:07:22,878 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 05:07:22,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:22,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952792201] [2020-11-07 05:07:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:22,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:07:23,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952792201] [2020-11-07 05:07:23,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:23,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:07:23,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378345118] [2020-11-07 05:07:23,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:07:23,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:23,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:07:23,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:23,098 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 05:07:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:23,509 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 05:07:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:07:23,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 05:07:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:23,511 INFO L225 Difference]: With dead ends: 59 [2020-11-07 05:07:23,511 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 05:07:23,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 05:07:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 05:07:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 05:07:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 05:07:23,526 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 05:07:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:23,526 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 05:07:23,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:07:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 05:07:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:07:23,528 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:23,528 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:23,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:07:23,529 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 05:07:23,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:23,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201091296] [2020-11-07 05:07:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 05:07:23,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201091296] [2020-11-07 05:07:23,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:23,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:07:23,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509429409] [2020-11-07 05:07:23,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:07:23,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:07:23,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:23,734 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 05:07:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:24,255 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 05:07:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:07:24,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 05:07:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:24,259 INFO L225 Difference]: With dead ends: 64 [2020-11-07 05:07:24,259 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 05:07:24,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 05:07:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 05:07:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 05:07:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 05:07:24,275 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 05:07:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:24,276 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 05:07:24,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:07:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 05:07:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:07:24,278 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:24,278 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:24,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:07:24,278 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:24,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:24,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 05:07:24,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:24,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1929328770] [2020-11-07 05:07:24,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 05:07:24,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1929328770] [2020-11-07 05:07:24,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:24,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:07:24,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527066298] [2020-11-07 05:07:24,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:07:24,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:24,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:07:24,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:07:24,550 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 05:07:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:25,083 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 05:07:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:07:25,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 05:07:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:25,085 INFO L225 Difference]: With dead ends: 69 [2020-11-07 05:07:25,085 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 05:07:25,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 05:07:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 05:07:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 05:07:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 05:07:25,102 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 05:07:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:25,103 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 05:07:25,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:07:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 05:07:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:07:25,105 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:25,105 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:25,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:07:25,105 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 05:07:25,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:25,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [667695367] [2020-11-07 05:07:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 05:07:25,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [667695367] [2020-11-07 05:07:25,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:25,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:07:25,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33030931] [2020-11-07 05:07:25,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:07:25,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:25,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:07:25,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:25,442 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 05:07:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:26,113 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 05:07:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:07:26,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 05:07:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:26,116 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:07:26,116 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:07:26,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:07:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 05:07:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:07:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:07:26,137 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 05:07:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:26,137 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:07:26,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:07:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:07:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 05:07:26,139 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:26,139 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:26,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:07:26,140 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:26,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 05:07:26,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:26,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [645252014] [2020-11-07 05:07:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 05:07:26,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [645252014] [2020-11-07 05:07:26,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:26,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:07:26,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134797508] [2020-11-07 05:07:26,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:07:26,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:07:26,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:07:26,514 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 05:07:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:27,212 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 05:07:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:07:27,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 05:07:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:27,214 INFO L225 Difference]: With dead ends: 79 [2020-11-07 05:07:27,215 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 05:07:27,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 05:07:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 05:07:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 05:07:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 05:07:27,234 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 05:07:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:27,234 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 05:07:27,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:07:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 05:07:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:07:27,236 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:27,236 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:27,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:07:27,237 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 05:07:27,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:27,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961345949] [2020-11-07 05:07:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 05:07:27,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961345949] [2020-11-07 05:07:27,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:27,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:07:27,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449404865] [2020-11-07 05:07:27,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:07:27,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:27,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:07:27,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:27,639 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 05:07:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:28,386 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 05:07:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:07:28,386 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 05:07:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:28,388 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:07:28,389 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:07:28,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:07:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:07:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 05:07:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:07:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 05:07:28,420 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 05:07:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:28,422 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 05:07:28,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:07:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 05:07:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 05:07:28,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:28,428 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:28,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:07:28,429 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 05:07:28,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:28,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [175224971] [2020-11-07 05:07:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 05:07:28,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [175224971] [2020-11-07 05:07:28,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:28,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:07:28,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357114876] [2020-11-07 05:07:28,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:07:28,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:28,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:07:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:07:28,929 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-11-07 05:07:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:29,748 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 05:07:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:07:29,749 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-07 05:07:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:29,750 INFO L225 Difference]: With dead ends: 89 [2020-11-07 05:07:29,751 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 05:07:29,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:07:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 05:07:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 05:07:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 05:07:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 05:07:29,766 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 05:07:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:29,767 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 05:07:29,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:07:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 05:07:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 05:07:29,768 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:29,768 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:29,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:07:29,769 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 05:07:29,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:29,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478034334] [2020-11-07 05:07:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:29,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:29,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:29,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:29,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:29,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 05:07:30,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478034334] [2020-11-07 05:07:30,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:30,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:07:30,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591063099] [2020-11-07 05:07:30,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:07:30,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:30,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:07:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:30,399 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 05:07:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:31,294 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-11-07 05:07:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:07:31,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 05:07:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:31,295 INFO L225 Difference]: With dead ends: 94 [2020-11-07 05:07:31,295 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:07:31,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 05:07:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:07:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-07 05:07:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 05:07:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-11-07 05:07:31,312 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-11-07 05:07:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:31,313 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-11-07 05:07:31,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:07:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-11-07 05:07:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 05:07:31,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:31,315 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:31,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:07:31,315 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-11-07 05:07:31,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:31,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308461664] [2020-11-07 05:07:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-11-07 05:07:32,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308461664] [2020-11-07 05:07:32,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:32,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:07:32,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023647613] [2020-11-07 05:07:32,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:07:32,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:07:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:07:32,059 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-11-07 05:07:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:32,903 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-11-07 05:07:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:07:32,904 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-11-07 05:07:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:32,906 INFO L225 Difference]: With dead ends: 99 [2020-11-07 05:07:32,906 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 05:07:32,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:07:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 05:07:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 05:07:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 05:07:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-11-07 05:07:32,940 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-11-07 05:07:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:32,941 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-11-07 05:07:32,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:07:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-11-07 05:07:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 05:07:32,945 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:32,945 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:32,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:07:32,946 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-11-07 05:07:32,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:32,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [757655034] [2020-11-07 05:07:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-07 05:07:33,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [757655034] [2020-11-07 05:07:33,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:33,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 05:07:33,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585578785] [2020-11-07 05:07:33,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:07:33,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:07:33,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:33,654 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-11-07 05:07:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:34,706 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 05:07:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:07:34,706 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-11-07 05:07:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:34,708 INFO L225 Difference]: With dead ends: 104 [2020-11-07 05:07:34,708 INFO L226 Difference]: Without dead ends: 97 [2020-11-07 05:07:34,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:07:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-07 05:07:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-11-07 05:07:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 05:07:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-11-07 05:07:34,723 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-11-07 05:07:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:34,724 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-11-07 05:07:34,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:07:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-11-07 05:07:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-07 05:07:34,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:34,726 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:34,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:07:34,726 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-11-07 05:07:34,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:34,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702471601] [2020-11-07 05:07:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-07 05:07:35,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702471601] [2020-11-07 05:07:35,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:35,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:07:35,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705549186] [2020-11-07 05:07:35,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:07:35,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:07:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:07:35,443 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-11-07 05:07:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:36,488 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-11-07 05:07:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:07:36,489 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-11-07 05:07:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:36,491 INFO L225 Difference]: With dead ends: 109 [2020-11-07 05:07:36,492 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 05:07:36,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 05:07:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 05:07:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-07 05:07:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 05:07:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-11-07 05:07:36,508 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-11-07 05:07:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:36,508 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-11-07 05:07:36,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:07:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-11-07 05:07:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 05:07:36,511 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:36,511 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:36,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:07:36,511 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-11-07 05:07:36,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:36,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [996735019] [2020-11-07 05:07:36,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-11-07 05:07:37,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [996735019] [2020-11-07 05:07:37,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:37,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 05:07:37,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031499123] [2020-11-07 05:07:37,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 05:07:37,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 05:07:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:37,338 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-11-07 05:07:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:38,465 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-11-07 05:07:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:07:38,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-11-07 05:07:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:38,471 INFO L225 Difference]: With dead ends: 114 [2020-11-07 05:07:38,471 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 05:07:38,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 05:07:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 05:07:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-07 05:07:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 05:07:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-11-07 05:07:38,491 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-11-07 05:07:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:38,495 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-11-07 05:07:38,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 05:07:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-11-07 05:07:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 05:07:38,497 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:38,497 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:38,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:07:38,497 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-11-07 05:07:38,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:38,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [901184048] [2020-11-07 05:07:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-11-07 05:07:39,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [901184048] [2020-11-07 05:07:39,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:39,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:07:39,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23359734] [2020-11-07 05:07:39,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:07:39,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:39,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:07:39,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:07:39,336 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-11-07 05:07:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:40,552 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-11-07 05:07:40,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:07:40,553 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-11-07 05:07:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:40,555 INFO L225 Difference]: With dead ends: 119 [2020-11-07 05:07:40,555 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 05:07:40,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 05:07:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 05:07:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-07 05:07:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 05:07:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-11-07 05:07:40,573 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-11-07 05:07:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:40,573 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-11-07 05:07:40,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:07:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-11-07 05:07:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-07 05:07:40,576 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:40,576 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:40,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:07:40,576 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:40,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-11-07 05:07:40,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:40,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186924857] [2020-11-07 05:07:40,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-11-07 05:07:41,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [186924857] [2020-11-07 05:07:41,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:41,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:07:41,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333814082] [2020-11-07 05:07:41,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:07:41,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:07:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:41,542 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-11-07 05:07:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:42,773 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-11-07 05:07:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:07:42,775 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-11-07 05:07:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:42,776 INFO L225 Difference]: With dead ends: 124 [2020-11-07 05:07:42,777 INFO L226 Difference]: Without dead ends: 117 [2020-11-07 05:07:42,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 05:07:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-07 05:07:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-11-07 05:07:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-07 05:07:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-11-07 05:07:42,794 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-11-07 05:07:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:42,794 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-11-07 05:07:42,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:07:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-11-07 05:07:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 05:07:42,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:42,797 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:42,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:07:42,797 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-11-07 05:07:42,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:42,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1401344302] [2020-11-07 05:07:42,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-11-07 05:07:43,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1401344302] [2020-11-07 05:07:43,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:43,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:07:43,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415015016] [2020-11-07 05:07:43,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:07:43,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:07:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:07:43,762 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-11-07 05:07:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:45,005 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-11-07 05:07:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 05:07:45,005 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-11-07 05:07:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:45,008 INFO L225 Difference]: With dead ends: 129 [2020-11-07 05:07:45,008 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 05:07:45,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:07:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 05:07:45,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-07 05:07:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 05:07:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-11-07 05:07:45,026 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-11-07 05:07:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:45,027 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-11-07 05:07:45,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:07:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-11-07 05:07:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-07 05:07:45,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:45,029 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:45,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 05:07:45,029 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-11-07 05:07:45,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:45,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1344236315] [2020-11-07 05:07:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-11-07 05:07:46,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1344236315] [2020-11-07 05:07:46,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:46,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 05:07:46,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494639970] [2020-11-07 05:07:46,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 05:07:46,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:46,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 05:07:46,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:46,131 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-11-07 05:07:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:47,592 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-11-07 05:07:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:07:47,592 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-11-07 05:07:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:47,595 INFO L225 Difference]: With dead ends: 134 [2020-11-07 05:07:47,595 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 05:07:47,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 05:07:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 05:07:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-07 05:07:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:07:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-11-07 05:07:47,614 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-11-07 05:07:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:47,615 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-11-07 05:07:47,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 05:07:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-11-07 05:07:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 05:07:47,616 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:47,616 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:47,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 05:07:47,617 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-11-07 05:07:47,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:47,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864281251] [2020-11-07 05:07:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:47,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-11-07 05:07:50,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864281251] [2020-11-07 05:07:50,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:50,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2020-11-07 05:07:50,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110389561] [2020-11-07 05:07:50,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-11-07 05:07:50,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-11-07 05:07:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 05:07:50,429 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 46 states. [2020-11-07 05:07:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:59,091 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-11-07 05:07:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2020-11-07 05:07:59,091 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 185 [2020-11-07 05:07:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:59,096 INFO L225 Difference]: With dead ends: 139 [2020-11-07 05:07:59,096 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 05:07:59,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=408, Invalid=11582, Unknown=0, NotChecked=0, Total=11990 [2020-11-07 05:07:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 05:07:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-07 05:07:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 05:07:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-11-07 05:07:59,126 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-11-07 05:07:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:59,128 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-11-07 05:07:59,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-11-07 05:07:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-11-07 05:07:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-07 05:07:59,131 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:59,131 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:59,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 05:07:59,131 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-11-07 05:07:59,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:59,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001057667] [2020-11-07 05:07:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 1050 proven. 42 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-11-07 05:08:00,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001057667] [2020-11-07 05:08:00,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:00,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-11-07 05:08:00,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278900620] [2020-11-07 05:08:00,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 05:08:00,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 05:08:00,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=441, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:08:00,604 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-11-07 05:08:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:02,588 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2020-11-07 05:08:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 05:08:02,592 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-11-07 05:08:02,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:02,593 INFO L225 Difference]: With dead ends: 132 [2020-11-07 05:08:02,593 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:08:02,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=821, Invalid=1729, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 05:08:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:08:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:08:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:08:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:08:02,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2020-11-07 05:08:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:02,596 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:08:02,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 05:08:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:08:02,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:08:02,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 05:08:02,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:08:02,789 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 102 [2020-11-07 05:08:03,000 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 102 [2020-11-07 05:08:03,213 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2020-11-07 05:08:03,367 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2020-11-07 05:08:03,565 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 102 [2020-11-07 05:08:04,645 WARN L194 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 131 [2020-11-07 05:08:05,757 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 175 DAG size of output: 131 [2020-11-07 05:08:06,843 WARN L194 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 127 [2020-11-07 05:08:07,810 WARN L194 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 127 [2020-11-07 05:08:09,118 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 211 DAG size of output: 168 [2020-11-07 05:08:09,125 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,125 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,125 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,126 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,126 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,126 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,126 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:09,126 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:09,126 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,127 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:08:09,127 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,127 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,127 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:08:09,128 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:08:09,128 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:08:09,128 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:08:09,128 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:08:09,128 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:08:09,128 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 20 main_~input~0) [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= 20 main_~input~0) (<= main_~result~0 20) (<= 20 main_~result~0)) [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~input~0 20) (<= 20 main_~input~0)) [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= 20 main_~input~0) (<= |main_#t~ret8| 20) (<= 20 |main_#t~ret8|)) [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 20 main_~input~0) [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= 20 main_~input~0) (<= |main_#t~ret8| 20) (<= 20 |main_#t~ret8|)) [2020-11-07 05:08:09,129 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= 20 main_~input~0) (<= |main_#t~ret8| 20) (<= 20 |main_#t~ret8|) (<= main_~result~0 20) (<= 20 main_~result~0)) [2020-11-07 05:08:09,130 INFO L262 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)))) [2020-11-07 05:08:09,130 INFO L262 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)))) [2020-11-07 05:08:09,130 INFO L262 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 05:08:09,131 INFO L269 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-11-07 05:08:09,131 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 05:08:09,131 INFO L262 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 12 |id_#in~x|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= |id_#t~ret7| 19) .cse0 (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= 12 |id_#t~ret7|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 21 |id_#in~x|) .cse0))) [2020-11-07 05:08:09,131 INFO L262 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-11-07 05:08:09,132 INFO L262 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 12 |id_#in~x|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= |id_#t~ret7| 19) .cse0 (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= 12 |id_#t~ret7|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 21 |id_#in~x|) .cse0))) [2020-11-07 05:08:09,132 INFO L262 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|) (<= |id_#res| 15)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret7| 19) .cse0 (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret7|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 21 |id_#in~x|) .cse0) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)))) [2020-11-07 05:08:09,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:09 BoogieIcfgContainer [2020-11-07 05:08:09,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:08:09,159 INFO L168 Benchmark]: Toolchain (without parser) took 49849.86 ms. Allocated memory was 151.0 MB in the beginning and 453.0 MB in the end (delta: 302.0 MB). Free memory was 135.7 MB in the beginning and 368.3 MB in the end (delta: -232.7 MB). Peak memory consumption was 274.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:09,160 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 125.1 MB in the end (delta: 141.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:08:09,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.38 ms. Allocated memory is still 151.0 MB. Free memory was 135.2 MB in the beginning and 126.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:09,161 INFO L168 Benchmark]: Boogie Preprocessor took 38.15 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 124.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:08:09,161 INFO L168 Benchmark]: RCFGBuilder took 380.82 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 123.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:09,162 INFO L168 Benchmark]: TraceAbstraction took 49159.65 ms. Allocated memory was 151.0 MB in the beginning and 453.0 MB in the end (delta: 302.0 MB). Free memory was 122.7 MB in the beginning and 368.3 MB in the end (delta: -245.7 MB). Peak memory consumption was 262.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:09,164 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 125.1 MB in the end (delta: 141.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 254.38 ms. Allocated memory is still 151.0 MB. Free memory was 135.2 MB in the beginning and 126.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.15 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 124.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 8.0 GB. * RCFGBuilder took 380.82 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 123.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49159.65 ms. Allocated memory was 151.0 MB in the beginning and 453.0 MB in the end (delta: 302.0 MB). Free memory was 122.7 MB in the beginning and 368.3 MB in the end (delta: -245.7 MB). Peak memory consumption was 262.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 20 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: ((((((((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (((\old(x) == x && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || (21 <= \old(x) && \old(x) == x)) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 42.5s, OverallIterations: 22, TraceHistogramMax: 22, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 710 SDtfs, 2243 SDslu, 2070 SDs, 0 SdLazy, 7645 SolverSat, 654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5139 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 130 PreInvPairs, 539 NumberOfFragments, 1880 HoareAnnotationTreeSize, 130 FomulaSimplifications, 8966 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 37 FomulaSimplificationsInter, 7564 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2398 NumberOfCodeBlocks, 2398 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2376 ConstructedInterpolants, 0 QuantifiedInterpolants, 917488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 6132/13244 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...