/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/fibo_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:05:34,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:05:34,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:05:34,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:05:34,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:05:34,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:05:34,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:05:34,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:05:34,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:05:34,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:05:34,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:05:34,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:05:34,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:05:34,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:05:34,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:05:34,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:05:34,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:05:34,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:05:34,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:05:34,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:05:34,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:05:34,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:05:34,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:05:34,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:05:34,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:05:34,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:05:34,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:05:34,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:05:34,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:05:34,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:05:34,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:05:34,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:05:34,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:05:34,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:05:34,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:05:34,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:05:34,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:05:34,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:05:34,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:05:34,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:05:34,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:05:34,588 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:05:34,613 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:05:34,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:05:34,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:05:34,620 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:05:34,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:05:34,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:05:34,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:05:34,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:05:34,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:05:34,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:05:34,624 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:05:34,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:05:34,624 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:05:34,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:05:34,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:05:34,626 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:05:34,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:05:34,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:05:34,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:05:34,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:05:34,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:05:34,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:05:34,628 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:05:35,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:05:35,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:05:35,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:05:35,104 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:05:35,104 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:05:35,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-11-07 05:05:35,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f78dc25/00b144e9d06c46c8a64d139f441e583c/FLAG4a10f30ae [2020-11-07 05:05:35,950 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:05:35,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-11-07 05:05:35,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f78dc25/00b144e9d06c46c8a64d139f441e583c/FLAG4a10f30ae [2020-11-07 05:05:36,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f78dc25/00b144e9d06c46c8a64d139f441e583c [2020-11-07 05:05:36,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:05:36,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:05:36,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:05:36,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:05:36,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:05:36,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220ae538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36, skipping insertion in model container [2020-11-07 05:05:36,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:05:36,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:05:36,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:05:36,651 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:05:36,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:05:36,695 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:05:36,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36 WrapperNode [2020-11-07 05:05:36,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:05:36,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:05:36,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:05:36,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:05:36,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (1/1) ... [2020-11-07 05:05:36,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:05:36,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:05:36,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:05:36,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:05:36,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (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:05:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:05:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:05:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:05:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 05:05:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:05:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:05:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:05:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:05:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:05:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:05:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 05:05:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:05:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:05:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:05:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:05:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:05:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:05:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:05:37,198 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:05:37,199 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:05:37,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:37 BoogieIcfgContainer [2020-11-07 05:05:37,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:05:37,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:05:37,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:05:37,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:05:37,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:05:36" (1/3) ... [2020-11-07 05:05:37,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f97cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:37, skipping insertion in model container [2020-11-07 05:05:37,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:36" (2/3) ... [2020-11-07 05:05:37,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f97cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:37, skipping insertion in model container [2020-11-07 05:05:37,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:37" (3/3) ... [2020-11-07 05:05:37,217 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2020-11-07 05:05:37,290 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:05:37,294 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:05:37,330 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:05:37,411 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:05:37,411 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:05:37,411 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:05:37,412 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:05:37,412 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:05:37,412 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:05:37,414 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:05:37,414 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:05:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 05:05:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:05:37,460 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:37,462 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:05:37,462 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:37,481 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 05:05:37,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:37,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865904416] [2020-11-07 05:05:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:38,053 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-11-07 05:05:38,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:38,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:38,224 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:05:38,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865904416] [2020-11-07 05:05:38,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:05:38,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:05:38,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894230790] [2020-11-07 05:05:38,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:05:38,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:05:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:05:38,266 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 05:05:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:38,777 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-11-07 05:05:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:05:38,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:05:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:38,815 INFO L225 Difference]: With dead ends: 57 [2020-11-07 05:05:38,816 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:05:38,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:05:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:05:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:05:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:05:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:05:38,962 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 05:05:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:38,963 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:05:38,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:05:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:05:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:05:38,966 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:38,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:38,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:05:38,967 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 05:05:38,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:38,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1207400435] [2020-11-07 05:05:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,126 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:05:39,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1207400435] [2020-11-07 05:05:39,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:05:39,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:05:39,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091731184] [2020-11-07 05:05:39,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:05:39,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:39,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:05:39,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:05:39,132 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 05:05:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:39,405 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 05:05:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:05:39,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:05:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:39,409 INFO L225 Difference]: With dead ends: 46 [2020-11-07 05:05:39,409 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:05:39,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:05:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:05:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 05:05:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:05:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:05:39,429 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 05:05:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:39,430 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:05:39,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:05:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:05:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:05:39,432 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:39,432 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:39,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:05:39,433 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 05:05:39,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:39,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1888868920] [2020-11-07 05:05:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:05:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 05:05:39,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1888868920] [2020-11-07 05:05:39,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:39,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:05:39,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468054830] [2020-11-07 05:05:39,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:05:39,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:39,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:05:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:05:39,600 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 05:05:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:39,946 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 05:05:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:39,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:05:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:39,949 INFO L225 Difference]: With dead ends: 62 [2020-11-07 05:05:39,950 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:05:39,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:05:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:05:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 05:05:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 05:05:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 05:05:39,971 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 05:05:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:39,972 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 05:05:39,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:05:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 05:05:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:05:39,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:39,975 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:39,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:05:39,976 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:39,977 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 05:05:39,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:39,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [784015669] [2020-11-07 05:05:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:05:40,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [784015669] [2020-11-07 05:05:40,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:40,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:05:40,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140903395] [2020-11-07 05:05:40,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:05:40,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:40,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:05:40,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:05:40,144 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 05:05:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:40,594 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 05:05:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:05:40,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 05:05:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:40,601 INFO L225 Difference]: With dead ends: 66 [2020-11-07 05:05:40,604 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:05:40,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:05:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:05:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 05:05:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 05:05:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 05:05:40,665 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 05:05:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:40,666 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 05:05:40,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:05:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 05:05:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:05:40,674 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:40,675 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:40,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:05:40,676 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 05:05:40,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:40,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512301920] [2020-11-07 05:05:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 05:05:40,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512301920] [2020-11-07 05:05:40,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:40,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:05:40,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130554410] [2020-11-07 05:05:40,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:05:40,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:40,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:05:40,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:05:40,964 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 05:05:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:41,543 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 05:05:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:05:41,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:05:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:41,554 INFO L225 Difference]: With dead ends: 118 [2020-11-07 05:05:41,554 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 05:05:41,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:05:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 05:05:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 05:05:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 05:05:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 05:05:41,598 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 05:05:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:41,600 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 05:05:41,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:05:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 05:05:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:05:41,614 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:41,615 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:41,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:05:41,617 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:41,618 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 05:05:41,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:41,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [756832807] [2020-11-07 05:05:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:41,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:41,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:41,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:41,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:41,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:41,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 05:05:41,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [756832807] [2020-11-07 05:05:41,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:41,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:05:41,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714260008] [2020-11-07 05:05:41,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:05:41,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:05:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:05:41,947 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 05:05:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:42,459 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 05:05:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:05:42,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 05:05:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:42,469 INFO L225 Difference]: With dead ends: 96 [2020-11-07 05:05:42,469 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 05:05:42,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:05:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 05:05:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 05:05:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 05:05:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 05:05:42,519 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 05:05:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:42,519 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 05:05:42,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:05:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 05:05:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 05:05:42,523 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:42,523 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 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:05:42,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:05:42,524 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 05:05:42,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:42,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [765421254] [2020-11-07 05:05:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:42,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-11-07 05:05:43,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [765421254] [2020-11-07 05:05:43,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:43,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:05:43,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036714656] [2020-11-07 05:05:43,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:05:43,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:05:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:05:43,006 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 05:05:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:43,757 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 05:05:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:05:43,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 05:05:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:43,771 INFO L225 Difference]: With dead ends: 146 [2020-11-07 05:05:43,772 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 05:05:43,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:05:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 05:05:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 05:05:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:05:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 05:05:43,865 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 05:05:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:43,867 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 05:05:43,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:05:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 05:05:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 05:05:43,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:43,875 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 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:05:43,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:05:43,876 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 05:05:43,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:43,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [526800908] [2020-11-07 05:05:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-11-07 05:05:44,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [526800908] [2020-11-07 05:05:44,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:44,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:05:44,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944349360] [2020-11-07 05:05:44,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:05:44,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:44,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:05:44,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:05:44,724 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 14 states. [2020-11-07 05:05:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:46,489 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2020-11-07 05:05:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:05:46,490 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-11-07 05:05:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:46,493 INFO L225 Difference]: With dead ends: 213 [2020-11-07 05:05:46,493 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 05:05:46,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:05:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 05:05:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2020-11-07 05:05:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 05:05:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2020-11-07 05:05:46,519 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 202 [2020-11-07 05:05:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:46,520 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2020-11-07 05:05:46,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:05:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2020-11-07 05:05:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 05:05:46,522 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:46,523 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 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:05:46,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:05:46,523 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:46,524 INFO L82 PathProgramCache]: Analyzing trace with hash -799639331, now seen corresponding path program 6 times [2020-11-07 05:05:46,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:46,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [783648374] [2020-11-07 05:05:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:46,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:46,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:46,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:46,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:46,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2020-11-07 05:05:47,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [783648374] [2020-11-07 05:05:47,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:47,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:05:47,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710202145] [2020-11-07 05:05:47,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:05:47,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:05:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:05:47,313 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 17 states. [2020-11-07 05:05:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:49,517 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2020-11-07 05:05:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:05:49,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2020-11-07 05:05:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:49,521 INFO L225 Difference]: With dead ends: 111 [2020-11-07 05:05:49,521 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 05:05:49,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 05:05:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 05:05:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2020-11-07 05:05:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 05:05:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2020-11-07 05:05:49,549 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 149 [2020-11-07 05:05:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:49,550 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2020-11-07 05:05:49,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:05:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2020-11-07 05:05:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 05:05:49,554 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:49,554 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 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:05:49,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:05:49,555 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash 876241593, now seen corresponding path program 7 times [2020-11-07 05:05:49,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:49,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [133593734] [2020-11-07 05:05:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-11-07 05:05:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:49,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 285 proven. 207 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2020-11-07 05:05:50,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [133593734] [2020-11-07 05:05:50,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:50,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:05:50,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890774142] [2020-11-07 05:05:50,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:05:50,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:05:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:05:50,099 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 11 states. [2020-11-07 05:05:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:51,156 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2020-11-07 05:05:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:05:51,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2020-11-07 05:05:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:51,161 INFO L225 Difference]: With dead ends: 176 [2020-11-07 05:05:51,161 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 05:05:51,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:05:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 05:05:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 05:05:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 05:05:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2020-11-07 05:05:51,215 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 184 [2020-11-07 05:05:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:51,216 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2020-11-07 05:05:51,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:05:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2020-11-07 05:05:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 05:05:51,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:51,225 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 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:05:51,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:05:51,225 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1677663584, now seen corresponding path program 8 times [2020-11-07 05:05:51,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:51,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223181097] [2020-11-07 05:05:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:05:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 391 proven. 334 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2020-11-07 05:05:51,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223181097] [2020-11-07 05:05:51,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:51,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:05:51,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768222222] [2020-11-07 05:05:51,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:05:51,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:05:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:05:51,956 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 14 states. [2020-11-07 05:05:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:53,396 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2020-11-07 05:05:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:05:53,397 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-11-07 05:05:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:53,398 INFO L225 Difference]: With dead ends: 172 [2020-11-07 05:05:53,398 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:05:53,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2020-11-07 05:05:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:05:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:05:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:05:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:05:53,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2020-11-07 05:05:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:53,403 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:05:53,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:05:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:05:53,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:05:53,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:05:53,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:05:56,570 WARN L194 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2020-11-07 05:05:57,328 WARN L194 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2020-11-07 05:05:57,485 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 6 [2020-11-07 05:05:58,021 WARN L194 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2020-11-07 05:05:58,596 WARN L194 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2020-11-07 05:05:59,139 WARN L194 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-11-07 05:05:59,650 WARN L194 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2020-11-07 05:06:00,070 WARN L194 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2020-11-07 05:06:00,488 WARN L194 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2020-11-07 05:06:00,595 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,595 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,595 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,596 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,596 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,596 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,596 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:00,596 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:00,596 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,597 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:06:00,597 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,597 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,597 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:06:00,597 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:06:00,597 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:06:00,597 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:00,598 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:06:00,598 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:06:00,598 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 25 32) the Hoare annotation is: true [2020-11-07 05:06:00,598 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: false [2020-11-07 05:06:00,598 INFO L262 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 05:06:00,598 INFO L262 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: false [2020-11-07 05:06:00,598 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-11-07 05:06:00,598 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= main_~x~0 5) (<= |main_#t~ret9| 5) (<= 5 main_~x~0)) [2020-11-07 05:06:00,598 INFO L262 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 05:06:00,599 INFO L262 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= main_~x~0 5) (<= |main_#t~ret9| 5) (<= 5 main_~x~0)) [2020-11-07 05:06:00,599 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 25 32) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 05:06:00,599 INFO L262 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= main_~x~0 5) (<= |main_#t~ret9| 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 05:06:00,599 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 25 32) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 05:06:00,599 INFO L262 CegarLoopResult]: At program point fiboEXIT(lines 7 15) the Hoare annotation is: (and (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#res| 5)) (<= |fibo_#in~n| 0) (<= 6 fibo_~n) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1) (<= |fibo_#in~n| 2))) (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (< 0 fibo_~n) .cse0) (and (<= 0 |fibo_#res|) .cse0 (<= |fibo_#res| 0))))) [2020-11-07 05:06:00,600 INFO L262 CegarLoopResult]: At program point fiboFINAL(lines 7 15) the Hoare annotation is: (and (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#res| 5)) (<= |fibo_#in~n| 0) (<= 6 fibo_~n) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1) (<= |fibo_#in~n| 2))) (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (< 0 fibo_~n) .cse0) (and (<= 0 |fibo_#res|) .cse0 (<= |fibo_#res| 0))))) [2020-11-07 05:06:00,600 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo_#in~n|) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:00,600 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (and (or (not (<= 4 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) .cse0 (<= 2 |fibo_#t~ret7|)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= 3 |fibo_#t~ret7|)) (and (<= 6 fibo_~n) .cse0)) (or (and (<= |fibo_#t~ret7| 1) (<= 1 |fibo_#t~ret7|) .cse0) (not (<= |fibo_#in~n| 3))) (<= 2 |fibo_#in~n|))) [2020-11-07 05:06:00,600 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo_#in~n| 1) (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:00,601 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (and (or (not (<= 4 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) .cse0 (<= 2 |fibo_#t~ret7|)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= 3 |fibo_#t~ret7|)) (and (<= 6 fibo_~n) .cse0)) (or (and (<= |fibo_#t~ret7| 1) (<= 1 |fibo_#t~ret7|) .cse0) (not (<= |fibo_#in~n| 3))) (<= 2 |fibo_#in~n|))) [2020-11-07 05:06:00,601 INFO L262 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:00,601 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse0 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse5 (<= |fibo_#in~n| 2)) (.cse3 (= fibo_~n |fibo_#in~n|))) (let ((.cse4 (and .cse1 (<= 1 .cse0) (<= .cse0 1) .cse2 .cse5 .cse3))) (and (or (and (<= .cse0 2) .cse1 (<= 2 .cse0) .cse2 .cse3 (<= |fibo_#in~n| 3)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse0) (<= .cse0 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= 3 |fibo_#t~ret7|) (<= .cse0 5)) .cse4 (and (<= 6 fibo_~n) .cse3)) (not (<= |fibo_#in~n| 1)) (or (not .cse5) .cse4)))) [2020-11-07 05:06:00,601 INFO L262 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo_#in~n| 0) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:00,602 INFO L262 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse0 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse5 (<= |fibo_#in~n| 2)) (.cse3 (= fibo_~n |fibo_#in~n|))) (let ((.cse4 (and .cse1 (<= 1 .cse0) (<= .cse0 1) .cse2 .cse5 .cse3))) (and (or (and (<= .cse0 2) .cse1 (<= 2 .cse0) .cse2 .cse3 (<= |fibo_#in~n| 3)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse0) (<= .cse0 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= 3 |fibo_#t~ret7|) (<= .cse0 5)) .cse4 (and (<= 6 fibo_~n) .cse3)) (not (<= |fibo_#in~n| 1)) (or (not .cse5) .cse4)))) [2020-11-07 05:06:00,602 INFO L262 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-11-07 05:06:00,602 INFO L262 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo_#t~ret7| 1)) (.cse0 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse3 (<= 1 |fibo_#t~ret7|)) (.cse1 (= fibo_~n |fibo_#in~n|))) (and (or (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse0) (<= |fibo_#res| 3) (<= .cse0 3) .cse1 (<= 3 |fibo_#res|) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= .cse0 2) .cse2 (<= 2 |fibo_#res|) (<= 2 .cse0) .cse3 (<= |fibo_#res| 2) .cse1 (<= |fibo_#in~n| 3)) (not (<= 3 |fibo_#in~n|)) (and (<= 5 |fibo_#res|) (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse1 (<= 3 |fibo_#t~ret7|) (<= .cse0 5) (<= |fibo_#res| 5)) (and (<= 6 fibo_~n) .cse1)) (or (not (<= |fibo_#in~n| 2)) (and (<= 1 |fibo_#res|) .cse2 (<= 1 .cse0) (<= .cse0 1) .cse3 (<= |fibo_#res| 1) .cse1)) (not (<= |fibo_#in~n| 1)))) [2020-11-07 05:06:00,602 INFO L262 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= 3 |fibo_#t~ret7|) (<= |fibo_#res| 5)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) .cse0 (<= 3 |fibo_#res|) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and .cse1 (<= 2 |fibo_#res|) .cse2 (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) .cse0 (<= |fibo_#in~n| 3)) (and (<= 1 |fibo_#res|) .cse1 (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#res| 1) (<= |fibo_#in~n| 2) .cse0) (and (<= 6 fibo_~n) .cse0))) [2020-11-07 05:06:00,603 INFO L269 CegarLoopResult]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2020-11-07 05:06:00,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:00 BoogieIcfgContainer [2020-11-07 05:06:00,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:06:00,629 INFO L168 Benchmark]: Toolchain (without parser) took 24313.16 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 128.1 MB in the beginning and 217.1 MB in the end (delta: -89.0 MB). Peak memory consumption was 196.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:00,630 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 125.5 MB in the end (delta: 120.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:06:00,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.79 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.5 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:06:00,631 INFO L168 Benchmark]: Boogie Preprocessor took 42.83 ms. Allocated memory is still 151.0 MB. Free memory was 118.3 MB in the beginning and 117.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:00,632 INFO L168 Benchmark]: RCFGBuilder took 460.02 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 103.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:00,633 INFO L168 Benchmark]: TraceAbstraction took 23422.11 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 103.2 MB in the beginning and 217.1 MB in the end (delta: -113.9 MB). Peak memory consumption was 171.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:00,637 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.25 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 125.5 MB in the end (delta: 120.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 367.79 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.83 ms. Allocated memory is still 151.0 MB. Free memory was 118.3 MB in the beginning and 117.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 460.02 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 103.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23422.11 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 103.2 MB in the beginning and 217.1 MB in the end (delta: -113.9 MB). Peak memory consumption was 171.0 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: 25]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 7]: Procedure Contract for fibo Derived contract for procedure fibo: ((((((((2 <= \result && \result <= 2) && 3 <= \old(n)) && \old(n) <= 3) || ((5 <= \result && 5 <= \old(n)) && \result <= 5)) || \old(n) <= 0) || 6 <= n) || (((\old(n) <= 4 && \result <= 3) && 3 <= \result) && 4 <= \old(n))) || ((1 <= \result && \result <= 1) && \old(n) <= 2)) && ((0 < n && n == \old(n)) || ((0 <= \result && n == \old(n)) && \result <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.9s, OverallIterations: 11, TraceHistogramMax: 21, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 449 SDtfs, 749 SDslu, 884 SDs, 0 SdLazy, 2432 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 811 PreInvPairs, 1358 NumberOfFragments, 921 HoareAnnotationTreeSize, 811 FomulaSimplifications, 35897 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 43 FomulaSimplificationsInter, 16513 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1115 ConstructedInterpolants, 0 QuantifiedInterpolants, 371441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 3526/4958 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...