/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/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:25:48,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:25:48,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:25:48,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:25:48,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:25:48,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:25:48,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:25:48,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:25:48,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:25:48,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:25:48,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:25:48,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:25:48,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:25:48,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:25:48,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:25:48,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:25:48,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:25:48,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:25:48,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:25:48,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:25:48,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:25:48,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:25:48,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:25:48,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:25:48,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:25:48,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:25:48,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:25:48,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:25:48,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:25:48,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:25:48,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:25:48,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:25:48,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:25:48,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:25:48,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:25:48,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:25:48,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:25:48,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:25:48,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:25:48,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:25:48,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:25:48,474 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:25:48,494 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:25:48,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:25:48,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:25:48,496 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:25:48,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:25:48,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:25:48,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:25:48,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:25:48,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:25:48,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:25:48,498 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:25:48,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:25:48,498 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:25:48,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:25:48,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:25:48,499 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:25:48,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:25:48,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:25:48,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:25:48,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:25:48,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:25:48,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:25:48,501 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:25:48,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:25:48,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:25:48,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:25:48,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:25:48,930 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:25:48,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-11-07 00:25:49,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b582cce/de3b551cd3d24c42af909a54d85fe559/FLAGe7d878bf6 [2020-11-07 00:25:49,735 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:25:49,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-11-07 00:25:49,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b582cce/de3b551cd3d24c42af909a54d85fe559/FLAGe7d878bf6 [2020-11-07 00:25:50,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b582cce/de3b551cd3d24c42af909a54d85fe559 [2020-11-07 00:25:50,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:25:50,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:25:50,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:50,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:25:50,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:25:50,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b10ddb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50, skipping insertion in model container [2020-11-07 00:25:50,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:25:50,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:25:50,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:50,382 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:25:50,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:50,414 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:25:50,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50 WrapperNode [2020-11-07 00:25:50,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:50,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:25:50,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:25:50,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:25:50,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (1/1) ... [2020-11-07 00:25:50,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:25:50,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:25:50,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:25:50,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:25:50,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (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:25:50,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:25:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:25:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:25:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-07 00:25:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:25:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:25:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:25:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:25:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:25:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:25:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-07 00:25:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:25:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:25:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:25:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:25:50,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:25:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:25:50,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:25:50,773 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:25:50,774 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:25:50,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:50 BoogieIcfgContainer [2020-11-07 00:25:50,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:25:50,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:25:50,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:25:50,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:25:50,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:25:50" (1/3) ... [2020-11-07 00:25:50,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f600c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:50, skipping insertion in model container [2020-11-07 00:25:50,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:50" (2/3) ... [2020-11-07 00:25:50,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f600c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:50, skipping insertion in model container [2020-11-07 00:25:50,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:50" (3/3) ... [2020-11-07 00:25:50,785 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-11-07 00:25:50,804 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:25:50,808 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:25:50,824 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:25:50,853 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:25:50,853 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:25:50,854 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:25:50,854 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:25:50,854 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:25:50,854 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:25:50,854 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:25:50,854 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:25:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-11-07 00:25:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:25:50,884 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:50,885 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, 1] [2020-11-07 00:25:50,885 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:50,896 INFO L82 PathProgramCache]: Analyzing trace with hash 496375619, now seen corresponding path program 1 times [2020-11-07 00:25:50,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:50,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796945675] [2020-11-07 00:25:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:51,016 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,288 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:25:51,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796945675] [2020-11-07 00:25:51,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:51,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:25:51,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986471178] [2020-11-07 00:25:51,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:25:51,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:25:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:25:51,318 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 6 states. [2020-11-07 00:25:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:51,737 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-11-07 00:25:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:25:51,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:25:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:51,752 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:25:51,752 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:25:51,758 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:25:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:25:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:25:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:25:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:25:51,853 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2020-11-07 00:25:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:51,855 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:25:51,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:25:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:25:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 00:25:51,860 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:51,861 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, 1, 1] [2020-11-07 00:25:51,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:25:51,861 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1977921721, now seen corresponding path program 1 times [2020-11-07 00:25:51,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:51,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2135796053] [2020-11-07 00:25:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:51,876 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,036 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:25:52,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2135796053] [2020-11-07 00:25:52,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:52,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:25:52,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753378680] [2020-11-07 00:25:52,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:25:52,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:52,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:25:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:25:52,040 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2020-11-07 00:25:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:52,293 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-11-07 00:25:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:25:52,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-07 00:25:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:52,296 INFO L225 Difference]: With dead ends: 48 [2020-11-07 00:25:52,297 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 00:25:52,298 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:25:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 00:25:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-11-07 00:25:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:25:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:25:52,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2020-11-07 00:25:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:52,323 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:25:52,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:25:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:25:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 00:25:52,326 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:52,326 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:52,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:25:52,327 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash -788452534, now seen corresponding path program 1 times [2020-11-07 00:25:52,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:52,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236840495] [2020-11-07 00:25:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:52,331 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:25:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 00:25:52,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236840495] [2020-11-07 00:25:52,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:52,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:52,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242021944] [2020-11-07 00:25:52,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:52,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:52,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:52,491 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 00:25:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:52,745 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-11-07 00:25:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:25:52,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-11-07 00:25:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:52,747 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:25:52,747 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 00:25:52,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:25:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 00:25:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-11-07 00:25:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-07 00:25:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-11-07 00:25:52,761 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 44 [2020-11-07 00:25:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:52,762 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-11-07 00:25:52,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-11-07 00:25:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:25:52,764 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:52,764 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:52,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:25:52,764 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1354967602, now seen corresponding path program 1 times [2020-11-07 00:25:52,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:52,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982729132] [2020-11-07 00:25:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:52,768 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:25:52,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982729132] [2020-11-07 00:25:52,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:52,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:52,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938635552] [2020-11-07 00:25:52,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:52,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:52,932 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-11-07 00:25:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:53,273 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2020-11-07 00:25:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:53,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-07 00:25:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:53,276 INFO L225 Difference]: With dead ends: 68 [2020-11-07 00:25:53,276 INFO L226 Difference]: Without dead ends: 61 [2020-11-07 00:25:53,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:25:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-07 00:25:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-07 00:25:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:25:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-11-07 00:25:53,297 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 45 [2020-11-07 00:25:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:53,297 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-11-07 00:25:53,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-11-07 00:25:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 00:25:53,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:53,301 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:53,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:25:53,301 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2028047931, now seen corresponding path program 2 times [2020-11-07 00:25:53,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:53,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678861335] [2020-11-07 00:25:53,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:53,305 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:25:53,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678861335] [2020-11-07 00:25:53,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:53,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:53,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008564034] [2020-11-07 00:25:53,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:53,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:53,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:53,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:53,468 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2020-11-07 00:25:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:53,879 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2020-11-07 00:25:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:53,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-11-07 00:25:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:53,882 INFO L225 Difference]: With dead ends: 120 [2020-11-07 00:25:53,883 INFO L226 Difference]: Without dead ends: 75 [2020-11-07 00:25:53,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:25:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-07 00:25:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2020-11-07 00:25:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 00:25:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2020-11-07 00:25:53,905 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 62 [2020-11-07 00:25:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:53,906 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2020-11-07 00:25:53,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-11-07 00:25:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:25:53,909 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:53,909 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:53,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:25:53,909 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash -64263789, now seen corresponding path program 3 times [2020-11-07 00:25:53,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:53,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510180512] [2020-11-07 00:25:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:53,913 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-07 00:25:54,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510180512] [2020-11-07 00:25:54,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:54,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:54,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120806977] [2020-11-07 00:25:54,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:54,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:54,107 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 8 states. [2020-11-07 00:25:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:54,666 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2020-11-07 00:25:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:25:54,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-11-07 00:25:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:54,671 INFO L225 Difference]: With dead ends: 98 [2020-11-07 00:25:54,671 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 00:25:54,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:25:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 00:25:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2020-11-07 00:25:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-07 00:25:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2020-11-07 00:25:54,720 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 63 [2020-11-07 00:25:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:54,721 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2020-11-07 00:25:54,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2020-11-07 00:25:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 00:25:54,724 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:54,725 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:54,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:25:54,725 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:54,726 INFO L82 PathProgramCache]: Analyzing trace with hash -143796757, now seen corresponding path program 4 times [2020-11-07 00:25:54,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:54,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [108530483] [2020-11-07 00:25:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:54,729 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:54,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-07 00:25:55,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [108530483] [2020-11-07 00:25:55,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:55,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:25:55,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202166523] [2020-11-07 00:25:55,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:25:55,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:25:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:25:55,082 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 9 states. [2020-11-07 00:25:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:55,720 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2020-11-07 00:25:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:25:55,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 00:25:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:55,726 INFO L225 Difference]: With dead ends: 148 [2020-11-07 00:25:55,728 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 00:25:55,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:25:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 00:25:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2020-11-07 00:25:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 00:25:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2020-11-07 00:25:55,820 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 134 [2020-11-07 00:25:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:55,822 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2020-11-07 00:25:55,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:25:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2020-11-07 00:25:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 00:25:55,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:55,836 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:55,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:25:55,837 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:55,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash 91119029, now seen corresponding path program 5 times [2020-11-07 00:25:55,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:55,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279102974] [2020-11-07 00:25:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:55,844 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:25:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:25:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2020-11-07 00:25:56,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279102974] [2020-11-07 00:25:56,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:56,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:25:56,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761613221] [2020-11-07 00:25:56,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:25:56,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:56,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:25:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:25:56,444 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 10 states. [2020-11-07 00:25:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:57,253 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2020-11-07 00:25:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:25:57,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 204 [2020-11-07 00:25:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:57,261 INFO L225 Difference]: With dead ends: 242 [2020-11-07 00:25:57,261 INFO L226 Difference]: Without dead ends: 235 [2020-11-07 00:25:57,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:25:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-07 00:25:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2020-11-07 00:25:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-11-07 00:25:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2020-11-07 00:25:57,345 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 204 [2020-11-07 00:25:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:57,346 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2020-11-07 00:25:57,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:25:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2020-11-07 00:25:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-11-07 00:25:57,354 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:57,354 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:57,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:25:57,355 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash -108285303, now seen corresponding path program 6 times [2020-11-07 00:25:57,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:57,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890769730] [2020-11-07 00:25:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:57,364 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:25:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:25:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:25:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:57,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 64 proven. 137 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2020-11-07 00:25:58,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1890769730] [2020-11-07 00:25:58,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:58,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:25:58,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882599420] [2020-11-07 00:25:58,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:25:58,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:25:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:25:58,135 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 16 states. [2020-11-07 00:26:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:00,291 INFO L93 Difference]: Finished difference Result 332 states and 547 transitions. [2020-11-07 00:26:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:26:00,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 274 [2020-11-07 00:26:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:00,297 INFO L225 Difference]: With dead ends: 332 [2020-11-07 00:26:00,297 INFO L226 Difference]: Without dead ends: 126 [2020-11-07 00:26:00,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 00:26:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-07 00:26:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2020-11-07 00:26:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 00:26:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2020-11-07 00:26:00,322 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 274 [2020-11-07 00:26:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:00,322 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2020-11-07 00:26:00,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:26:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2020-11-07 00:26:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2020-11-07 00:26:00,330 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:00,330 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 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:26:00,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:26:00,330 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:00,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1154543623, now seen corresponding path program 7 times [2020-11-07 00:26:00,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:00,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674772350] [2020-11-07 00:26:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:00,335 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:26:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:00,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:26:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2020-11-07 00:26:01,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674772350] [2020-11-07 00:26:01,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:01,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:26:01,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107248903] [2020-11-07 00:26:01,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:26:01,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:26:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:26:01,272 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand 12 states. [2020-11-07 00:26:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:02,383 INFO L93 Difference]: Finished difference Result 360 states and 492 transitions. [2020-11-07 00:26:02,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:26:02,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 380 [2020-11-07 00:26:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:02,389 INFO L225 Difference]: With dead ends: 360 [2020-11-07 00:26:02,389 INFO L226 Difference]: Without dead ends: 353 [2020-11-07 00:26:02,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2020-11-07 00:26:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-11-07 00:26:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 323. [2020-11-07 00:26:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-07 00:26:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 446 transitions. [2020-11-07 00:26:02,462 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 446 transitions. Word has length 380 [2020-11-07 00:26:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:02,463 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 446 transitions. [2020-11-07 00:26:02,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:26:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 446 transitions. [2020-11-07 00:26:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2020-11-07 00:26:02,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:02,489 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 26, 26, 16, 16, 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:26:02,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:26:02,489 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1198075578, now seen corresponding path program 8 times [2020-11-07 00:26:02,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:02,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292353986] [2020-11-07 00:26:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:02,504 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:02,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:02,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:26:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:26:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 00:26:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:26:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-11-07 00:26:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:04,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4357 backedges. 390 proven. 505 refuted. 0 times theorem prover too weak. 3462 trivial. 0 not checked. [2020-11-07 00:26:05,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292353986] [2020-11-07 00:26:05,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:05,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:26:05,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739267812] [2020-11-07 00:26:05,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:26:05,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:26:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:26:05,450 INFO L87 Difference]: Start difference. First operand 323 states and 446 transitions. Second operand 18 states. [2020-11-07 00:26:08,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:08,616 INFO L93 Difference]: Finished difference Result 483 states and 756 transitions. [2020-11-07 00:26:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-07 00:26:08,616 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 750 [2020-11-07 00:26:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:08,623 INFO L225 Difference]: With dead ends: 483 [2020-11-07 00:26:08,624 INFO L226 Difference]: Without dead ends: 176 [2020-11-07 00:26:08,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=734, Invalid=2572, Unknown=0, NotChecked=0, Total=3306 [2020-11-07 00:26:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-07 00:26:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 151. [2020-11-07 00:26:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-07 00:26:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 200 transitions. [2020-11-07 00:26:08,661 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 200 transitions. Word has length 750 [2020-11-07 00:26:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:08,665 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 200 transitions. [2020-11-07 00:26:08,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:26:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 200 transitions. [2020-11-07 00:26:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2020-11-07 00:26:08,670 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:08,671 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 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:26:08,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:26:08,671 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:08,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1341419694, now seen corresponding path program 9 times [2020-11-07 00:26:08,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:08,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511251644] [2020-11-07 00:26:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:08,680 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:26:08,781 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:26:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:26:08,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:26:09,253 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:26:09,253 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:26:09,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:26:09,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:26:09 BoogieIcfgContainer [2020-11-07 00:26:09,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:26:09,319 INFO L168 Benchmark]: Toolchain (without parser) took 19204.74 ms. Allocated memory was 151.0 MB in the beginning and 549.5 MB in the end (delta: 398.5 MB). Free memory was 128.2 MB in the beginning and 451.2 MB in the end (delta: -323.0 MB). Peak memory consumption was 76.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:09,320 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 125.2 MB in the end (delta: 96.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:26:09,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.77 ms. Allocated memory is still 151.0 MB. Free memory was 127.6 MB in the beginning and 118.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:09,321 INFO L168 Benchmark]: Boogie Preprocessor took 31.22 ms. Allocated memory is still 151.0 MB. Free memory was 118.5 MB in the beginning and 117.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:09,322 INFO L168 Benchmark]: RCFGBuilder took 328.10 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 134.9 MB in the end (delta: -17.9 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:09,323 INFO L168 Benchmark]: TraceAbstraction took 18538.86 ms. Allocated memory was 151.0 MB in the beginning and 549.5 MB in the end (delta: 398.5 MB). Free memory was 134.5 MB in the beginning and 451.2 MB in the end (delta: -316.7 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:09,326 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.20 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 125.2 MB in the end (delta: 96.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 292.77 ms. Allocated memory is still 151.0 MB. Free memory was 127.6 MB in the beginning and 118.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.22 ms. Allocated memory is still 151.0 MB. Free memory was 118.5 MB in the beginning and 117.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 328.10 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 134.9 MB in the end (delta: -17.9 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18538.86 ms. Allocated memory was 151.0 MB in the beginning and 549.5 MB in the end (delta: 398.5 MB). Free memory was 134.5 MB in the beginning and 451.2 MB in the end (delta: -316.7 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND FALSE !(n < 1) [L19] COND FALSE !(n == 1) [L22] CALL, EXPR fibonacci(n-1) [L17] COND FALSE !(n < 1) [L19] COND TRUE n == 1 [L20] return 1; [L22] RET, EXPR fibonacci(n-1) [L22] CALL, EXPR fibonacci(n-2) [L17] COND TRUE n < 1 [L18] return 0; [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] CALL reach_error() [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.4s, OverallIterations: 12, TraceHistogramMax: 83, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 472 SDtfs, 1186 SDslu, 690 SDs, 0 SdLazy, 2207 SolverSat, 757 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 119 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...