/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:40:17,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:40:17,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:40:17,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:40:17,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:40:17,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:40:17,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:40:17,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:40:17,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:40:17,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:40:17,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:40:17,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:40:17,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:40:17,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:40:17,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:40:17,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:40:17,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:40:17,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:40:17,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:40:17,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:40:17,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:40:17,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:40:17,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:40:17,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:40:17,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:40:17,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:40:17,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:40:17,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:40:17,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:40:17,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:40:17,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:40:17,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:40:17,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:40:17,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:40:17,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:40:17,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:40:17,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:40:17,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:40:17,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:40:17,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:40:17,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:40:17,623 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 00:40:17,644 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:40:17,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:40:17,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:40:17,649 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:40:17,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:40:17,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:40:17,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:40:17,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:40:17,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:40:17,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:40:17,651 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:40:17,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:40:17,652 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:40:17,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:40:17,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:40:17,652 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:40:17,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:40:17,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:40:17,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:40:17,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:40:17,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:40:17,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:40:17,654 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 [2020-11-07 00:40:18,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:40:18,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:40:18,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:40:18,068 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:40:18,069 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:40:18,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-11-07 00:40:18,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22750a8eb/04afc8e0be084355bfb02d83155f93a3/FLAGb0285f0e5 [2020-11-07 00:40:18,706 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:40:18,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-11-07 00:40:18,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22750a8eb/04afc8e0be084355bfb02d83155f93a3/FLAGb0285f0e5 [2020-11-07 00:40:19,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22750a8eb/04afc8e0be084355bfb02d83155f93a3 [2020-11-07 00:40:19,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:40:19,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:40:19,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:19,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:40:19,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:40:19,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362d9de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19, skipping insertion in model container [2020-11-07 00:40:19,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:40:19,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:40:19,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:19,295 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:40:19,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:19,329 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:40:19,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19 WrapperNode [2020-11-07 00:40:19,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:19,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:40:19,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:40:19,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:40:19,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... [2020-11-07 00:40:19,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:40:19,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:40:19,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:40:19,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:40:19,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:40:19,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:40:19,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:40:19,449 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:40:19,449 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 00:40:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 00:40:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:40:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:40:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:40:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:40:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:40:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:40:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 00:40:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 00:40:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:40:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:40:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:40:19,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:40:19,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:40:19,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:40:19,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:40:19,922 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:40:19,923 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:40:19,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:19 BoogieIcfgContainer [2020-11-07 00:40:19,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:40:19,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:40:19,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:40:19,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:40:19,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:40:19" (1/3) ... [2020-11-07 00:40:19,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f47ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:19, skipping insertion in model container [2020-11-07 00:40:19,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:19" (2/3) ... [2020-11-07 00:40:19,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f47ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:19, skipping insertion in model container [2020-11-07 00:40:19,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:19" (3/3) ... [2020-11-07 00:40:19,937 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-11-07 00:40:19,961 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:40:19,965 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:40:19,983 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:40:20,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:40:20,017 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:40:20,017 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:40:20,017 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:40:20,017 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:40:20,017 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:40:20,018 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:40:20,018 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:40:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 00:40:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:40:20,052 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:20,053 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 00:40:20,054 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 00:40:20,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:20,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [380391877] [2020-11-07 00:40:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:20,171 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:20,625 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 00:40:20,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [380391877] [2020-11-07 00:40:20,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:20,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:20,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089747180] [2020-11-07 00:40:20,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:20,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:20,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:20,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:20,658 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 00:40:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:21,317 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-11-07 00:40:21,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:21,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:40:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:21,340 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:40:21,343 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 00:40:21,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 00:40:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 00:40:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:40:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:40:21,470 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 00:40:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:21,471 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:40:21,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:40:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:40:21,474 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:21,474 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 00:40:21,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:40:21,475 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 00:40:21,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:21,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [892119309] [2020-11-07 00:40:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:21,481 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:21,593 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 00:40:21,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [892119309] [2020-11-07 00:40:21,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:21,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:21,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465240101] [2020-11-07 00:40:21,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:21,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:21,597 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 00:40:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:21,921 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:40:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:21,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:40:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:21,925 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:40:21,925 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:40:21,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:40:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:40:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:40:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:40:21,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 00:40:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:21,945 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:40:21,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:40:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:40:21,947 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:21,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:21,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:40:21,948 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 00:40:21,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:21,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1336587509] [2020-11-07 00:40:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:21,952 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:40:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:40:22,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1336587509] [2020-11-07 00:40:22,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:22,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:22,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685748573] [2020-11-07 00:40:22,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:22,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:22,104 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 00:40:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:22,425 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 00:40:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:22,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:40:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:22,428 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:40:22,428 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:40:22,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:40:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 00:40:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:40:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:40:22,446 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 00:40:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:22,447 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:40:22,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:40:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:40:22,449 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:22,449 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:22,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:40:22,450 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 00:40:22,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:22,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322304516] [2020-11-07 00:40:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:22,454 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:40:22,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322304516] [2020-11-07 00:40:22,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:22,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:22,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493824347] [2020-11-07 00:40:22,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:22,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:22,595 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 00:40:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:23,116 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 00:40:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:23,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 00:40:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:23,120 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:40:23,120 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:40:23,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:40:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 00:40:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:40:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 00:40:23,144 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 00:40:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:23,144 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 00:40:23,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 00:40:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:40:23,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:23,147 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:23,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:40:23,148 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:23,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 00:40:23,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:23,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259699947] [2020-11-07 00:40:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:23,152 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:40:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 00:40:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:23,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259699947] [2020-11-07 00:40:23,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:23,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:23,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96747028] [2020-11-07 00:40:23,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:23,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:23,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:23,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:23,298 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 00:40:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:23,655 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 00:40:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:23,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 00:40:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:23,658 INFO L225 Difference]: With dead ends: 140 [2020-11-07 00:40:23,658 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:40:23,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:40:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:40:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:40:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 00:40:23,683 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 00:40:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:23,684 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 00:40:23,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 00:40:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:40:23,687 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:23,687 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:23,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:40:23,688 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:23,688 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 00:40:23,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:23,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593316100] [2020-11-07 00:40:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:23,691 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:40:23,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593316100] [2020-11-07 00:40:23,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:23,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:23,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185215836] [2020-11-07 00:40:23,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:23,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:23,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:23,912 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 00:40:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:24,435 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 00:40:24,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:40:24,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:40:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:24,438 INFO L225 Difference]: With dead ends: 152 [2020-11-07 00:40:24,438 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:40:24,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:40:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 00:40:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 00:40:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 00:40:24,465 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 00:40:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:24,465 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 00:40:24,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 00:40:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:40:24,468 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:24,469 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:24,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:40:24,469 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 00:40:24,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:24,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [689701483] [2020-11-07 00:40:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:24,473 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:24,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [689701483] [2020-11-07 00:40:24,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:24,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:24,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727903607] [2020-11-07 00:40:24,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:24,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:24,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:24,665 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 00:40:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:25,444 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 00:40:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:40:25,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 00:40:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:25,449 INFO L225 Difference]: With dead ends: 128 [2020-11-07 00:40:25,449 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 00:40:25,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 00:40:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 00:40:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 00:40:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 00:40:25,482 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 00:40:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:25,483 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 00:40:25,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 00:40:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 00:40:25,485 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:25,485 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:25,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:40:25,486 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 00:40:25,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:25,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713710133] [2020-11-07 00:40:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:25,489 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 00:40:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:40:25,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713710133] [2020-11-07 00:40:25,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:25,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:25,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596948392] [2020-11-07 00:40:25,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:25,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:25,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:25,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:25,683 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 00:40:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:26,304 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 00:40:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:26,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 00:40:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:26,310 INFO L225 Difference]: With dead ends: 237 [2020-11-07 00:40:26,310 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 00:40:26,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:40:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 00:40:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 00:40:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:40:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 00:40:26,371 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 00:40:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:26,372 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 00:40:26,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 00:40:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:40:26,376 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:26,377 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:26,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:40:26,377 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:26,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 00:40:26,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:26,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2138765291] [2020-11-07 00:40:26,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:26,382 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:40:26,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2138765291] [2020-11-07 00:40:26,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:26,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:26,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142020880] [2020-11-07 00:40:26,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:26,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:26,617 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-11-07 00:40:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:27,335 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 00:40:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:27,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 00:40:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:27,342 INFO L225 Difference]: With dead ends: 267 [2020-11-07 00:40:27,342 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:40:27,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:40:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 00:40:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:40:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 00:40:27,399 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 00:40:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:27,400 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 00:40:27,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 00:40:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:40:27,405 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:27,405 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:27,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:40:27,405 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-11-07 00:40:27,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:27,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070838361] [2020-11-07 00:40:27,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:27,411 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 00:40:27,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070838361] [2020-11-07 00:40:27,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:27,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:27,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052081076] [2020-11-07 00:40:27,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:27,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:27,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:27,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:27,703 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-11-07 00:40:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:28,604 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-11-07 00:40:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:40:28,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-11-07 00:40:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:28,615 INFO L225 Difference]: With dead ends: 223 [2020-11-07 00:40:28,616 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 00:40:28,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:40:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 00:40:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-11-07 00:40:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 00:40:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-11-07 00:40:28,683 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 97 [2020-11-07 00:40:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:28,684 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-11-07 00:40:28,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-11-07 00:40:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-07 00:40:28,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:28,688 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:28,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:40:28,688 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891877, now seen corresponding path program 2 times [2020-11-07 00:40:28,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:28,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1909815236] [2020-11-07 00:40:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:28,694 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 00:40:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-07 00:40:28,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1909815236] [2020-11-07 00:40:28,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:28,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:40:28,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453606574] [2020-11-07 00:40:28,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:40:28,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:40:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:40:28,949 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 10 states. [2020-11-07 00:40:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:29,743 INFO L93 Difference]: Finished difference Result 455 states and 768 transitions. [2020-11-07 00:40:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:40:29,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2020-11-07 00:40:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:29,754 INFO L225 Difference]: With dead ends: 455 [2020-11-07 00:40:29,754 INFO L226 Difference]: Without dead ends: 262 [2020-11-07 00:40:29,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-07 00:40:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2020-11-07 00:40:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-07 00:40:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2020-11-07 00:40:29,820 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 115 [2020-11-07 00:40:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:29,821 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2020-11-07 00:40:29,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:40:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2020-11-07 00:40:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 00:40:29,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:29,826 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 00:40:29,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:40:29,826 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1046535914, now seen corresponding path program 1 times [2020-11-07 00:40:29,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:29,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1436098181] [2020-11-07 00:40:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:29,832 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:29,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:40:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 00:40:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-11-07 00:40:30,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1436098181] [2020-11-07 00:40:30,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:30,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:40:30,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872649508] [2020-11-07 00:40:30,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:40:30,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:40:30,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:30,198 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 11 states. [2020-11-07 00:40:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:31,179 INFO L93 Difference]: Finished difference Result 359 states and 571 transitions. [2020-11-07 00:40:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:40:31,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2020-11-07 00:40:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:31,185 INFO L225 Difference]: With dead ends: 359 [2020-11-07 00:40:31,186 INFO L226 Difference]: Without dead ends: 352 [2020-11-07 00:40:31,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:40:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-11-07 00:40:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 340. [2020-11-07 00:40:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-11-07 00:40:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2020-11-07 00:40:31,263 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 185 [2020-11-07 00:40:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:31,264 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2020-11-07 00:40:31,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:40:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2020-11-07 00:40:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-11-07 00:40:31,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:31,271 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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 00:40:31,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:40:31,271 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:31,272 INFO L82 PathProgramCache]: Analyzing trace with hash -511149312, now seen corresponding path program 3 times [2020-11-07 00:40:31,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:31,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706983630] [2020-11-07 00:40:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:31,275 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 00:40:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:40:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-07 00:40:31,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706983630] [2020-11-07 00:40:31,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:31,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:40:31,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553813085] [2020-11-07 00:40:31,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:40:31,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:40:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:40:31,783 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 12 states. [2020-11-07 00:40:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:32,881 INFO L93 Difference]: Finished difference Result 766 states and 1451 transitions. [2020-11-07 00:40:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:40:32,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 222 [2020-11-07 00:40:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:32,892 INFO L225 Difference]: With dead ends: 766 [2020-11-07 00:40:32,893 INFO L226 Difference]: Without dead ends: 442 [2020-11-07 00:40:32,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:40:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-07 00:40:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 430. [2020-11-07 00:40:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-11-07 00:40:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 721 transitions. [2020-11-07 00:40:33,029 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 721 transitions. Word has length 222 [2020-11-07 00:40:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:33,030 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 721 transitions. [2020-11-07 00:40:33,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:40:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 721 transitions. [2020-11-07 00:40:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2020-11-07 00:40:33,040 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:33,041 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 15, 15, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:33,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:40:33,041 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1369698103, now seen corresponding path program 4 times [2020-11-07 00:40:33,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:33,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [74419653] [2020-11-07 00:40:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:33,045 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:40:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 00:40:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:40:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 00:40:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:40:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 37 proven. 157 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2020-11-07 00:40:33,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [74419653] [2020-11-07 00:40:33,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:33,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:40:33,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165934756] [2020-11-07 00:40:33,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:40:33,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:33,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:40:33,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:40:33,737 INFO L87 Difference]: Start difference. First operand 430 states and 721 transitions. Second operand 16 states. [2020-11-07 00:40:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:35,996 INFO L93 Difference]: Finished difference Result 745 states and 1361 transitions. [2020-11-07 00:40:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 00:40:35,997 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 313 [2020-11-07 00:40:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:36,008 INFO L225 Difference]: With dead ends: 745 [2020-11-07 00:40:36,009 INFO L226 Difference]: Without dead ends: 319 [2020-11-07 00:40:36,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 00:40:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-11-07 00:40:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 291. [2020-11-07 00:40:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-11-07 00:40:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 418 transitions. [2020-11-07 00:40:36,090 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 418 transitions. Word has length 313 [2020-11-07 00:40:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:36,091 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 418 transitions. [2020-11-07 00:40:36,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:40:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 418 transitions. [2020-11-07 00:40:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2020-11-07 00:40:36,095 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:36,095 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2020-11-07 00:40:36,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:40:36,095 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash -834000686, now seen corresponding path program 2 times [2020-11-07 00:40:36,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:36,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571268717] [2020-11-07 00:40:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:36,100 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-11-07 00:40:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-11-07 00:40:36,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571268717] [2020-11-07 00:40:36,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:36,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:40:36,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418167866] [2020-11-07 00:40:36,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:40:36,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:40:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:40:36,601 INFO L87 Difference]: Start difference. First operand 291 states and 418 transitions. Second operand 15 states. [2020-11-07 00:40:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:38,461 INFO L93 Difference]: Finished difference Result 608 states and 938 transitions. [2020-11-07 00:40:38,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:40:38,462 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 203 [2020-11-07 00:40:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:38,469 INFO L225 Difference]: With dead ends: 608 [2020-11-07 00:40:38,469 INFO L226 Difference]: Without dead ends: 334 [2020-11-07 00:40:38,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:40:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-11-07 00:40:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 310. [2020-11-07 00:40:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-11-07 00:40:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 435 transitions. [2020-11-07 00:40:38,554 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 435 transitions. Word has length 203 [2020-11-07 00:40:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:38,557 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 435 transitions. [2020-11-07 00:40:38,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:40:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 435 transitions. [2020-11-07 00:40:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-07 00:40:38,563 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:38,563 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2020-11-07 00:40:38,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:40:38,563 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1735863863, now seen corresponding path program 3 times [2020-11-07 00:40:38,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:38,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661315374] [2020-11-07 00:40:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:38,574 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 00:40:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:38,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-11-07 00:40:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-07 00:40:39,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661315374] [2020-11-07 00:40:39,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:39,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:40:39,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145028181] [2020-11-07 00:40:39,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:40:39,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:39,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:40:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:39,201 INFO L87 Difference]: Start difference. First operand 310 states and 435 transitions. Second operand 13 states. [2020-11-07 00:40:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:40,796 INFO L93 Difference]: Finished difference Result 602 states and 898 transitions. [2020-11-07 00:40:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:40:40,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 238 [2020-11-07 00:40:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:40,804 INFO L225 Difference]: With dead ends: 602 [2020-11-07 00:40:40,804 INFO L226 Difference]: Without dead ends: 310 [2020-11-07 00:40:40,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:40:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-07 00:40:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 304. [2020-11-07 00:40:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-07 00:40:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 423 transitions. [2020-11-07 00:40:40,884 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 423 transitions. Word has length 238 [2020-11-07 00:40:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:40,884 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 423 transitions. [2020-11-07 00:40:40,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:40:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 423 transitions. [2020-11-07 00:40:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2020-11-07 00:40:40,890 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:40,890 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 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 00:40:40,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:40:40,891 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1024917450, now seen corresponding path program 4 times [2020-11-07 00:40:40,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:40,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863351822] [2020-11-07 00:40:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:40,895 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:40:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 33 proven. 26 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2020-11-07 00:40:41,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863351822] [2020-11-07 00:40:41,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:41,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 00:40:41,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572176820] [2020-11-07 00:40:41,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 00:40:41,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 00:40:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:40:41,837 INFO L87 Difference]: Start difference. First operand 304 states and 423 transitions. Second operand 19 states. [2020-11-07 00:40:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:44,975 INFO L93 Difference]: Finished difference Result 546 states and 827 transitions. [2020-11-07 00:40:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 00:40:44,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 290 [2020-11-07 00:40:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:44,980 INFO L225 Difference]: With dead ends: 546 [2020-11-07 00:40:44,980 INFO L226 Difference]: Without dead ends: 251 [2020-11-07 00:40:44,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=406, Invalid=2246, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 00:40:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-11-07 00:40:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2020-11-07 00:40:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-11-07 00:40:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2020-11-07 00:40:45,029 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 290 [2020-11-07 00:40:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:45,029 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2020-11-07 00:40:45,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 00:40:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2020-11-07 00:40:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 00:40:45,034 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:45,034 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 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] [2020-11-07 00:40:45,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:40:45,034 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash -914043270, now seen corresponding path program 5 times [2020-11-07 00:40:45,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:45,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012845231] [2020-11-07 00:40:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:45,038 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:40:45,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:40:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:40:45,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:40:45,159 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:40:45,159 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:40:45,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:40:45,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:40:45 BoogieIcfgContainer [2020-11-07 00:40:45,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:40:45,213 INFO L168 Benchmark]: Toolchain (without parser) took 26114.12 ms. Allocated memory was 167.8 MB in the beginning and 505.4 MB in the end (delta: 337.6 MB). Free memory was 143.8 MB in the beginning and 416.9 MB in the end (delta: -273.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:45,214 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 167.8 MB. Free memory is still 139.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:40:45,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.35 ms. Allocated memory is still 167.8 MB. Free memory was 143.1 MB in the beginning and 133.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:45,222 INFO L168 Benchmark]: Boogie Preprocessor took 32.44 ms. Allocated memory is still 167.8 MB. Free memory was 133.7 MB in the beginning and 132.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:45,222 INFO L168 Benchmark]: RCFGBuilder took 562.35 ms. Allocated memory is still 167.8 MB. Free memory was 132.4 MB in the beginning and 117.1 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:45,224 INFO L168 Benchmark]: TraceAbstraction took 25276.20 ms. Allocated memory was 167.8 MB in the beginning and 505.4 MB in the end (delta: 337.6 MB). Free memory was 116.5 MB in the beginning and 416.9 MB in the end (delta: -300.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:40:45,230 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.19 ms. Allocated memory is still 167.8 MB. Free memory is still 139.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 229.35 ms. Allocated memory is still 167.8 MB. Free memory was 143.1 MB in the beginning and 133.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.44 ms. Allocated memory is still 167.8 MB. Free memory was 133.7 MB in the beginning and 132.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 562.35 ms. Allocated memory is still 167.8 MB. Free memory was 132.4 MB in the beginning and 117.1 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25276.20 ms. Allocated memory was 167.8 MB in the beginning and 505.4 MB in the end (delta: 337.6 MB). Free memory was 116.5 MB in the beginning and 416.9 MB in the end (delta: -300.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 6; [L39] CALL, EXPR fibo1(x) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND TRUE n < 1 [L21] return 0; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND TRUE n < 1 [L11] return 0; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND TRUE n < 1 [L11] return 0; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND FALSE !(n == 1) [L25] CALL, EXPR fibo1(n-1) [L10] COND FALSE !(n < 1) [L12] COND TRUE n == 1 [L13] return 1; [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND TRUE n < 1 [L11] return 0; [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) [L25] CALL, EXPR fibo1(n-2) [L10] COND FALSE !(n < 1) [L12] COND FALSE !(n == 1) [L15] CALL, EXPR fibo2(n-1) [L20] COND FALSE !(n < 1) [L22] COND TRUE n == 1 [L23] return 1; [L15] RET, EXPR fibo2(n-1) [L15] CALL, EXPR fibo2(n-2) [L20] COND TRUE n < 1 [L21] return 0; [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 8 [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_6-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.1s, OverallIterations: 18, TraceHistogramMax: 21, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 883 SDtfs, 1754 SDslu, 1909 SDs, 0 SdLazy, 5920 SolverSat, 902 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 203 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 incorrect! Received shutdown request...