/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 SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -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-21 19:16:44,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 19:16:44,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 19:16:44,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 19:16:44,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 19:16:44,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 19:16:44,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 19:16:44,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 19:16:44,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 19:16:44,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 19:16:44,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 19:16:44,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 19:16:44,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 19:16:44,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 19:16:44,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 19:16:44,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 19:16:44,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 19:16:44,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 19:16:44,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 19:16:44,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 19:16:44,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 19:16:44,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 19:16:44,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 19:16:44,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 19:16:44,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 19:16:44,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 19:16:44,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 19:16:44,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 19:16:44,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 19:16:44,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 19:16:44,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 19:16:44,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 19:16:44,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 19:16:44,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 19:16:44,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 19:16:44,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 19:16:44,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 19:16:44,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 19:16:44,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 19:16:44,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 19:16:44,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 19:16:44,712 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-21 19:16:44,726 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 19:16:44,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 19:16:44,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 19:16:44,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 19:16:44,728 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 19:16:44,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 19:16:44,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 19:16:44,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 19:16:44,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 19:16:44,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 19:16:44,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 19:16:44,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 19:16:44,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 19:16:44,730 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 19:16:44,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 19:16:44,730 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 19:16:44,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 19:16:44,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 19:16:44,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 19:16:44,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 19:16:44,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 19:16:44,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 19:16:44,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 19:16:44,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 19:16:44,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 19:16:44,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 19:16:44,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:16:44,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 19:16:44,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 19:16:44,733 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 -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 19:16:44,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 19:16:45,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 19:16:45,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 19:16:45,005 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 19:16:45,005 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 19:16:45,006 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 19:16:45,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ab0f0c3/9630aecef68148e5a9a3f4e01e601d39/FLAG919e4279b [2020-07-21 19:16:45,493 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 19:16:45,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 19:16:45,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ab0f0c3/9630aecef68148e5a9a3f4e01e601d39/FLAG919e4279b [2020-07-21 19:16:45,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ab0f0c3/9630aecef68148e5a9a3f4e01e601d39 [2020-07-21 19:16:45,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 19:16:45,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 19:16:45,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 19:16:45,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 19:16:45,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 19:16:45,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 07:16:45" (1/1) ... [2020-07-21 19:16:45,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cbf42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:45, skipping insertion in model container [2020-07-21 19:16:45,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 07:16:45" (1/1) ... [2020-07-21 19:16:45,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 19:16:45,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 19:16:46,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 19:16:46,123 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 19:16:46,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 19:16:46,150 INFO L208 MainTranslator]: Completed translation [2020-07-21 19:16:46,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46 WrapperNode [2020-07-21 19:16:46,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 19:16:46,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 19:16:46,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 19:16:46,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 19:16:46,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (1/1) ... [2020-07-21 19:16:46,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (1/1) ... [2020-07-21 19:16:46,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (1/1) ... [2020-07-21 19:16:46,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (1/1) ... [2020-07-21 19:16:46,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (1/1) ... [2020-07-21 19:16:46,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (1/1) ... [2020-07-21 19:16:46,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (1/1) ... [2020-07-21 19:16:46,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 19:16:46,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 19:16:46,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 19:16:46,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 19:16:46,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (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-21 19:16:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 19:16:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 19:16:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-21 19:16:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 19:16:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 19:16:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 19:16:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-21 19:16:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 19:16:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 19:16:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 19:16:46,483 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 19:16:46,483 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 19:16:46,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 07:16:46 BoogieIcfgContainer [2020-07-21 19:16:46,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 19:16:46,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 19:16:46,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 19:16:46,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 19:16:46,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 07:16:45" (1/3) ... [2020-07-21 19:16:46,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c1427c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 07:16:46, skipping insertion in model container [2020-07-21 19:16:46,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:16:46" (2/3) ... [2020-07-21 19:16:46,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c1427c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 07:16:46, skipping insertion in model container [2020-07-21 19:16:46,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 07:16:46" (3/3) ... [2020-07-21 19:16:46,496 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-21 19:16:46,506 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 19:16:46,513 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 19:16:46,527 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 19:16:46,555 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 19:16:46,556 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 19:16:46,556 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 19:16:46,556 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 19:16:46,557 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 19:16:46,557 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 19:16:46,557 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 19:16:46,557 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 19:16:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-21 19:16:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 19:16:46,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:16:46,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:16:46,591 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:16:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:16:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-21 19:16:46,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:16:46,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287516439] [2020-07-21 19:16:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:16:46,684 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 19:16:46,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:16:46,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 19:16:46,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:16:46,779 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-21 19:16:46,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 19:16:46,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287516439] [2020-07-21 19:16:46,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 19:16:46,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 19:16:46,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280049451] [2020-07-21 19:16:46,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 19:16:46,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:16:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 19:16:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 19:16:46,801 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-21 19:16:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:16:46,905 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 19:16:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 19:16:46,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 19:16:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:16:46,917 INFO L225 Difference]: With dead ends: 35 [2020-07-21 19:16:46,918 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 19:16:46,921 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-21 19:16:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 19:16:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 19:16:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 19:16:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 19:16:46,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 19:16:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:16:46,967 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 19:16:46,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 19:16:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 19:16:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 19:16:46,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:16:46,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:16:47,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:16:47,183 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:16:47,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:16:47,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-21 19:16:47,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:16:47,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145196216] [2020-07-21 19:16:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:16:47,207 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 19:16:47,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:16:47,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 19:16:47,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:16:47,238 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-21 19:16:47,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 19:16:47,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145196216] [2020-07-21 19:16:47,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 19:16:47,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 19:16:47,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039631657] [2020-07-21 19:16:47,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 19:16:47,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:16:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 19:16:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 19:16:47,243 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 19:16:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:16:47,306 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 19:16:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 19:16:47,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 19:16:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:16:47,308 INFO L225 Difference]: With dead ends: 27 [2020-07-21 19:16:47,309 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 19:16:47,310 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-21 19:16:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 19:16:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 19:16:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 19:16:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 19:16:47,318 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 19:16:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:16:47,318 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 19:16:47,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 19:16:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 19:16:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 19:16:47,320 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:16:47,321 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-21 19:16:47,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:16:47,534 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:16:47,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:16:47,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-21 19:16:47,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:16:47,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691069358] [2020-07-21 19:16:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:16:47,580 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:16:47,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:16:47,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 19:16:47,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:16:47,642 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-21 19:16:47,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:16:47,810 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:47,814 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:47,848 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-21 19:16:47,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691069358] [2020-07-21 19:16:47,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:16:47,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-07-21 19:16:47,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298173773] [2020-07-21 19:16:47,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-21 19:16:47,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:16:47,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-21 19:16:47,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-21 19:16:47,851 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2020-07-21 19:16:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:16:47,980 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2020-07-21 19:16:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 19:16:47,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-21 19:16:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:16:47,983 INFO L225 Difference]: With dead ends: 39 [2020-07-21 19:16:47,983 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 19:16:47,984 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-21 19:16:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 19:16:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-21 19:16:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 19:16:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 19:16:47,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 26 [2020-07-21 19:16:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:16:47,996 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 19:16:47,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-21 19:16:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 19:16:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-21 19:16:47,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:16:47,999 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-21 19:16:48,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:16:48,211 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:16:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:16:48,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1708682098, now seen corresponding path program 1 times [2020-07-21 19:16:48,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:16:48,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410099957] [2020-07-21 19:16:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:16:48,266 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:16:48,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:16:48,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 19:16:48,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:16:48,331 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-21 19:16:48,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:16:48,599 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:48,600 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:48,646 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:48,686 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-21 19:16:48,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410099957] [2020-07-21 19:16:48,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:16:48,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2020-07-21 19:16:48,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228294882] [2020-07-21 19:16:48,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 19:16:48,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:16:48,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 19:16:48,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-21 19:16:48,690 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 12 states. [2020-07-21 19:16:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:16:48,856 INFO L93 Difference]: Finished difference Result 57 states and 114 transitions. [2020-07-21 19:16:48,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 19:16:48,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2020-07-21 19:16:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:16:48,861 INFO L225 Difference]: With dead ends: 57 [2020-07-21 19:16:48,861 INFO L226 Difference]: Without dead ends: 51 [2020-07-21 19:16:48,862 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-21 19:16:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-21 19:16:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2020-07-21 19:16:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 19:16:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 19:16:48,878 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 67 [2020-07-21 19:16:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:16:48,879 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 19:16:48,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 19:16:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 19:16:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-21 19:16:48,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:16:48,884 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-21 19:16:49,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:16:49,100 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:16:49,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:16:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1655086695, now seen corresponding path program 2 times [2020-07-21 19:16:49,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:16:49,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460442301] [2020-07-21 19:16:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:16:49,192 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:16:49,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:16:49,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 19:16:49,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:16:49,291 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-21 19:16:49,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:16:49,963 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:50,135 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:50,220 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:50,222 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:50,274 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:50,275 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:50,360 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-21 19:16:50,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460442301] [2020-07-21 19:16:50,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:16:50,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2020-07-21 19:16:50,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842057733] [2020-07-21 19:16:50,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 19:16:50,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:16:50,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 19:16:50,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-07-21 19:16:50,367 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 16 states. [2020-07-21 19:16:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:16:50,715 INFO L93 Difference]: Finished difference Result 72 states and 183 transitions. [2020-07-21 19:16:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 19:16:50,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2020-07-21 19:16:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:16:50,723 INFO L225 Difference]: With dead ends: 72 [2020-07-21 19:16:50,724 INFO L226 Difference]: Without dead ends: 66 [2020-07-21 19:16:50,725 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-21 19:16:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-21 19:16:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-21 19:16:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 19:16:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 19:16:50,759 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 156 [2020-07-21 19:16:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:16:50,760 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 19:16:50,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 19:16:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 19:16:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-21 19:16:50,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:16:50,766 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-21 19:16:50,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:16:50,975 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:16:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:16:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -700634023, now seen corresponding path program 2 times [2020-07-21 19:16:50,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:16:50,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766193342] [2020-07-21 19:16:50,978 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:16:51,099 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:16:51,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:16:51,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 19:16:51,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:16:51,272 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-21 19:16:51,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:16:52,329 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:52,612 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:52,775 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:52,857 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:52,902 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:52,903 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:53,008 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-21 19:16:53,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [766193342] [2020-07-21 19:16:53,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:16:53,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2020-07-21 19:16:53,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350212925] [2020-07-21 19:16:53,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 19:16:53,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:16:53,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 19:16:53,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-07-21 19:16:53,011 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 18 states. [2020-07-21 19:16:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:16:53,310 INFO L93 Difference]: Finished difference Result 87 states and 270 transitions. [2020-07-21 19:16:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 19:16:53,311 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 272 [2020-07-21 19:16:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:16:53,316 INFO L225 Difference]: With dead ends: 87 [2020-07-21 19:16:53,316 INFO L226 Difference]: Without dead ends: 81 [2020-07-21 19:16:53,318 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-21 19:16:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-21 19:16:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2020-07-21 19:16:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 19:16:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 19:16:53,341 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 272 [2020-07-21 19:16:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:16:53,342 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 19:16:53,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 19:16:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 19:16:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2020-07-21 19:16:53,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:16:53,373 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-21 19:16:53,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:16:53,588 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:16:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:16:53,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1816565800, now seen corresponding path program 3 times [2020-07-21 19:16:53,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:16:53,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369456567] [2020-07-21 19:16:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:16:53,911 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:16:53,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:16:53,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 19:16:53,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:16:54,381 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-21 19:16:54,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:16:57,199 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:58,210 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:58,672 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,012 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,013 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,196 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,199 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,280 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,281 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,323 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,324 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:16:59,672 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-21 19:16:59,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369456567] [2020-07-21 19:16:59,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:16:59,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 20 [2020-07-21 19:16:59,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453063766] [2020-07-21 19:16:59,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-21 19:16:59,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:16:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-21 19:16:59,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-21 19:16:59,676 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 20 states. [2020-07-21 19:17:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:17:00,030 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-21 19:17:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 19:17:00,030 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 871 [2020-07-21 19:17:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:17:00,037 INFO L225 Difference]: With dead ends: 92 [2020-07-21 19:17:00,037 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 19:17:00,039 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-21 19:17:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 19:17:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 19:17:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 19:17:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 19:17:00,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 871 [2020-07-21 19:17:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:17:00,058 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 19:17:00,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-21 19:17:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 19:17:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2020-07-21 19:17:00,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:17:00,083 INFO L422 BasicCegarLoop]: trace histogram [155, 155, 131, 77, 77, 77, 77, 77, 77, 77, 54, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:17:00,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:17:00,297 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:17:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:17:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash -577468295, now seen corresponding path program 3 times [2020-07-21 19:17:00,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:17:00,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532804532] [2020-07-21 19:17:00,300 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:17:00,703 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:17:00,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:17:00,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 2374 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 19:17:00,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:17:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 67959 backedges. 10380 proven. 120 refuted. 0 times theorem prover too weak. 57459 trivial. 0 not checked. [2020-07-21 19:17:01,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:17:05,279 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:05,325 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:05,326 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:05,539 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:05,539 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:05,592 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:05,593 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 67959 backedges. 1020 proven. 6132 refuted. 0 times theorem prover too weak. 60807 trivial. 0 not checked. [2020-07-21 19:17:06,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532804532] [2020-07-21 19:17:06,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:17:06,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2020-07-21 19:17:06,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534407645] [2020-07-21 19:17:06,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 19:17:06,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:17:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 19:17:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-21 19:17:06,047 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 17 states. [2020-07-21 19:17:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:17:06,392 INFO L93 Difference]: Finished difference Result 114 states and 313 transitions. [2020-07-21 19:17:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 19:17:06,392 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1068 [2020-07-21 19:17:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:17:06,394 INFO L225 Difference]: With dead ends: 114 [2020-07-21 19:17:06,394 INFO L226 Difference]: Without dead ends: 64 [2020-07-21 19:17:06,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2147 GetRequests, 2107 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-21 19:17:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-21 19:17:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-21 19:17:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-21 19:17:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2020-07-21 19:17:06,410 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 1068 [2020-07-21 19:17:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:17:06,410 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2020-07-21 19:17:06,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 19:17:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2020-07-21 19:17:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2020-07-21 19:17:06,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:17:06,418 INFO L422 BasicCegarLoop]: trace histogram [115, 115, 93, 57, 57, 57, 57, 57, 57, 57, 36, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:17:06,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:17:06,628 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:17:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:17:06,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1828338859, now seen corresponding path program 4 times [2020-07-21 19:17:06,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:17:06,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221345237] [2020-07-21 19:17:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:17:06,921 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:17:06,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:17:06,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 19:17:06,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:17:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 10959 proven. 353 refuted. 0 times theorem prover too weak. 25570 trivial. 0 not checked. [2020-07-21 19:17:07,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:17:10,625 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:10,626 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:10,722 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:10,723 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:10,770 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:11,134 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:11,225 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:11,272 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:11,273 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 843 proven. 5195 refuted. 0 times theorem prover too weak. 30844 trivial. 0 not checked. [2020-07-21 19:17:11,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221345237] [2020-07-21 19:17:11,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:17:11,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 21 [2020-07-21 19:17:11,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158516446] [2020-07-21 19:17:11,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 19:17:11,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:17:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 19:17:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-21 19:17:11,578 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 21 states. [2020-07-21 19:17:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:17:12,085 INFO L93 Difference]: Finished difference Result 134 states and 258 transitions. [2020-07-21 19:17:12,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-21 19:17:12,086 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 790 [2020-07-21 19:17:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:17:12,089 INFO L225 Difference]: With dead ends: 134 [2020-07-21 19:17:12,090 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 19:17:12,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1595 GetRequests, 1543 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2020-07-21 19:17:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 19:17:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2020-07-21 19:17:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-21 19:17:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2020-07-21 19:17:12,101 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 790 [2020-07-21 19:17:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:17:12,102 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2020-07-21 19:17:12,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 19:17:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2020-07-21 19:17:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-07-21 19:17:12,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:17:12,107 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:17:12,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:17:12,320 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:17:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:17:12,321 INFO L82 PathProgramCache]: Analyzing trace with hash 243817667, now seen corresponding path program 5 times [2020-07-21 19:17:12,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:17:12,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1699676596] [2020-07-21 19:17:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:17:12,566 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:17:12,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:17:12,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 19:17:12,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:17:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 10394 proven. 1596 refuted. 0 times theorem prover too weak. 7113 trivial. 0 not checked. [2020-07-21 19:17:12,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:17:15,861 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:16,112 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:16,272 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:16,273 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:16,362 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:16,411 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:16,412 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:17,343 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:17,607 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:17,779 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:17,877 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:17,961 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1245 proven. 4107 refuted. 0 times theorem prover too weak. 13751 trivial. 0 not checked. [2020-07-21 19:17:18,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1699676596] [2020-07-21 19:17:18,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:17:18,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 29 [2020-07-21 19:17:18,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394916916] [2020-07-21 19:17:18,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-21 19:17:18,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:17:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-21 19:17:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-21 19:17:18,127 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand 29 states. [2020-07-21 19:17:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:17:19,193 INFO L93 Difference]: Finished difference Result 178 states and 337 transitions. [2020-07-21 19:17:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-21 19:17:19,194 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 572 [2020-07-21 19:17:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:17:19,197 INFO L225 Difference]: With dead ends: 178 [2020-07-21 19:17:19,198 INFO L226 Difference]: Without dead ends: 112 [2020-07-21 19:17:19,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1169 GetRequests, 1091 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=747, Invalid=2223, Unknown=0, NotChecked=0, Total=2970 [2020-07-21 19:17:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-21 19:17:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2020-07-21 19:17:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-21 19:17:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2020-07-21 19:17:19,213 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 572 [2020-07-21 19:17:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:17:19,214 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2020-07-21 19:17:19,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-21 19:17:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2020-07-21 19:17:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2020-07-21 19:17:19,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:17:19,219 INFO L422 BasicCegarLoop]: trace histogram [93, 93, 75, 46, 46, 46, 46, 46, 46, 46, 29, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:17:19,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:17:19,432 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:17:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:17:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash -245276294, now seen corresponding path program 6 times [2020-07-21 19:17:19,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:17:19,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643617066] [2020-07-21 19:17:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:17:19,772 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:17:19,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:17:19,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-21 19:17:19,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:17:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 24027 backedges. 2194 proven. 4514 refuted. 0 times theorem prover too weak. 17319 trivial. 0 not checked. [2020-07-21 19:17:20,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:17:22,838 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:23,294 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:23,604 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:23,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:23,803 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:23,920 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:23,982 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:25,470 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:25,890 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:25,891 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:26,145 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:26,305 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:26,401 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:26,455 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:17:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24027 backedges. 2194 proven. 4622 refuted. 0 times theorem prover too weak. 17211 trivial. 0 not checked. [2020-07-21 19:17:26,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643617066] [2020-07-21 19:17:26,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:17:26,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 33 [2020-07-21 19:17:26,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313799072] [2020-07-21 19:17:26,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-21 19:17:26,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:17:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-21 19:17:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2020-07-21 19:17:26,657 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 33 states. [2020-07-21 19:17:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:17:27,995 INFO L93 Difference]: Finished difference Result 220 states and 368 transitions. [2020-07-21 19:17:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-21 19:17:27,996 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 640 [2020-07-21 19:17:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:17:27,999 INFO L225 Difference]: With dead ends: 220 [2020-07-21 19:17:27,999 INFO L226 Difference]: Without dead ends: 130 [2020-07-21 19:17:28,001 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1219 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=987, Invalid=3045, Unknown=0, NotChecked=0, Total=4032 [2020-07-21 19:17:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-21 19:17:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2020-07-21 19:17:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-21 19:17:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2020-07-21 19:17:28,012 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 640 [2020-07-21 19:17:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:17:28,013 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2020-07-21 19:17:28,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-21 19:17:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2020-07-21 19:17:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-21 19:17:28,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:17:28,016 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-21 19:17:28,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:17:28,227 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:17:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:17:28,229 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 7 times [2020-07-21 19:17:28,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:17:28,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393864215] [2020-07-21 19:17:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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-21 19:17:28,566 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:17:28,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 19:17:28,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 19:17:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 19:17:28,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 19:17:28,711 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 19:17:28,711 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 19:17:28,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:17:29,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 07:17:29 BoogieIcfgContainer [2020-07-21 19:17:29,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 19:17:29,006 INFO L168 Benchmark]: Toolchain (without parser) took 43084.82 ms. Allocated memory was 144.7 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. [2020-07-21 19:17:29,006 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-21 19:17:29,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.25 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-21 19:17:29,008 INFO L168 Benchmark]: Boogie Preprocessor took 21.55 ms. Allocated memory is still 144.7 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 19:17:29,009 INFO L168 Benchmark]: RCFGBuilder took 314.18 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 90.5 MB in the beginning and 169.3 MB in the end (delta: -78.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-21 19:17:29,010 INFO L168 Benchmark]: TraceAbstraction took 42514.96 ms. Allocated memory was 201.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 168.6 MB in the beginning and 1.2 GB in the end (delta: -985.8 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2020-07-21 19:17:29,013 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.27 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 228.25 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.55 ms. Allocated memory is still 144.7 MB. Free memory was 91.9 MB in the beginning and 90.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 314.18 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 90.5 MB in the beginning and 169.3 MB in the end (delta: -78.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42514.96 ms. Allocated memory was 201.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 168.6 MB in the beginning and 1.2 GB in the end (delta: -985.8 MB). Peak memory consumption was 85.9 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.3s, OverallIterations: 12, TraceHistogramMax: 155, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 233 SDtfs, 1366 SDslu, 1072 SDs, 0 SdLazy, 1716 SolverSat, 2150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9059 GetRequests, 8651 SyntacticMatches, 129 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2367 ImplicationChecksByTransitivity, 4.2s 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 137 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 4952 NumberOfCodeBlocks, 4939 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 8931 ConstructedInterpolants, 0 QuantifiedInterpolants, 8271863 SizeOfPredicates, 86 NumberOfNonLiveVariables, 9999 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 360389/398806 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...