/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:39:21,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:39:21,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:39:21,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:39:21,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:39:21,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:39:21,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:39:21,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:39:21,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:39:21,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:39:21,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:39:21,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:39:21,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:39:21,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:39:21,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:39:21,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:39:21,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:39:21,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:39:21,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:39:21,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:39:21,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:39:21,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:39:21,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:39:21,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:39:21,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:39:21,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:39:21,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:39:21,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:39:21,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:39:21,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:39:21,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:39:21,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:39:21,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:39:21,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:39:21,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:39:21,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:39:21,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:39:21,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:39:21,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:39:21,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:39:21,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:39:21,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:39:21,616 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:39:21,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:39:21,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:39:21,623 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:39:21,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:39:21,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:39:21,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:39:21,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:39:21,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:39:21,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:39:21,626 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:39:21,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:39:21,626 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:39:21,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:39:21,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:39:21,627 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:39:21,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:39:21,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:39:21,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:39:21,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:39:21,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:39:21,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:39:21,629 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:39:22,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:39:22,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:39:22,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:39:22,120 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:39:22,120 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:39:22,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-11-07 00:39:22,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed2a673a/c69524dd1d0740288fe075017ec0b442/FLAG77d2f4541 [2020-11-07 00:39:22,852 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:39:22,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-11-07 00:39:22,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed2a673a/c69524dd1d0740288fe075017ec0b442/FLAG77d2f4541 [2020-11-07 00:39:23,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed2a673a/c69524dd1d0740288fe075017ec0b442 [2020-11-07 00:39:23,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:39:23,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:39:23,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:39:23,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:39:23,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:39:23,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e81660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23, skipping insertion in model container [2020-11-07 00:39:23,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:39:23,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:39:23,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:39:23,500 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:39:23,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:39:23,535 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:39:23,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23 WrapperNode [2020-11-07 00:39:23,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:39:23,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:39:23,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:39:23,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:39:23,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... [2020-11-07 00:39:23,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:39:23,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:39:23,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:39:23,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:39:23,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:39:23,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:39:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:39:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:39:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 00:39:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 00:39:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:39:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:39:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:39:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:39:23,659 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:39:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:39:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 00:39:23,660 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 00:39:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:39:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:39:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:39:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:39:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:39:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:39:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:39:23,965 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:39:23,965 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:39:23,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:39:23 BoogieIcfgContainer [2020-11-07 00:39:23,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:39:24,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:39:24,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:39:24,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:39:24,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:39:23" (1/3) ... [2020-11-07 00:39:24,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9f7f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:39:24, skipping insertion in model container [2020-11-07 00:39:24,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:39:23" (2/3) ... [2020-11-07 00:39:24,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9f7f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:39:24, skipping insertion in model container [2020-11-07 00:39:24,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:39:23" (3/3) ... [2020-11-07 00:39:24,023 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-11-07 00:39:24,044 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:39:24,049 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:39:24,066 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:39:24,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:39:24,115 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:39:24,115 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:39:24,115 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:39:24,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:39:24,115 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:39:24,116 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:39:24,116 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:39:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 00:39:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:39:24,184 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:24,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:24,189 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 00:39:24,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:24,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199481726] [2020-11-07 00:39:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:24,305 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:24,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:24,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:39:24,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199481726] [2020-11-07 00:39:24,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:24,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:39:24,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382597418] [2020-11-07 00:39:24,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:39:24,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:24,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:39:24,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:39:24,759 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 00:39:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:25,222 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-11-07 00:39:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:39:25,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:39:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:25,235 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:39:25,235 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 00:39:25,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:39:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 00:39:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 00:39:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:39:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:39:25,302 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 00:39:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:25,303 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:39:25,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:39:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:39:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:39:25,306 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:25,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:25,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:39:25,307 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:25,308 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 00:39:25,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:25,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989973537] [2020-11-07 00:39:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:25,312 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:39:25,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989973537] [2020-11-07 00:39:25,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:25,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:39:25,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307595500] [2020-11-07 00:39:25,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:39:25,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:39:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:39:25,481 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 00:39:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:25,752 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:39:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:39:25,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:39:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:25,755 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:39:25,755 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:39:25,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:39:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:39:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:39:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:39:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 00:39:25,774 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 00:39:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:25,774 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 00:39:25,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:39:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 00:39:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:39:25,777 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:25,777 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:25,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:39:25,777 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 00:39:25,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:25,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2137360017] [2020-11-07 00:39:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:25,782 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:39:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:39:25,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2137360017] [2020-11-07 00:39:25,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:25,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:39:25,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922760585] [2020-11-07 00:39:25,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:39:25,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:25,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:39:25,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:39:25,965 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 00:39:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:26,316 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 00:39:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:39:26,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:39:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:26,319 INFO L225 Difference]: With dead ends: 92 [2020-11-07 00:39:26,320 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 00:39:26,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 00:39:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 00:39:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:39:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:39:26,338 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 00:39:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:26,338 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:39:26,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:39:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:39:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:39:26,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:26,341 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:26,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:39:26,341 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 00:39:26,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:26,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675595775] [2020-11-07 00:39:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:26,345 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:26,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:26,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:26,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:26,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 00:39:26,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675595775] [2020-11-07 00:39:26,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:26,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:39:26,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953675782] [2020-11-07 00:39:26,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:39:26,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:39:26,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:39:26,526 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 00:39:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:27,206 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 00:39:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:39:27,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 00:39:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:27,210 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:39:27,210 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:39:27,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:39:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:39:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 00:39:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 00:39:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 00:39:27,235 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 00:39:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:27,236 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 00:39:27,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:39:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 00:39:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 00:39:27,239 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:27,239 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:27,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:39:27,240 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:27,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 00:39:27,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:27,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [649044137] [2020-11-07 00:39:27,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:27,244 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:39:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 00:39:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:39:27,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [649044137] [2020-11-07 00:39:27,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:27,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:39:27,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722096812] [2020-11-07 00:39:27,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:39:27,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:27,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:39:27,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:39:27,414 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 00:39:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:27,839 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 00:39:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:39:27,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 00:39:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:27,842 INFO L225 Difference]: With dead ends: 140 [2020-11-07 00:39:27,842 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:39:27,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:39:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:39:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:39:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 00:39:27,869 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 00:39:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:27,869 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 00:39:27,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:39:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 00:39:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:39:27,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:27,874 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:27,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:39:27,874 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 00:39:27,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:27,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340019607] [2020-11-07 00:39:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:27,878 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:27,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:39:28,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340019607] [2020-11-07 00:39:28,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:28,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:39:28,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831701150] [2020-11-07 00:39:28,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:39:28,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:39:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:39:28,102 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 00:39:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:28,677 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 00:39:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:39:28,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:39:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:28,680 INFO L225 Difference]: With dead ends: 152 [2020-11-07 00:39:28,680 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:39:28,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:39:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:39:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 00:39:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 00:39:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 00:39:28,711 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 00:39:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:28,712 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 00:39:28,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:39:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 00:39:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:39:28,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:28,716 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:28,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:39:28,716 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 00:39:28,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:28,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588053662] [2020-11-07 00:39:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:28,720 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:39:28,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588053662] [2020-11-07 00:39:28,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:28,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:39:28,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157664019] [2020-11-07 00:39:28,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:39:28,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:39:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:39:28,906 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 00:39:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:29,675 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 00:39:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:39:29,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 00:39:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:29,683 INFO L225 Difference]: With dead ends: 128 [2020-11-07 00:39:29,683 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 00:39:29,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:39:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 00:39:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 00:39:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 00:39:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 00:39:29,748 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 00:39:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:29,751 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 00:39:29,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:39:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 00:39:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 00:39:29,759 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:29,760 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:29,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:39:29,760 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 00:39:29,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:29,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [820563006] [2020-11-07 00:39:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:29,767 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:29,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:29,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:29,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:29,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:29,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:29,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:29,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:30,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 00:39:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:39:30,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [820563006] [2020-11-07 00:39:30,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:30,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:39:30,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610642197] [2020-11-07 00:39:30,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:39:30,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:39:30,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:39:30,027 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 00:39:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:30,708 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 00:39:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:39:30,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 00:39:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:30,713 INFO L225 Difference]: With dead ends: 237 [2020-11-07 00:39:30,715 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 00:39:30,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:39:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 00:39:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 00:39:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:39:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 00:39:30,779 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 00:39:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:30,779 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 00:39:30,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:39:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 00:39:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 00:39:30,783 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:30,783 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:30,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:39:30,784 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:30,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 00:39:30,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:30,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1397766648] [2020-11-07 00:39:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:30,789 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:30,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:30,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:30,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:30,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:31,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:31,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:31,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:31,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 00:39:31,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1397766648] [2020-11-07 00:39:31,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:31,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:39:31,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737428147] [2020-11-07 00:39:31,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:39:31,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:39:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:31,092 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 11 states. [2020-11-07 00:39:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:32,011 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 00:39:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:39:32,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-11-07 00:39:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:32,018 INFO L225 Difference]: With dead ends: 267 [2020-11-07 00:39:32,018 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:39:32,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:39:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:39:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 00:39:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:39:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 00:39:32,055 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 00:39:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:32,055 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 00:39:32,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:39:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 00:39:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:39:32,059 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:32,059 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:32,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:39:32,059 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-11-07 00:39:32,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:32,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2056060378] [2020-11-07 00:39:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:32,063 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:39:32,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2056060378] [2020-11-07 00:39:32,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:32,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:39:32,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241360406] [2020-11-07 00:39:32,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:39:32,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:32,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:39:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:39:32,318 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 13 states. [2020-11-07 00:39:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:33,784 INFO L93 Difference]: Finished difference Result 278 states and 422 transitions. [2020-11-07 00:39:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:39:33,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-11-07 00:39:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:33,789 INFO L225 Difference]: With dead ends: 278 [2020-11-07 00:39:33,789 INFO L226 Difference]: Without dead ends: 147 [2020-11-07 00:39:33,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:39:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-07 00:39:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2020-11-07 00:39:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 00:39:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2020-11-07 00:39:33,825 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 97 [2020-11-07 00:39:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:33,826 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2020-11-07 00:39:33,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:39:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2020-11-07 00:39:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 00:39:33,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:33,828 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 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, 1, 1] [2020-11-07 00:39:33,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:39:33,828 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-11-07 00:39:33,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:33,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340857832] [2020-11-07 00:39:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:33,832 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:33,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:33,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:33,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:39:34,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340857832] [2020-11-07 00:39:34,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:34,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:39:34,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321758021] [2020-11-07 00:39:34,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:39:34,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:39:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:39:34,308 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand 18 states. [2020-11-07 00:39:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:36,642 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2020-11-07 00:39:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:39:36,643 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2020-11-07 00:39:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:36,646 INFO L225 Difference]: With dead ends: 185 [2020-11-07 00:39:36,646 INFO L226 Difference]: Without dead ends: 178 [2020-11-07 00:39:36,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 00:39:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-11-07 00:39:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 148. [2020-11-07 00:39:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-07 00:39:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2020-11-07 00:39:36,691 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 96 [2020-11-07 00:39:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:36,692 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2020-11-07 00:39:36,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:39:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2020-11-07 00:39:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:39:36,696 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:36,696 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 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] [2020-11-07 00:39:36,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:39:36,697 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1477616796, now seen corresponding path program 2 times [2020-11-07 00:39:36,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:36,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1035415691] [2020-11-07 00:39:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:36,701 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 00:39:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-07 00:39:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 00:39:36,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1035415691] [2020-11-07 00:39:36,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:36,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:39:36,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910340463] [2020-11-07 00:39:36,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:39:36,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:39:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:39:36,889 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand 8 states. [2020-11-07 00:39:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:37,473 INFO L93 Difference]: Finished difference Result 274 states and 371 transitions. [2020-11-07 00:39:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:39:37,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-11-07 00:39:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:37,476 INFO L225 Difference]: With dead ends: 274 [2020-11-07 00:39:37,476 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 00:39:37,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:39:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 00:39:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-07 00:39:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:39:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-11-07 00:39:37,522 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 97 [2020-11-07 00:39:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:37,522 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-11-07 00:39:37,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:39:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-11-07 00:39:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 00:39:37,524 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:37,525 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 00:39:37,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:39:37,525 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -443839068, now seen corresponding path program 3 times [2020-11-07 00:39:37,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:37,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [123379875] [2020-11-07 00:39:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:37,529 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-07 00:39:37,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [123379875] [2020-11-07 00:39:37,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:37,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:39:37,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152111963] [2020-11-07 00:39:37,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:39:37,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:39:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:39:37,877 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 13 states. [2020-11-07 00:39:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:39,344 INFO L93 Difference]: Finished difference Result 278 states and 366 transitions. [2020-11-07 00:39:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:39:39,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2020-11-07 00:39:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:39,349 INFO L225 Difference]: With dead ends: 278 [2020-11-07 00:39:39,349 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 00:39:39,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:39:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 00:39:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2020-11-07 00:39:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 00:39:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2020-11-07 00:39:39,382 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 114 [2020-11-07 00:39:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:39,383 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2020-11-07 00:39:39,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:39:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2020-11-07 00:39:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 00:39:39,385 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:39,385 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 00:39:39,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:39:39,386 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1084912860, now seen corresponding path program 3 times [2020-11-07 00:39:39,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:39,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1086426096] [2020-11-07 00:39:39,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:39,400 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 00:39:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-07 00:39:39,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1086426096] [2020-11-07 00:39:39,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:39,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:39:39,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981452888] [2020-11-07 00:39:39,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:39:39,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:39,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:39:39,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:39,676 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 11 states. [2020-11-07 00:39:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:40,498 INFO L93 Difference]: Finished difference Result 208 states and 263 transitions. [2020-11-07 00:39:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:39:40,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2020-11-07 00:39:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:40,501 INFO L225 Difference]: With dead ends: 208 [2020-11-07 00:39:40,501 INFO L226 Difference]: Without dead ends: 103 [2020-11-07 00:39:40,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:39:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-07 00:39:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-11-07 00:39:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-07 00:39:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2020-11-07 00:39:40,524 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 114 [2020-11-07 00:39:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:40,524 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2020-11-07 00:39:40,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:39:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2020-11-07 00:39:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-07 00:39:40,528 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:40,528 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:40,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:39:40,528 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash -360460350, now seen corresponding path program 4 times [2020-11-07 00:39:40,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:40,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76571640] [2020-11-07 00:39:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:40,532 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 00:39:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:40,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 7 proven. 152 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2020-11-07 00:39:41,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76571640] [2020-11-07 00:39:41,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:41,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:39:41,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642782098] [2020-11-07 00:39:41,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:39:41,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:39:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:39:41,003 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 14 states. [2020-11-07 00:39:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:42,544 INFO L93 Difference]: Finished difference Result 225 states and 296 transitions. [2020-11-07 00:39:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:39:42,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 220 [2020-11-07 00:39:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:42,547 INFO L225 Difference]: With dead ends: 225 [2020-11-07 00:39:42,547 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 00:39:42,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2020-11-07 00:39:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 00:39:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-11-07 00:39:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 00:39:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2020-11-07 00:39:42,580 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 220 [2020-11-07 00:39:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:42,581 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2020-11-07 00:39:42,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:39:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2020-11-07 00:39:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-07 00:39:42,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:39:42,583 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:39:42,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:39:42,583 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:39:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:39:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1978690859, now seen corresponding path program 2 times [2020-11-07 00:39:42,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:39:42,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793786041] [2020-11-07 00:39:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:39:42,593 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:39:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:39:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:39:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:39:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:39:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:39:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:39:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:39:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:39:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 00:39:42,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793786041] [2020-11-07 00:39:42,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:39:42,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:39:42,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521566344] [2020-11-07 00:39:42,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:39:42,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:39:42,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:39:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:39:42,874 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 11 states. [2020-11-07 00:39:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:39:43,712 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2020-11-07 00:39:43,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:39:43,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2020-11-07 00:39:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:39:43,714 INFO L225 Difference]: With dead ends: 129 [2020-11-07 00:39:43,714 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:39:43,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:39:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:39:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:39:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:39:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:39:43,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2020-11-07 00:39:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:39:43,717 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:39:43,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:39:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:39:43,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:39:43,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:39:43,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:39:44,371 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2020-11-07 00:39:44,967 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-11-07 00:39:45,499 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2020-11-07 00:39:45,899 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2020-11-07 00:39:47,615 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2020-11-07 00:39:49,477 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2020-11-07 00:39:50,339 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 8 [2020-11-07 00:39:50,532 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 6 [2020-11-07 00:39:50,695 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 7 [2020-11-07 00:39:51,013 WARN L194 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 24 [2020-11-07 00:39:51,525 WARN L194 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 34 [2020-11-07 00:39:51,650 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 6 [2020-11-07 00:39:52,216 WARN L194 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 27 [2020-11-07 00:39:52,539 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 24 [2020-11-07 00:39:52,923 WARN L194 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 28 [2020-11-07 00:39:53,313 WARN L194 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 28 [2020-11-07 00:39:53,429 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 6 [2020-11-07 00:39:53,797 WARN L194 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2020-11-07 00:39:54,144 WARN L194 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2020-11-07 00:39:54,719 WARN L194 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 [2020-11-07 00:39:54,993 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2020-11-07 00:39:55,122 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 6 [2020-11-07 00:39:55,917 WARN L194 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 33 [2020-11-07 00:39:56,115 WARN L194 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 6 [2020-11-07 00:39:56,438 WARN L194 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2020-11-07 00:39:57,054 WARN L194 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 [2020-11-07 00:39:57,417 WARN L194 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2020-11-07 00:39:57,698 WARN L194 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 22 [2020-11-07 00:39:57,869 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 8 [2020-11-07 00:39:58,742 WARN L194 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 33 [2020-11-07 00:39:58,911 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,911 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,911 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,912 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,912 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,912 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,912 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:39:58,912 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:39:58,912 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:39:58,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:39:58,914 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-11-07 00:39:58,914 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 4 main_~x~0) [2020-11-07 00:39:58,914 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 4 main_~x~0) [2020-11-07 00:39:58,914 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-11-07 00:39:58,914 INFO L262 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0)) [2020-11-07 00:39:58,914 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-11-07 00:39:58,914 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-11-07 00:39:58,914 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (<= 3 |main_#t~ret11|)) [2020-11-07 00:39:58,915 INFO L262 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-11-07 00:39:58,915 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (<= 3 |main_#t~ret11|)) [2020-11-07 00:39:58,915 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (< 2 main_~result~0) (<= 3 |main_#t~ret11|)) [2020-11-07 00:39:58,915 INFO L269 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-11-07 00:39:58,915 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 00:39:58,915 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret9| 1) (<= 1 |fibo2_#t~ret9|)) (not (<= |fibo2_#in~n| 3))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-11-07 00:39:58,915 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1)) [2020-11-07 00:39:58,916 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret9| 1) (<= 1 |fibo2_#t~ret9|)) (not (<= |fibo2_#in~n| 3))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-11-07 00:39:58,916 INFO L262 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|)) [2020-11-07 00:39:58,916 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (let ((.cse1 (<= |fibo2_#t~ret9| 1)) (.cse3 (<= 1 |fibo2_#t~ret9|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse2 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 2 .cse0) (<= 3 fibo2_~n) .cse1 .cse2 (<= .cse0 2) .cse3) (and .cse1 (<= fibo2_~n 2) (<= .cse0 1) (< 1 fibo2_~n) .cse3 (<= 1 .cse0) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) .cse2))) (not (<= |fibo2_#in~n| 1))) [2020-11-07 00:39:58,916 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-11-07 00:39:58,916 INFO L262 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (and (let ((.cse1 (<= |fibo2_#t~ret9| 1)) (.cse3 (<= 1 |fibo2_#t~ret9|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse2 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 2 .cse0) (<= 3 fibo2_~n) .cse1 .cse2 (<= .cse0 2) .cse3) (and .cse1 (<= fibo2_~n 2) (<= .cse0 1) (< 1 fibo2_~n) .cse3 (<= 1 .cse0) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) .cse2))) (not (<= |fibo2_#in~n| 1))) [2020-11-07 00:39:58,916 INFO L262 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-11-07 00:39:58,917 INFO L262 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse4 (<= |fibo2_#t~ret9| 1)) (.cse5 (<= 1 |fibo2_#t~ret9|)) (.cse3 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (let ((.cse2 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse4 (<= fibo2_~n 2) (<= .cse3 1) (< 1 fibo2_~n) .cse5 (<= 1 .cse3) (<= |fibo2_#in~n| 2))) (.cse0 (<= |fibo2_#in~n| 3)) (.cse1 (= fibo2_~n |fibo2_#in~n|))) (and (or (and .cse0 (<= 2 |fibo2_#res|)) (and (<= 4 |fibo2_#in~n|) .cse1) .cse2) (or .cse2 (not .cse0) (and (<= 2 .cse3) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) .cse4 .cse1 (<= .cse3 2) .cse5)) (not (<= |fibo2_#in~n| 1))))) [2020-11-07 00:39:58,917 INFO L262 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= fibo2_~n 2) (< 1 fibo2_~n) .cse1))) (and (or .cse0 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (not (<= |fibo2_#in~n| 3))) (= fibo2_~n |fibo2_#in~n|) (or .cse0 (not .cse1))))) [2020-11-07 00:39:58,917 INFO L262 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (let ((.cse5 (<= 1 |fibo2_#in~n|)) (.cse6 (<= 1 |fibo2_#res|)) (.cse7 (<= |fibo2_#res| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and .cse6 .cse7 .cse2 (< 1 fibo2_~n) .cse4)) (.cse1 (and .cse5 .cse6 .cse7 .cse2 (<= |fibo2_#in~n| 1))) (.cse3 (<= |fibo2_#in~n| 0))) (and (or .cse0 .cse1 (and .cse2 .cse3) (not .cse4)) (or .cse0 .cse1 (and (<= 4 |fibo2_#in~n|) .cse2) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) .cse2) .cse3) (or .cse5 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)))))) [2020-11-07 00:39:58,917 INFO L262 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (let ((.cse5 (<= 1 |fibo2_#in~n|)) (.cse6 (<= 1 |fibo2_#res|)) (.cse7 (<= |fibo2_#res| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and .cse6 .cse7 .cse2 (< 1 fibo2_~n) .cse4)) (.cse1 (and .cse5 .cse6 .cse7 .cse2 (<= |fibo2_#in~n| 1))) (.cse3 (<= |fibo2_#in~n| 0))) (and (or .cse0 .cse1 (and .cse2 .cse3) (not .cse4)) (or .cse0 .cse1 (and (<= 4 |fibo2_#in~n|) .cse2) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) .cse2) .cse3) (or .cse5 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)))))) [2020-11-07 00:39:58,917 INFO L269 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-11-07 00:39:58,918 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:39:58,918 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3))) (and (or (not .cse0) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 .cse1) (and .cse1 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 |fibo1_#in~n|) .cse1))) (not (<= |fibo1_#in~n| 2)))) [2020-11-07 00:39:58,918 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-11-07 00:39:58,918 INFO L262 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3))) (and (or (not .cse0) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 .cse1) (and .cse1 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 |fibo1_#in~n|) .cse1))) (not (<= |fibo1_#in~n| 2)))) [2020-11-07 00:39:58,918 INFO L262 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (<= 1 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:39:58,919 INFO L262 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= .cse0 3) (<= 4 fibo1_~n) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) [2020-11-07 00:39:58,919 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 00:39:58,919 INFO L262 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= .cse0 3) (<= 4 fibo1_~n) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) [2020-11-07 00:39:58,919 INFO L262 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) .cse0) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse0) (and (<= |fibo1_#in~n| 1) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (or (<= |fibo1_#in~n| 0) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 00:39:58,919 INFO L262 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-11-07 00:39:58,919 INFO L262 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse3 (<= |fibo1_#in~n| 3))) (let ((.cse2 (and .cse3 (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) (< 1 fibo1_~n)))) (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= |fibo1_#res| 3) (<= .cse1 3) (<= 3 |fibo1_#res|) (<= 3 .cse1) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) .cse2)) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2)) (or (not .cse3) .cse2)))) [2020-11-07 00:39:58,920 INFO L262 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (and (or (not .cse0) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) .cse1)) (or .cse0 (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse1 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 |fibo1_#in~n|) .cse1)) (not (<= |fibo1_#in~n| 2)))) [2020-11-07 00:39:58,920 INFO L262 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) .cse0) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse0) (and (<= |fibo1_#in~n| 1) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (or (<= |fibo1_#in~n| 0) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 00:39:58,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:39:58 BoogieIcfgContainer [2020-11-07 00:39:58,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:39:58,943 INFO L168 Benchmark]: Toolchain (without parser) took 35727.20 ms. Allocated memory was 152.0 MB in the beginning and 412.1 MB in the end (delta: 260.0 MB). Free memory was 128.5 MB in the beginning and 355.5 MB in the end (delta: -227.0 MB). Peak memory consumption was 244.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:58,944 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 152.0 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:39:58,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.61 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 118.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:58,945 INFO L168 Benchmark]: Boogie Preprocessor took 34.11 ms. Allocated memory is still 152.0 MB. Free memory was 118.6 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:58,946 INFO L168 Benchmark]: RCFGBuilder took 395.76 ms. Allocated memory is still 152.0 MB. Free memory was 117.0 MB in the beginning and 101.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:58,946 INFO L168 Benchmark]: TraceAbstraction took 34933.53 ms. Allocated memory was 152.0 MB in the beginning and 412.1 MB in the end (delta: 260.0 MB). Free memory was 134.8 MB in the beginning and 355.5 MB in the end (delta: -220.7 MB). Peak memory consumption was 249.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:39:58,949 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.18 ms. Allocated memory is still 152.0 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 308.61 ms. Allocated memory is still 152.0 MB. Free memory was 127.9 MB in the beginning and 118.6 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.11 ms. Allocated memory is still 152.0 MB. Free memory was 118.6 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 395.76 ms. Allocated memory is still 152.0 MB. Free memory was 117.0 MB in the beginning and 101.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34933.53 ms. Allocated memory was 152.0 MB in the beginning and 412.1 MB in the end (delta: 260.0 MB). Free memory was 134.8 MB in the beginning and 355.5 MB in the end (delta: -220.7 MB). Peak memory consumption was 249.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: 4 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((((((1 <= \result && \result <= 1) && n == \old(n)) && 1 < n) && \old(n) <= 2) || ((((1 <= \old(n) && 1 <= \result) && \result <= 1) && n == \old(n)) && \old(n) <= 1)) || (n == \old(n) && \old(n) <= 0)) || !(\old(n) <= 2)) && ((((((((1 <= \result && \result <= 1) && n == \old(n)) && 1 < n) && \old(n) <= 2) || ((((1 <= \old(n) && 1 <= \result) && \result <= 1) && n == \old(n)) && \old(n) <= 1)) || (4 <= \old(n) && n == \old(n))) || ((\result <= 2 && 2 <= \result) && n == \old(n))) || \old(n) <= 0)) && (1 <= \old(n) || (\result <= 0 && 0 <= \result)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((((((\old(n) <= 3 && 3 <= n) && n == \old(n)) || ((\result <= 3 && 3 <= \result) && n == \old(n))) || (\old(n) <= 1 && n == \old(n))) || (5 <= \old(n) && n == \old(n))) && ((\old(n) <= 0 || (\result <= 1 && 1 <= \result)) || !(\old(n) <= 2))) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.6s, OverallIterations: 16, TraceHistogramMax: 13, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 818 SDtfs, 1382 SDslu, 1776 SDs, 0 SdLazy, 5169 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred 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, 16 MinimizatonAttempts, 115 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 2203 PreInvPairs, 3925 NumberOfFragments, 1165 HoareAnnotationTreeSize, 2203 FomulaSimplifications, 379480 FormulaSimplificationTreeSizeReduction, 6.4s HoareSimplificationTime, 57 FomulaSimplificationsInter, 57321 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...