/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 10:47:16,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 10:47:16,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 10:47:16,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 10:47:16,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 10:47:16,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 10:47:16,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 10:47:16,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 10:47:16,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 10:47:16,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 10:47:16,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 10:47:16,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 10:47:16,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 10:47:16,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 10:47:16,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 10:47:16,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 10:47:16,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 10:47:16,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 10:47:16,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 10:47:16,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 10:47:16,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 10:47:16,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 10:47:16,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 10:47:16,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 10:47:16,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 10:47:16,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 10:47:16,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 10:47:16,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 10:47:16,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 10:47:16,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 10:47:16,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 10:47:16,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 10:47:16,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 10:47:16,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 10:47:16,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 10:47:16,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 10:47:16,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 10:47:16,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 10:47:16,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 10:47:16,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 10:47:16,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 10:47:16,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 10:47:16,170 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 10:47:16,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 10:47:16,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 10:47:16,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 10:47:16,172 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 10:47:16,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 10:47:16,173 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 10:47:16,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 10:47:16,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 10:47:16,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 10:47:16,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 10:47:16,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 10:47:16,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 10:47:16,175 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 10:47:16,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 10:47:16,176 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 10:47:16,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 10:47:16,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 10:47:16,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 10:47:16,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 10:47:16,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 10:47:16,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 10:47:16,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 10:47:16,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 10:47:16,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 10:47:16,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 10:47:16,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:16,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 10:47:16,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 10:47:16,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 10:47:16,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 10:47:16,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 10:47:16,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 10:47:16,493 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 10:47:16,494 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 10:47:16,495 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-20 10:47:16,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1d46606/2b8973ebf319435cb262e76465bc9959/FLAG274e38a57 [2020-07-20 10:47:16,966 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 10:47:16,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-20 10:47:16,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1d46606/2b8973ebf319435cb262e76465bc9959/FLAG274e38a57 [2020-07-20 10:47:17,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1d46606/2b8973ebf319435cb262e76465bc9959 [2020-07-20 10:47:17,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 10:47:17,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 10:47:17,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 10:47:17,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 10:47:17,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 10:47:17,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1941cf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17, skipping insertion in model container [2020-07-20 10:47:17,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 10:47:17,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 10:47:17,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 10:47:17,618 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 10:47:17,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 10:47:17,655 INFO L208 MainTranslator]: Completed translation [2020-07-20 10:47:17,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17 WrapperNode [2020-07-20 10:47:17,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 10:47:17,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 10:47:17,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 10:47:17,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 10:47:17,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (1/1) ... [2020-07-20 10:47:17,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 10:47:17,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 10:47:17,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 10:47:17,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 10:47:17,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (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-07-20 10:47:17,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 10:47:17,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 10:47:17,901 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-20 10:47:17,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 10:47:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 10:47:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 10:47:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-20 10:47:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 10:47:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 10:47:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 10:47:18,200 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 10:47:18,201 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 10:47:18,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:47:18 BoogieIcfgContainer [2020-07-20 10:47:18,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 10:47:18,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 10:47:18,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 10:47:18,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 10:47:18,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:47:17" (1/3) ... [2020-07-20 10:47:18,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6061a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:47:18, skipping insertion in model container [2020-07-20 10:47:18,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:47:17" (2/3) ... [2020-07-20 10:47:18,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6061a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:47:18, skipping insertion in model container [2020-07-20 10:47:18,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:47:18" (3/3) ... [2020-07-20 10:47:18,234 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-20 10:47:18,263 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 10:47:18,280 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 10:47:18,293 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 10:47:18,316 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 10:47:18,317 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 10:47:18,317 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 10:47:18,317 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 10:47:18,317 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 10:47:18,317 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 10:47:18,317 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 10:47:18,318 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 10:47:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-20 10:47:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 10:47:18,344 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:18,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:18,345 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:18,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-20 10:47:18,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:18,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [503471045] [2020-07-20 10:47:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:18,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 10:47:18,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 10:47:18,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 10:47:18,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [503471045] [2020-07-20 10:47:18,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 10:47:18,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 10:47:18,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858395027] [2020-07-20 10:47:18,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 10:47:18,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 10:47:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 10:47:18,532 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-20 10:47:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:18,634 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 10:47:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 10:47:18,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 10:47:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:18,648 INFO L225 Difference]: With dead ends: 35 [2020-07-20 10:47:18,648 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 10:47:18,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 10:47:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 10:47:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 10:47:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 10:47:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 10:47:18,698 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 10:47:18,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:18,699 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 10:47:18,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 10:47:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 10:47:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 10:47:18,701 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:18,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:18,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:18,914 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-20 10:47:18,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:18,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112007549] [2020-07-20 10:47:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:18,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 10:47:18,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 10:47:18,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 10:47:18,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112007549] [2020-07-20 10:47:18,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 10:47:18,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 10:47:18,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400060452] [2020-07-20 10:47:18,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 10:47:18,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 10:47:18,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 10:47:18,999 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 10:47:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:19,066 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 10:47:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 10:47:19,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 10:47:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:19,069 INFO L225 Difference]: With dead ends: 27 [2020-07-20 10:47:19,069 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 10:47:19,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 10:47:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 10:47:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 10:47:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 10:47:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 10:47:19,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 10:47:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:19,079 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 10:47:19,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 10:47:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 10:47:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 10:47:19,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:19,081 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] [2020-07-20 10:47:19,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:19,297 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-20 10:47:19,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:19,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242328877] [2020-07-20 10:47:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:19,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 10:47:19,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 10:47:19,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:19,568 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:19,572 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 10:47:19,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242328877] [2020-07-20 10:47:19,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:19,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-07-20 10:47:19,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915705033] [2020-07-20 10:47:19,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 10:47:19,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 10:47:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-20 10:47:19,629 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2020-07-20 10:47:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:19,757 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2020-07-20 10:47:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 10:47:19,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-20 10:47:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:19,761 INFO L225 Difference]: With dead ends: 39 [2020-07-20 10:47:19,761 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 10:47:19,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-20 10:47:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 10:47:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-20 10:47:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 10:47:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 10:47:19,773 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 26 [2020-07-20 10:47:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:19,774 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 10:47:19,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 10:47:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 10:47:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-20 10:47:19,777 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:19,778 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:19,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:19,991 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:19,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1708682098, now seen corresponding path program 1 times [2020-07-20 10:47:19,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:19,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067232707] [2020-07-20 10:47:19,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:20,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 10:47:20,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-07-20 10:47:20,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:20,469 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:20,470 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:20,526 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-07-20 10:47:20,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067232707] [2020-07-20 10:47:20,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:20,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2020-07-20 10:47:20,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724065805] [2020-07-20 10:47:20,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 10:47:20,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 10:47:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-20 10:47:20,583 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 12 states. [2020-07-20 10:47:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:20,781 INFO L93 Difference]: Finished difference Result 57 states and 114 transitions. [2020-07-20 10:47:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 10:47:20,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2020-07-20 10:47:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:20,785 INFO L225 Difference]: With dead ends: 57 [2020-07-20 10:47:20,785 INFO L226 Difference]: Without dead ends: 51 [2020-07-20 10:47:20,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-20 10:47:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-20 10:47:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2020-07-20 10:47:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 10:47:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 10:47:20,801 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 67 [2020-07-20 10:47:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:20,802 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 10:47:20,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 10:47:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 10:47:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-20 10:47:20,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:20,805 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:21,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:21,021 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:21,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:21,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1655086695, now seen corresponding path program 2 times [2020-07-20 10:47:21,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:21,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5550996] [2020-07-20 10:47:21,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:21,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 10:47:21,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 69 proven. 379 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2020-07-20 10:47:21,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:21,975 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:22,160 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:22,252 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:22,253 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:22,310 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:22,312 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2020-07-20 10:47:22,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5550996] [2020-07-20 10:47:22,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:22,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2020-07-20 10:47:22,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835407634] [2020-07-20 10:47:22,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 10:47:22,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:22,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 10:47:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-07-20 10:47:22,369 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 16 states. [2020-07-20 10:47:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:22,741 INFO L93 Difference]: Finished difference Result 72 states and 183 transitions. [2020-07-20 10:47:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 10:47:22,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2020-07-20 10:47:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:22,752 INFO L225 Difference]: With dead ends: 72 [2020-07-20 10:47:22,752 INFO L226 Difference]: Without dead ends: 66 [2020-07-20 10:47:22,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 289 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2020-07-20 10:47:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-20 10:47:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-20 10:47:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 10:47:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 10:47:22,775 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 156 [2020-07-20 10:47:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:22,776 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 10:47:22,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 10:47:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 10:47:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-20 10:47:22,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:22,781 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 31, 19, 19, 19, 19, 19, 19, 19, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:22,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:22,996 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash -700634023, now seen corresponding path program 2 times [2020-07-20 10:47:22,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:22,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246930252] [2020-07-20 10:47:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:23,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 10:47:23,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 142 proven. 942 refuted. 0 times theorem prover too weak. 3029 trivial. 0 not checked. [2020-07-20 10:47:23,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:24,378 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:24,676 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:24,830 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:24,920 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:24,961 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:24,961 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 142 proven. 982 refuted. 0 times theorem prover too weak. 2989 trivial. 0 not checked. [2020-07-20 10:47:25,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246930252] [2020-07-20 10:47:25,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:25,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2020-07-20 10:47:25,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621744561] [2020-07-20 10:47:25,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 10:47:25,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 10:47:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-07-20 10:47:25,060 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 18 states. [2020-07-20 10:47:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:25,410 INFO L93 Difference]: Finished difference Result 87 states and 270 transitions. [2020-07-20 10:47:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 10:47:25,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 272 [2020-07-20 10:47:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:25,416 INFO L225 Difference]: With dead ends: 87 [2020-07-20 10:47:25,416 INFO L226 Difference]: Without dead ends: 81 [2020-07-20 10:47:25,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 516 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-07-20 10:47:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-20 10:47:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2020-07-20 10:47:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 10:47:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 10:47:25,438 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 272 [2020-07-20 10:47:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:25,440 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 10:47:25,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 10:47:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 10:47:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2020-07-20 10:47:25,462 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:25,462 INFO L422 BasicCegarLoop]: trace histogram [133, 133, 67, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:25,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:25,676 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1816565800, now seen corresponding path program 3 times [2020-07-20 10:47:25,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:25,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345120003] [2020-07-20 10:47:25,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:25,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 10:47:26,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 764 proven. 4420 refuted. 0 times theorem prover too weak. 40653 trivial. 0 not checked. [2020-07-20 10:47:26,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:29,522 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:30,577 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,095 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,449 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,450 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,645 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,647 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,730 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,731 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,778 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:31,780 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 764 proven. 4490 refuted. 0 times theorem prover too weak. 40583 trivial. 0 not checked. [2020-07-20 10:47:32,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345120003] [2020-07-20 10:47:32,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:32,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 20 [2020-07-20 10:47:32,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832903439] [2020-07-20 10:47:32,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-20 10:47:32,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:32,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-20 10:47:32,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-20 10:47:32,128 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 20 states. [2020-07-20 10:47:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:32,520 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-20 10:47:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 10:47:32,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 871 [2020-07-20 10:47:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:32,529 INFO L225 Difference]: With dead ends: 92 [2020-07-20 10:47:32,529 INFO L226 Difference]: Without dead ends: 88 [2020-07-20 10:47:32,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1750 GetRequests, 1707 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2020-07-20 10:47:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-20 10:47:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-20 10:47:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 10:47:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 10:47:32,549 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 871 [2020-07-20 10:47:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:32,552 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 10:47:32,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-20 10:47:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 10:47:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2020-07-20 10:47:32,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:32,596 INFO L422 BasicCegarLoop]: trace histogram [155, 155, 130, 77, 77, 77, 77, 77, 77, 77, 53, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:32,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:32,810 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash -44594725, now seen corresponding path program 3 times [2020-07-20 10:47:32,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:32,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573914807] [2020-07-20 10:47:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:33,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 2372 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 10:47:33,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 67829 backedges. 10367 proven. 122 refuted. 0 times theorem prover too weak. 57340 trivial. 0 not checked. [2020-07-20 10:47:33,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:38,002 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:38,053 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:38,054 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:38,277 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:38,278 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:38,321 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:38,322 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 67829 backedges. 1020 proven. 6126 refuted. 0 times theorem prover too weak. 60683 trivial. 0 not checked. [2020-07-20 10:47:38,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573914807] [2020-07-20 10:47:38,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:38,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2020-07-20 10:47:38,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872324306] [2020-07-20 10:47:38,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 10:47:38,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 10:47:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-20 10:47:38,747 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 17 states. [2020-07-20 10:47:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:39,139 INFO L93 Difference]: Finished difference Result 114 states and 313 transitions. [2020-07-20 10:47:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 10:47:39,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1067 [2020-07-20 10:47:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:39,141 INFO L225 Difference]: With dead ends: 114 [2020-07-20 10:47:39,141 INFO L226 Difference]: Without dead ends: 64 [2020-07-20 10:47:39,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2145 GetRequests, 2105 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2020-07-20 10:47:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-20 10:47:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-20 10:47:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-20 10:47:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2020-07-20 10:47:39,156 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 1067 [2020-07-20 10:47:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:39,157 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2020-07-20 10:47:39,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 10:47:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2020-07-20 10:47:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2020-07-20 10:47:39,162 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:39,163 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 68, 41, 41, 41, 41, 41, 41, 41, 27, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:39,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:39,378 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1053586695, now seen corresponding path program 4 times [2020-07-20 10:47:39,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:39,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390553816] [2020-07-20 10:47:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:39,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 10:47:39,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 19170 backedges. 6851 proven. 279 refuted. 0 times theorem prover too weak. 12040 trivial. 0 not checked. [2020-07-20 10:47:39,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:42,873 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:42,873 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:42,958 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:42,959 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:43,008 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:43,387 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:43,479 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:43,527 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:43,528 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19170 backedges. 737 proven. 3501 refuted. 0 times theorem prover too weak. 14932 trivial. 0 not checked. [2020-07-20 10:47:43,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390553816] [2020-07-20 10:47:43,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:43,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 21 [2020-07-20 10:47:43,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164356624] [2020-07-20 10:47:43,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 10:47:43,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:43,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 10:47:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-20 10:47:43,677 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 21 states. [2020-07-20 10:47:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:44,199 INFO L93 Difference]: Finished difference Result 134 states and 258 transitions. [2020-07-20 10:47:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-20 10:47:44,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 573 [2020-07-20 10:47:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:44,203 INFO L225 Difference]: With dead ends: 134 [2020-07-20 10:47:44,203 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 10:47:44,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1109 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2020-07-20 10:47:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 10:47:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2020-07-20 10:47:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-20 10:47:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2020-07-20 10:47:44,216 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 573 [2020-07-20 10:47:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:44,217 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2020-07-20 10:47:44,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 10:47:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2020-07-20 10:47:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2020-07-20 10:47:44,222 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:44,223 INFO L422 BasicCegarLoop]: trace histogram [95, 95, 77, 47, 47, 47, 47, 47, 47, 47, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:44,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:44,436 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:44,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1925755229, now seen corresponding path program 5 times [2020-07-20 10:47:44,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:44,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236660918] [2020-07-20 10:47:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:44,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 10:47:44,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 11719 proven. 843 refuted. 0 times theorem prover too weak. 12548 trivial. 0 not checked. [2020-07-20 10:47:45,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:48,612 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:48,777 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:48,872 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:48,932 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:49,546 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:49,547 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:49,708 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:49,803 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:49,804 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:49,859 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 988 proven. 4592 refuted. 0 times theorem prover too weak. 19530 trivial. 0 not checked. [2020-07-20 10:47:50,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236660918] [2020-07-20 10:47:50,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:50,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 25 [2020-07-20 10:47:50,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078646488] [2020-07-20 10:47:50,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-20 10:47:50,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-20 10:47:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-07-20 10:47:50,100 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand 25 states. [2020-07-20 10:47:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:50,830 INFO L93 Difference]: Finished difference Result 159 states and 279 transitions. [2020-07-20 10:47:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-20 10:47:50,831 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 654 [2020-07-20 10:47:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:50,835 INFO L225 Difference]: With dead ends: 159 [2020-07-20 10:47:50,835 INFO L226 Difference]: Without dead ends: 93 [2020-07-20 10:47:50,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1328 GetRequests, 1263 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2020-07-20 10:47:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-20 10:47:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2020-07-20 10:47:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-20 10:47:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2020-07-20 10:47:50,875 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 654 [2020-07-20 10:47:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:50,876 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2020-07-20 10:47:50,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-20 10:47:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2020-07-20 10:47:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-07-20 10:47:50,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:50,886 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:51,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:51,100 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 6 times [2020-07-20 10:47:51,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:51,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [794664722] [2020-07-20 10:47:51,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:47:51,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-20 10:47:51,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:47:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2020-07-20 10:47:51,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:47:54,374 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:54,822 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:55,094 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:55,095 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:55,268 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:55,368 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:55,432 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:56,957 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:56,958 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:57,401 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:57,402 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:57,676 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:57,677 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:57,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:57,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:57,957 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:58,014 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:47:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2020-07-20 10:47:58,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [794664722] [2020-07-20 10:47:58,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:47:58,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 33 [2020-07-20 10:47:58,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416546262] [2020-07-20 10:47:58,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-20 10:47:58,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:47:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-20 10:47:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2020-07-20 10:47:58,269 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 33 states. [2020-07-20 10:47:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:47:59,596 INFO L93 Difference]: Finished difference Result 215 states and 403 transitions. [2020-07-20 10:47:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-20 10:47:59,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 531 [2020-07-20 10:47:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:47:59,599 INFO L225 Difference]: With dead ends: 215 [2020-07-20 10:47:59,599 INFO L226 Difference]: Without dead ends: 137 [2020-07-20 10:47:59,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1001 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=987, Invalid=3045, Unknown=0, NotChecked=0, Total=4032 [2020-07-20 10:47:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-20 10:47:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2020-07-20 10:47:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-20 10:47:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2020-07-20 10:47:59,630 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 531 [2020-07-20 10:47:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:47:59,634 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2020-07-20 10:47:59,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-20 10:47:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2020-07-20 10:47:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-20 10:47:59,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:47:59,639 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:47:59,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:47:59,855 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:47:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:47:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 7 times [2020-07-20 10:47:59,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:47:59,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684166459] [2020-07-20 10:47:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:48:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 10:48:00,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 10:48:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 10:48:00,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 10:48:00,351 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 10:48:00,352 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 10:48:00,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:48:00,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:48:00 BoogieIcfgContainer [2020-07-20 10:48:00,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 10:48:00,644 INFO L168 Benchmark]: Toolchain (without parser) took 43235.29 ms. Allocated memory was 140.0 MB in the beginning and 1.1 GB in the end (delta: 950.5 MB). Free memory was 104.8 MB in the beginning and 394.8 MB in the end (delta: -290.0 MB). Peak memory consumption was 660.5 MB. Max. memory is 7.1 GB. [2020-07-20 10:48:00,645 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 10:48:00,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.20 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 95.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-20 10:48:00,646 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 ms. Allocated memory is still 140.0 MB. Free memory was 95.1 MB in the beginning and 93.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 10:48:00,646 INFO L168 Benchmark]: RCFGBuilder took 506.41 ms. Allocated memory was 140.0 MB in the beginning and 207.6 MB in the end (delta: 67.6 MB). Free memory was 93.7 MB in the beginning and 175.1 MB in the end (delta: -81.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-20 10:48:00,647 INFO L168 Benchmark]: TraceAbstraction took 42432.61 ms. Allocated memory was 207.6 MB in the beginning and 1.1 GB in the end (delta: 882.9 MB). Free memory was 175.1 MB in the beginning and 394.8 MB in the end (delta: -219.7 MB). Peak memory consumption was 663.2 MB. Max. memory is 7.1 GB. [2020-07-20 10:48:00,651 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.20 ms. Allocated memory is still 140.0 MB. Free memory was 104.3 MB in the beginning and 95.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.93 ms. Allocated memory is still 140.0 MB. Free memory was 95.1 MB in the beginning and 93.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 506.41 ms. Allocated memory was 140.0 MB in the beginning and 207.6 MB in the end (delta: 67.6 MB). Free memory was 93.7 MB in the beginning and 175.1 MB in the end (delta: -81.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42432.61 ms. Allocated memory was 207.6 MB in the beginning and 1.1 GB in the end (delta: 882.9 MB). Free memory was 175.1 MB in the beginning and 394.8 MB in the end (delta: -219.7 MB). Peak memory consumption was 663.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.2s, OverallIterations: 12, TraceHistogramMax: 155, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 229 SDtfs, 1102 SDslu, 1054 SDs, 0 SdLazy, 1618 SolverSat, 1681 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8564 GetRequests, 8169 SyntacticMatches, 125 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 137 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 4707 NumberOfCodeBlocks, 4707 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 8441 ConstructedInterpolants, 0 QuantifiedInterpolants, 7453745 SizeOfPredicates, 84 NumberOfNonLiveVariables, 9477 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 325855/359896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...