/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_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:04:47,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:04:47,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:04:47,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:04:47,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:04:47,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:04:47,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:04:47,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:04:47,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:04:47,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:04:47,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:04:47,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:04:47,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:04:47,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:04:47,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:04:47,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:04:47,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:04:47,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:04:47,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:04:47,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:04:47,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:04:47,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:04:47,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:04:47,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:04:47,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:04:47,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:04:47,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:04:47,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:04:47,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:04:47,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:04:47,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:04:47,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:04:47,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:04:47,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:04:47,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:04:47,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:04:47,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:04:47,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:04:47,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:04:47,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:04:47,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:04:47,215 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:04:47,237 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:04:47,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:04:47,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:04:47,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:04:47,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:04:47,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:04:47,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:04:47,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:04:47,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:04:47,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:04:47,245 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:04:47,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:04:47,245 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:04:47,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:04:47,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:04:47,246 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:04:47,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:04:47,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:04:47,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:04:47,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:04:47,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:04:47,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:04:47,248 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:04:47,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:04:47,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:04:47,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:04:47,693 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:04:47,694 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:04:47,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-11-07 05:04:47,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f83809c/ec4572ee523e4c6c81dad3cd89e6b9fa/FLAGa75ba8ddd [2020-11-07 05:04:48,430 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:04:48,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-11-07 05:04:48,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f83809c/ec4572ee523e4c6c81dad3cd89e6b9fa/FLAGa75ba8ddd [2020-11-07 05:04:48,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f83809c/ec4572ee523e4c6c81dad3cd89e6b9fa [2020-11-07 05:04:48,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:04:48,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:04:48,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:48,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:04:48,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:04:48,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:48" (1/1) ... [2020-11-07 05:04:48,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70216801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:48, skipping insertion in model container [2020-11-07 05:04:48,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:48" (1/1) ... [2020-11-07 05:04:48,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:04:48,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:04:48,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:49,008 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:04:49,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:49,043 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:04:49,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49 WrapperNode [2020-11-07 05:04:49,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:49,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:04:49,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:04:49,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:04:49,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (1/1) ... [2020-11-07 05:04:49,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (1/1) ... [2020-11-07 05:04:49,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (1/1) ... [2020-11-07 05:04:49,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (1/1) ... [2020-11-07 05:04:49,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (1/1) ... [2020-11-07 05:04:49,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (1/1) ... [2020-11-07 05:04:49,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (1/1) ... [2020-11-07 05:04:49,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:04:49,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:04:49,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:04:49,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:04:49,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (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:04:49,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:04:49,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:04:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:04:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 05:04:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 05:04:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:04:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:04:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:04:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:04:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:04:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:04:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 05:04:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 05:04:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:04:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:04:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:04:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:04:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:04:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:04:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:04:49,566 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:04:49,567 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:04:49,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:49 BoogieIcfgContainer [2020-11-07 05:04:49,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:04:49,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:04:49,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:04:49,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:04:49,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:04:48" (1/3) ... [2020-11-07 05:04:49,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257f4199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:49, skipping insertion in model container [2020-11-07 05:04:49,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:49" (2/3) ... [2020-11-07 05:04:49,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257f4199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:49, skipping insertion in model container [2020-11-07 05:04:49,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:49" (3/3) ... [2020-11-07 05:04:49,583 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2020-11-07 05:04:49,603 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:04:49,607 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:04:49,621 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:04:49,664 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:04:49,664 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:04:49,664 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:04:49,664 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:04:49,665 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:04:49,665 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:04:49,665 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:04:49,665 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:04:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 05:04:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:04:49,706 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:49,707 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:04:49,707 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 05:04:49,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:49,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [682505625] [2020-11-07 05:04:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:50,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:50,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:50,245 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:04:50,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [682505625] [2020-11-07 05:04:50,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:50,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:50,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490861150] [2020-11-07 05:04:50,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:50,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:50,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:50,273 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 05:04:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:50,740 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-11-07 05:04:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:50,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:04:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:50,753 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:04:50,754 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 05:04:50,757 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:04:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 05:04:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 05:04:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:50,825 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 05:04:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:50,826 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:50,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:04:50,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:50,829 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:04:50,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:04:50,830 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:50,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:50,831 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 05:04:50,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:50,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947541230] [2020-11-07 05:04:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:50,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:50,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,013 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:04:51,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947541230] [2020-11-07 05:04:51,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:51,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:51,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223302084] [2020-11-07 05:04:51,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:51,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:51,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:51,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:51,017 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 05:04:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:51,339 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 05:04:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:51,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:04:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:51,342 INFO L225 Difference]: With dead ends: 60 [2020-11-07 05:04:51,342 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 05:04:51,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:04:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 05:04:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 05:04:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:51,360 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 05:04:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:51,361 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:51,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:04:51,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:51,363 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:04:51,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:04:51,364 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 05:04:51,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:51,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082378474] [2020-11-07 05:04:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,499 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:04:51,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082378474] [2020-11-07 05:04:51,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:51,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:51,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221352453] [2020-11-07 05:04:51,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:51,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:51,502 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 05:04:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:51,850 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 05:04:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:51,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:04:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:51,853 INFO L225 Difference]: With dead ends: 92 [2020-11-07 05:04:51,853 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 05:04:51,854 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:04:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 05:04:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 05:04:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 05:04:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 05:04:51,871 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 05:04:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:51,871 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 05:04:51,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 05:04:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:04:51,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:51,874 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:04:51,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:04:51,874 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 05:04:51,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:51,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512496792] [2020-11-07 05:04:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:51,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,033 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:04:52,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512496792] [2020-11-07 05:04:52,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:52,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:52,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374003135] [2020-11-07 05:04:52,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:52,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:52,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:52,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:52,037 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 05:04:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:52,661 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 05:04:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:52,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 05:04:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:52,669 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:04:52,669 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:04:52,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:04:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:04:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 05:04:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 05:04:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 05:04:52,707 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 05:04:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:52,709 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 05:04:52,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 05:04:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:04:52,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:52,718 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:04:52,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:04:52,719 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 05:04:52,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:52,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900181020] [2020-11-07 05:04:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 05:04:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:52,889 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:04:52,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900181020] [2020-11-07 05:04:52,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:52,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:52,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879841587] [2020-11-07 05:04:52,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:52,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:52,893 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 05:04:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:53,285 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 05:04:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:53,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 05:04:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:53,290 INFO L225 Difference]: With dead ends: 140 [2020-11-07 05:04:53,290 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:04:53,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:04:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 05:04:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 05:04:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 05:04:53,348 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 05:04:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:53,352 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 05:04:53,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 05:04:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:04:53,358 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:53,358 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:04:53,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:04:53,358 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:53,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:53,359 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 05:04:53,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:53,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970985035] [2020-11-07 05:04:53,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:53,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:53,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:53,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:53,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:53,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:53,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:53,595 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:04:53,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970985035] [2020-11-07 05:04:53,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:53,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:53,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681385530] [2020-11-07 05:04:53,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:53,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:53,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:53,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:53,598 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 05:04:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:54,169 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 05:04:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:04:54,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:04:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:54,175 INFO L225 Difference]: With dead ends: 152 [2020-11-07 05:04:54,175 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:04:54,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:04:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:04:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 05:04:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 05:04:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 05:04:54,206 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 05:04:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:54,207 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 05:04:54,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 05:04:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:04:54,209 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:54,210 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:04:54,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:04:54,210 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:54,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 05:04:54,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:54,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344528245] [2020-11-07 05:04:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:54,380 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:04:54,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344528245] [2020-11-07 05:04:54,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:54,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:54,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698285184] [2020-11-07 05:04:54,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:54,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:54,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:54,386 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 05:04:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:55,222 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 05:04:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:04:55,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 05:04:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:55,226 INFO L225 Difference]: With dead ends: 128 [2020-11-07 05:04:55,226 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 05:04:55,228 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:04:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 05:04:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 05:04:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 05:04:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 05:04:55,271 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 05:04:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:55,272 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 05:04:55,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:04:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 05:04:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 05:04:55,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:55,275 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:04:55,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:04:55,275 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 05:04:55,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:55,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626830655] [2020-11-07 05:04:55,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 05:04:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:55,547 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:04:55,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626830655] [2020-11-07 05:04:55,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:55,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:55,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980226394] [2020-11-07 05:04:55,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:55,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:55,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:55,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:55,552 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 05:04:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:56,231 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 05:04:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:56,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 05:04:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:56,235 INFO L225 Difference]: With dead ends: 237 [2020-11-07 05:04:56,235 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 05:04:56,237 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:04:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 05:04:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 05:04:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 05:04:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 05:04:56,276 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 05:04:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:56,277 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 05:04:56,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:04:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 05:04:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:04:56,279 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:56,279 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:04:56,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:04:56,280 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 05:04:56,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:56,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519844147] [2020-11-07 05:04:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:56,545 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:04:56,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519844147] [2020-11-07 05:04:56,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:56,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:04:56,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011329484] [2020-11-07 05:04:56,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:04:56,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:56,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:04:56,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:04:56,548 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-11-07 05:04:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:57,401 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 05:04:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:57,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 05:04:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:57,411 INFO L225 Difference]: With dead ends: 267 [2020-11-07 05:04:57,411 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 05:04:57,414 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:04:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 05:04:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 05:04:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:04:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 05:04:57,501 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 05:04:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:57,503 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 05:04:57,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:04:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 05:04:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:04:57,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:57,508 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:04:57,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:04:57,509 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:57,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-11-07 05:04:57,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:57,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492064958] [2020-11-07 05:04:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:57,870 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:04:57,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492064958] [2020-11-07 05:04:57,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:57,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:04:57,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63384085] [2020-11-07 05:04:57,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:04:57,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:04:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:04:57,877 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-11-07 05:04:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:58,906 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-11-07 05:04:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:04:58,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-11-07 05:04:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:58,913 INFO L225 Difference]: With dead ends: 223 [2020-11-07 05:04:58,914 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 05:04:58,915 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:04:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 05:04:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-11-07 05:04:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-07 05:04:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-11-07 05:04:59,005 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 97 [2020-11-07 05:04:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:59,006 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-11-07 05:04:59,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:04:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-11-07 05:04:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-07 05:04:59,023 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:59,023 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:04:59,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:04:59,024 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:59,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891877, now seen corresponding path program 2 times [2020-11-07 05:04:59,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:59,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [571436288] [2020-11-07 05:04:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 05:04:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:59,392 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:04:59,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [571436288] [2020-11-07 05:04:59,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:59,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:04:59,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135946672] [2020-11-07 05:04:59,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:04:59,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:04:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:59,396 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 11 states. [2020-11-07 05:05:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:00,395 INFO L93 Difference]: Finished difference Result 459 states and 784 transitions. [2020-11-07 05:05:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:05:00,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2020-11-07 05:05:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:00,404 INFO L225 Difference]: With dead ends: 459 [2020-11-07 05:05:00,405 INFO L226 Difference]: Without dead ends: 266 [2020-11-07 05:05:00,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:05:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-11-07 05:05:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2020-11-07 05:05:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-11-07 05:05:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2020-11-07 05:05:00,479 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 115 [2020-11-07 05:05:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:00,479 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2020-11-07 05:05:00,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:05:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2020-11-07 05:05:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 05:05:00,484 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:00,485 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 05:05:00,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:05:00,485 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash -139933889, now seen corresponding path program 1 times [2020-11-07 05:05:00,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:00,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726407310] [2020-11-07 05:05:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:05:00,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:05:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:05:00,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:05:00,624 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:05:00,624 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:05:00,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:05:00,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:05:00 BoogieIcfgContainer [2020-11-07 05:05:00,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:05:00,746 INFO L168 Benchmark]: Toolchain (without parser) took 11959.43 ms. Allocated memory was 153.1 MB in the beginning and 268.4 MB in the end (delta: 115.3 MB). Free memory was 129.5 MB in the beginning and 119.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 126.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:00,747 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 153.1 MB. Free memory is still 128.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:05:00,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.91 ms. Allocated memory is still 153.1 MB. Free memory was 128.8 MB in the beginning and 119.5 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:00,749 INFO L168 Benchmark]: Boogie Preprocessor took 34.13 ms. Allocated memory is still 153.1 MB. Free memory was 119.5 MB in the beginning and 118.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:00,749 INFO L168 Benchmark]: RCFGBuilder took 489.43 ms. Allocated memory is still 153.1 MB. Free memory was 118.0 MB in the beginning and 134.8 MB in the end (delta: -16.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:00,750 INFO L168 Benchmark]: TraceAbstraction took 11170.07 ms. Allocated memory was 153.1 MB in the beginning and 268.4 MB in the end (delta: 115.3 MB). Free memory was 134.3 MB in the beginning and 119.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 130.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:05:00,753 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.23 ms. Allocated memory is still 153.1 MB. Free memory is still 128.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 245.91 ms. Allocated memory is still 153.1 MB. Free memory was 128.8 MB in the beginning and 119.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.13 ms. Allocated memory is still 153.1 MB. Free memory was 119.5 MB in the beginning and 118.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 489.43 ms. Allocated memory is still 153.1 MB. Free memory was 118.0 MB in the beginning and 134.8 MB in the end (delta: -16.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11170.07 ms. Allocated memory was 153.1 MB in the beginning and 268.4 MB in the end (delta: 115.3 MB). Free memory was 134.3 MB in the beginning and 119.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 130.1 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 = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=5, \result=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L39] int result = fibo1(x); VAL [fibo1(x)=5, result=5, x=5] [L40] COND TRUE result == 5 VAL [result=5, x=5] [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_5-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: 10.9s, OverallIterations: 12, TraceHistogramMax: 8, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 560 SDtfs, 804 SDslu, 919 SDs, 0 SdLazy, 2515 SolverSat, 332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 84 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 674 ConstructedInterpolants, 0 QuantifiedInterpolants, 101434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 281/416 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...