/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:05:03,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:05:03,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:05:03,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:05:03,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:05:03,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:05:03,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:05:03,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:05:03,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:05:03,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:05:03,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:05:03,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:05:03,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:05:03,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:05:03,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:05:03,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:05:03,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:05:03,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:05:03,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:05:03,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:05:03,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:05:03,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:05:03,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:05:03,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:05:03,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:05:03,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:05:03,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:05:03,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:05:03,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:05:03,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:05:03,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:05:03,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:05:03,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:05:03,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:05:03,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:05:03,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:05:03,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:05:03,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:05:03,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:05:03,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:05:03,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:05:03,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:05:03,786 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:05:03,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:05:03,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:05:03,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:05:03,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:05:03,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:05:03,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:05:03,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:05:03,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:05:03,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:05:03,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:05:03,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:05:03,795 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:05:03,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:05:03,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:05:03,796 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:05:03,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:05:03,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:05:03,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:05:03,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:05:03,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:05:03,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:05:03,797 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:05:04,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:05:04,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:05:04,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:05:04,246 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:05:04,246 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:05:04,247 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 05:05:04,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd6170cc/bca84c0edf6a4efc825b0f1dbc1349a1/FLAG8956d1eb8 [2020-11-07 05:05:04,906 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:05:04,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-11-07 05:05:04,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd6170cc/bca84c0edf6a4efc825b0f1dbc1349a1/FLAG8956d1eb8 [2020-11-07 05:05:05,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd6170cc/bca84c0edf6a4efc825b0f1dbc1349a1 [2020-11-07 05:05:05,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:05:05,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:05:05,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:05:05,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:05:05,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:05:05,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee7eb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05, skipping insertion in model container [2020-11-07 05:05:05,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:05:05,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:05:05,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:05:05,622 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:05:05,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:05:05,659 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:05:05,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05 WrapperNode [2020-11-07 05:05:05,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:05:05,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:05:05,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:05:05,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:05:05,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... [2020-11-07 05:05:05,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:05:05,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:05:05,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:05:05,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:05:05,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:05:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:05:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:05:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:05:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 05:05:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 05:05:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:05:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:05:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:05:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:05:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:05:05,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:05:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 05:05:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 05:05:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:05:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:05:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:05:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:05:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:05:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:05:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:05:06,084 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:05:06,085 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:05:06,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:06 BoogieIcfgContainer [2020-11-07 05:05:06,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:05:06,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:05:06,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:05:06,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:05:06,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:05:05" (1/3) ... [2020-11-07 05:05:06,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74affbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:06, skipping insertion in model container [2020-11-07 05:05:06,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:05" (2/3) ... [2020-11-07 05:05:06,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74affbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:06, skipping insertion in model container [2020-11-07 05:05:06,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:06" (3/3) ... [2020-11-07 05:05:06,101 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-11-07 05:05:06,124 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:05:06,129 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:05:06,147 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:05:06,179 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:05:06,180 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:05:06,180 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:05:06,180 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:05:06,180 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:05:06,181 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:05:06,181 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:05:06,181 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:05:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 05:05:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:05:06,231 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:06,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:06,237 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 05:05:06,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:06,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329886917] [2020-11-07 05:05:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:06,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:06,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:05:06,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329886917] [2020-11-07 05:05:06,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:05:06,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:05:06,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544931438] [2020-11-07 05:05:06,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:05:06,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:05:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:05:06,792 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 05:05:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:07,332 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-11-07 05:05:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:07,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:05:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:07,346 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:05:07,346 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 05:05:07,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 05:05:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 05:05:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:05:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:05:07,411 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 05:05:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:07,412 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:05:07,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:05:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:05:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:05:07,415 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:07,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:07,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:05:07,416 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 05:05:07,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:07,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1692852463] [2020-11-07 05:05:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:05:07,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1692852463] [2020-11-07 05:05:07,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:05:07,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:05:07,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571970544] [2020-11-07 05:05:07,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:05:07,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:05:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:05:07,545 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 05:05:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:07,952 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 05:05:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:07,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:05:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:07,956 INFO L225 Difference]: With dead ends: 60 [2020-11-07 05:05:07,956 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 05:05:07,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 05:05:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 05:05:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:05:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:05:07,977 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 05:05:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:07,977 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:05:07,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:05:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:05:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:05:07,980 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:07,980 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 05:05:07,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:05:07,981 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:07,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:07,982 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 05:05:07,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:07,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351441486] [2020-11-07 05:05:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:05:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,140 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 05:05:08,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351441486] [2020-11-07 05:05:08,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:08,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:05:08,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258016641] [2020-11-07 05:05:08,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:05:08,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:05:08,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:05:08,144 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 05:05:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:08,497 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 05:05:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:08,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:05:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:08,500 INFO L225 Difference]: With dead ends: 92 [2020-11-07 05:05:08,500 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 05:05:08,502 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 05:05:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 05:05:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 05:05:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 05:05:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 05:05:08,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 05:05:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:08,521 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 05:05:08,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:05:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 05:05:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:05:08,523 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:08,523 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 05:05:08,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:05:08,524 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 05:05:08,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:08,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183473658] [2020-11-07 05:05:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:05:08,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183473658] [2020-11-07 05:05:08,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:08,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:05:08,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932615442] [2020-11-07 05:05:08,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:05:08,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:05:08,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:05:08,695 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 05:05:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:09,415 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 05:05:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:05:09,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 05:05:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:09,422 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:05:09,423 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:05:09,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:05:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:05:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 05:05:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 05:05:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 05:05:09,452 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 05:05:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:09,453 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 05:05:09,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:05:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 05:05:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:05:09,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:09,457 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 05:05:09,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:05:09,457 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:09,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 05:05:09,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:09,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323178995] [2020-11-07 05:05:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:05:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 05:05:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:05:09,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323178995] [2020-11-07 05:05:09,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:09,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:05:09,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393212703] [2020-11-07 05:05:09,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:05:09,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:05:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:05:09,614 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 05:05:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:10,074 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 05:05:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:10,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 05:05:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:10,083 INFO L225 Difference]: With dead ends: 140 [2020-11-07 05:05:10,083 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:05:10,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:05:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:05:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 05:05:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 05:05:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 05:05:10,110 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 05:05:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:10,111 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 05:05:10,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:05:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 05:05:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:05:10,114 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:10,115 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 05:05:10,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:05:10,115 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 05:05:10,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:10,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [919640856] [2020-11-07 05:05:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:05:10,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [919640856] [2020-11-07 05:05:10,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:10,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:05:10,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154563245] [2020-11-07 05:05:10,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:05:10,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:05:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:05:10,352 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 05:05:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:10,924 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 05:05:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:05:10,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:05:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:10,929 INFO L225 Difference]: With dead ends: 152 [2020-11-07 05:05:10,929 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:05:10,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:05:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:05:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 05:05:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 05:05:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 05:05:10,958 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 05:05:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:10,959 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 05:05:10,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:05:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 05:05:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:05:10,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:10,962 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 05:05:10,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:05:10,963 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 05:05:10,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:10,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [934005590] [2020-11-07 05:05:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:11,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:11,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:11,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:11,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:11,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:11,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:05:11,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [934005590] [2020-11-07 05:05:11,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:11,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:05:11,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084922577] [2020-11-07 05:05:11,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:05:11,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:05:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:05:11,201 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 05:05:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:11,947 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 05:05:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:05:11,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 05:05:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:11,951 INFO L225 Difference]: With dead ends: 128 [2020-11-07 05:05:11,951 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 05:05:11,952 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 05:05:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 05:05:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 05:05:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 05:05:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 05:05:11,994 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 05:05:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:11,995 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 05:05:11,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:05:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 05:05:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 05:05:11,998 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:11,999 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 05:05:11,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:05:11,999 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:12,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:12,000 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 05:05:12,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:12,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706937735] [2020-11-07 05:05:12,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 05:05:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:05:12,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706937735] [2020-11-07 05:05:12,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:12,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:05:12,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139161702] [2020-11-07 05:05:12,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:05:12,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:05:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:05:12,220 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 05:05:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:12,851 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 05:05:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:05:12,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 05:05:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:12,854 INFO L225 Difference]: With dead ends: 237 [2020-11-07 05:05:12,855 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 05:05:12,856 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 05:05:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 05:05:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 05:05:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 05:05:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 05:05:12,904 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 05:05:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:12,905 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 05:05:12,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:05:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 05:05:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:05:12,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:12,908 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 05:05:12,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:05:12,908 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:12,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 05:05:12,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:12,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1784200488] [2020-11-07 05:05:12,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:12,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 05:05:13,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1784200488] [2020-11-07 05:05:13,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:13,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:05:13,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161696321] [2020-11-07 05:05:13,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:05:13,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:05:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:13,220 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-11-07 05:05:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:13,984 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 05:05:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:05:13,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 05:05:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:13,989 INFO L225 Difference]: With dead ends: 267 [2020-11-07 05:05:13,989 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 05:05:13,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 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 05:05:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 05:05:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 05:05:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:05:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 05:05:14,058 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 05:05:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:14,058 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 05:05:14,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:05:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 05:05:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:05:14,061 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:14,062 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 05:05:14,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:05:14,062 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:14,063 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-11-07 05:05:14,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:14,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236689914] [2020-11-07 05:05:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-07 05:05:14,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236689914] [2020-11-07 05:05:14,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:14,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:05:14,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216630685] [2020-11-07 05:05:14,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:05:14,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:05:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:14,276 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-11-07 05:05:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:15,153 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-11-07 05:05:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:05:15,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-11-07 05:05:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:15,163 INFO L225 Difference]: With dead ends: 223 [2020-11-07 05:05:15,163 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 05:05:15,165 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 05:05:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 05:05:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-11-07 05:05:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 05:05:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-11-07 05:05:15,238 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 97 [2020-11-07 05:05:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:15,239 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-11-07 05:05:15,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:05:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-11-07 05:05:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-07 05:05:15,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:15,244 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 05:05:15,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:05:15,244 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:15,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891877, now seen corresponding path program 2 times [2020-11-07 05:05:15,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:15,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187354021] [2020-11-07 05:05:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 05:05:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 46 proven. 48 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-07 05:05:15,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187354021] [2020-11-07 05:05:15,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:15,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:05:15,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630752470] [2020-11-07 05:05:15,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:05:15,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:05:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:15,594 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 10 states. [2020-11-07 05:05:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:16,416 INFO L93 Difference]: Finished difference Result 455 states and 768 transitions. [2020-11-07 05:05:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:05:16,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2020-11-07 05:05:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:16,422 INFO L225 Difference]: With dead ends: 455 [2020-11-07 05:05:16,422 INFO L226 Difference]: Without dead ends: 262 [2020-11-07 05:05:16,426 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 05:05:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-11-07 05:05:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2020-11-07 05:05:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-07 05:05:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2020-11-07 05:05:16,495 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 115 [2020-11-07 05:05:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:16,496 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2020-11-07 05:05:16,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:05:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2020-11-07 05:05:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 05:05:16,501 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:16,501 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:16,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:05:16,501 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1725326654, now seen corresponding path program 1 times [2020-11-07 05:05:16,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:16,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1529152719] [2020-11-07 05:05:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 93 proven. 30 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2020-11-07 05:05:16,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1529152719] [2020-11-07 05:05:16,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:16,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:05:16,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817005662] [2020-11-07 05:05:16,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:05:16,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:16,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:05:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:05:16,865 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 11 states. [2020-11-07 05:05:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:17,949 INFO L93 Difference]: Finished difference Result 541 states and 948 transitions. [2020-11-07 05:05:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:05:17,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2020-11-07 05:05:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:17,956 INFO L225 Difference]: With dead ends: 541 [2020-11-07 05:05:17,957 INFO L226 Difference]: Without dead ends: 324 [2020-11-07 05:05:17,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:05:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-11-07 05:05:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2020-11-07 05:05:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2020-11-07 05:05:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 498 transitions. [2020-11-07 05:05:18,048 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 498 transitions. Word has length 132 [2020-11-07 05:05:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:18,049 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 498 transitions. [2020-11-07 05:05:18,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:05:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 498 transitions. [2020-11-07 05:05:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 05:05:18,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:18,058 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-11-07 05:05:18,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:05:18,058 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:18,059 INFO L82 PathProgramCache]: Analyzing trace with hash -666506750, now seen corresponding path program 2 times [2020-11-07 05:05:18,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:18,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597072633] [2020-11-07 05:05:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 05:05:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 162 proven. 141 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2020-11-07 05:05:18,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597072633] [2020-11-07 05:05:18,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:18,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:05:18,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663076639] [2020-11-07 05:05:18,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:05:18,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:18,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:05:18,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:05:18,698 INFO L87 Difference]: Start difference. First operand 319 states and 498 transitions. Second operand 16 states. [2020-11-07 05:05:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:21,153 INFO L93 Difference]: Finished difference Result 530 states and 903 transitions. [2020-11-07 05:05:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:05:21,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2020-11-07 05:05:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:21,161 INFO L225 Difference]: With dead ends: 530 [2020-11-07 05:05:21,161 INFO L226 Difference]: Without dead ends: 212 [2020-11-07 05:05:21,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=272, Invalid=1368, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 05:05:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-11-07 05:05:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2020-11-07 05:05:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-07 05:05:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 241 transitions. [2020-11-07 05:05:21,210 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 241 transitions. Word has length 184 [2020-11-07 05:05:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:21,210 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 241 transitions. [2020-11-07 05:05:21,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:05:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 241 transitions. [2020-11-07 05:05:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-11-07 05:05:21,215 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:21,216 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:21,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:05:21,216 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash 549251036, now seen corresponding path program 3 times [2020-11-07 05:05:21,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:21,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269505988] [2020-11-07 05:05:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-11-07 05:05:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:21,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 179 proven. 407 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2020-11-07 05:05:22,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269505988] [2020-11-07 05:05:22,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:22,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:05:22,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579932920] [2020-11-07 05:05:22,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:05:22,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:22,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:05:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:05:22,032 INFO L87 Difference]: Start difference. First operand 184 states and 241 transitions. Second operand 15 states. [2020-11-07 05:05:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:24,146 INFO L93 Difference]: Finished difference Result 358 states and 515 transitions. [2020-11-07 05:05:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:05:24,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 272 [2020-11-07 05:05:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:24,151 INFO L225 Difference]: With dead ends: 358 [2020-11-07 05:05:24,151 INFO L226 Difference]: Without dead ends: 178 [2020-11-07 05:05:24,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 05:05:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-11-07 05:05:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 148. [2020-11-07 05:05:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-07 05:05:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 187 transitions. [2020-11-07 05:05:24,196 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 187 transitions. Word has length 272 [2020-11-07 05:05:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:24,197 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 187 transitions. [2020-11-07 05:05:24,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:05:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 187 transitions. [2020-11-07 05:05:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-11-07 05:05:24,201 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:24,201 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2020-11-07 05:05:24,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:05:24,202 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1488051944, now seen corresponding path program 4 times [2020-11-07 05:05:24,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:24,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727382938] [2020-11-07 05:05:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:05:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:24,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 253 proven. 395 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2020-11-07 05:05:25,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727382938] [2020-11-07 05:05:25,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:25,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:05:25,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550519501] [2020-11-07 05:05:25,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:05:25,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:25,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:05:25,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:05:25,100 INFO L87 Difference]: Start difference. First operand 148 states and 187 transitions. Second operand 17 states. [2020-11-07 05:05:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:27,762 INFO L93 Difference]: Finished difference Result 325 states and 460 transitions. [2020-11-07 05:05:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 05:05:27,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 273 [2020-11-07 05:05:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:27,769 INFO L225 Difference]: With dead ends: 325 [2020-11-07 05:05:27,769 INFO L226 Difference]: Without dead ends: 186 [2020-11-07 05:05:27,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:05:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-11-07 05:05:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2020-11-07 05:05:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-07 05:05:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2020-11-07 05:05:27,808 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 273 [2020-11-07 05:05:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:27,809 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2020-11-07 05:05:27,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:05:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2020-11-07 05:05:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-11-07 05:05:27,813 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:27,813 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, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:27,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:05:27,814 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1489723466, now seen corresponding path program 5 times [2020-11-07 05:05:27,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:27,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [203892491] [2020-11-07 05:05:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:27,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:27,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:27,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:05:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:05:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:05:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:05:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 333 proven. 219 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2020-11-07 05:05:28,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [203892491] [2020-11-07 05:05:28,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:28,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:05:28,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168453716] [2020-11-07 05:05:28,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:05:28,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:05:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:05:28,458 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand 18 states. [2020-11-07 05:05:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:30,858 INFO L93 Difference]: Finished difference Result 339 states and 474 transitions. [2020-11-07 05:05:30,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 05:05:30,858 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 238 [2020-11-07 05:05:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:30,863 INFO L225 Difference]: With dead ends: 339 [2020-11-07 05:05:30,864 INFO L226 Difference]: Without dead ends: 194 [2020-11-07 05:05:30,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 05:05:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-11-07 05:05:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 174. [2020-11-07 05:05:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-07 05:05:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2020-11-07 05:05:30,908 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 238 [2020-11-07 05:05:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:30,909 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2020-11-07 05:05:30,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:05:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2020-11-07 05:05:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 05:05:30,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:30,913 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 05:05:30,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:05:30,914 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash -914043270, now seen corresponding path program 6 times [2020-11-07 05:05:30,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:30,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1059587305] [2020-11-07 05:05:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:05:30,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:05:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:05:30,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:05:31,060 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:05:31,060 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:05:31,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:05:31,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:05:31 BoogieIcfgContainer [2020-11-07 05:05:31,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:05:31,260 INFO L168 Benchmark]: Toolchain (without parser) took 25936.49 ms. Allocated memory was 159.4 MB in the beginning and 456.1 MB in the end (delta: 296.7 MB). Free memory was 135.3 MB in the beginning and 429.8 MB in the end (delta: -294.5 MB). Peak memory consumption was 268.9 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:31,260 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 159.4 MB. Free memory is still 133.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:05:31,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.50 ms. Allocated memory is still 159.4 MB. Free memory was 134.7 MB in the beginning and 125.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:31,270 INFO L168 Benchmark]: Boogie Preprocessor took 33.90 ms. Allocated memory is still 159.4 MB. Free memory was 125.4 MB in the beginning and 124.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:31,270 INFO L168 Benchmark]: RCFGBuilder took 392.22 ms. Allocated memory is still 159.4 MB. Free memory was 124.0 MB in the beginning and 108.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:31,271 INFO L168 Benchmark]: TraceAbstraction took 25165.39 ms. Allocated memory was 159.4 MB in the beginning and 456.1 MB in the end (delta: 296.7 MB). Free memory was 108.2 MB in the beginning and 429.8 MB in the end (delta: -321.6 MB). Peak memory consumption was 241.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:31,276 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.21 ms. Allocated memory is still 159.4 MB. Free memory is still 133.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 325.50 ms. Allocated memory is still 159.4 MB. Free memory was 134.7 MB in the beginning and 125.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.90 ms. Allocated memory is still 159.4 MB. Free memory was 125.4 MB in the beginning and 124.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 392.22 ms. Allocated memory is still 159.4 MB. Free memory was 124.0 MB in the beginning and 108.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25165.39 ms. Allocated memory was 159.4 MB in the beginning and 456.1 MB in the end (delta: 296.7 MB). Free memory was 108.2 MB in the beginning and 429.8 MB in the end (delta: -321.6 MB). Peak memory consumption was 241.7 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; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=4, \result=3, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=5, \result=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=4, \result=3, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=6, \result=8, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L39] int result = fibo1(x); VAL [fibo1(x)=8, result=8, x=6] [L40] COND TRUE result == 8 VAL [result=8, x=6] [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: 24.8s, OverallIterations: 17, TraceHistogramMax: 15, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 841 SDtfs, 1693 SDslu, 1822 SDs, 0 SdLazy, 5718 SolverSat, 869 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 194 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2021 NumberOfCodeBlocks, 2021 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 564212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 3158/4485 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...