/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 10:41:01,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 10:41:01,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 10:41:01,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 10:41:01,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 10:41:01,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 10:41:01,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 10:41:01,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 10:41:01,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 10:41:01,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 10:41:01,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 10:41:01,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 10:41:01,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 10:41:01,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 10:41:01,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 10:41:01,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 10:41:01,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 10:41:01,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 10:41:01,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 10:41:01,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 10:41:01,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 10:41:01,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 10:41:01,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 10:41:01,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 10:41:01,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 10:41:01,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 10:41:01,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 10:41:01,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 10:41:01,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 10:41:01,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 10:41:01,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 10:41:01,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 10:41:01,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 10:41:01,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 10:41:01,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 10:41:01,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 10:41:01,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 10:41:01,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 10:41:01,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 10:41:01,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 10:41:01,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 10:41:01,765 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 10:41:01,780 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 10:41:01,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 10:41:01,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 10:41:01,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 10:41:01,782 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 10:41:01,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 10:41:01,782 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 10:41:01,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 10:41:01,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 10:41:01,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 10:41:01,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 10:41:01,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 10:41:01,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 10:41:01,784 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 10:41:01,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 10:41:01,784 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 10:41:01,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 10:41:01,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 10:41:01,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 10:41:01,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 10:41:01,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 10:41:01,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 10:41:01,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 10:41:01,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 10:41:01,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 10:41:01,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 10:41:01,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:01,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 10:41:01,787 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 10:41:01,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-21 10:41:02,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 10:41:02,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 10:41:02,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 10:41:02,119 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 10:41:02,120 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 10:41:02,121 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 10:41:02,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac699dc19/b33d7cfc0e1e4614919d11adf4b5f586/FLAG3a35b058b [2020-07-21 10:41:02,656 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 10:41:02,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 10:41:02,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac699dc19/b33d7cfc0e1e4614919d11adf4b5f586/FLAG3a35b058b [2020-07-21 10:41:03,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac699dc19/b33d7cfc0e1e4614919d11adf4b5f586 [2020-07-21 10:41:03,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 10:41:03,034 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 10:41:03,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 10:41:03,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 10:41:03,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 10:41:03,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baf057a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03, skipping insertion in model container [2020-07-21 10:41:03,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 10:41:03,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 10:41:03,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 10:41:03,243 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 10:41:03,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 10:41:03,270 INFO L208 MainTranslator]: Completed translation [2020-07-21 10:41:03,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03 WrapperNode [2020-07-21 10:41:03,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 10:41:03,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 10:41:03,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 10:41:03,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 10:41:03,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (1/1) ... [2020-07-21 10:41:03,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 10:41:03,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 10:41:03,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 10:41:03,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 10:41:03,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (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 10:41:03,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 10:41:03,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 10:41:03,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-21 10:41:03,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 10:41:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 10:41:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 10:41:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-21 10:41:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 10:41:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 10:41:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 10:41:03,641 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 10:41:03,641 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 10:41:03,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:41:03 BoogieIcfgContainer [2020-07-21 10:41:03,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 10:41:03,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 10:41:03,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 10:41:03,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 10:41:03,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:41:03" (1/3) ... [2020-07-21 10:41:03,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b05506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:41:03, skipping insertion in model container [2020-07-21 10:41:03,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:41:03" (2/3) ... [2020-07-21 10:41:03,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b05506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:41:03, skipping insertion in model container [2020-07-21 10:41:03,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:41:03" (3/3) ... [2020-07-21 10:41:03,655 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-21 10:41:03,667 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 10:41:03,674 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 10:41:03,685 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 10:41:03,710 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 10:41:03,711 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 10:41:03,711 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 10:41:03,711 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 10:41:03,711 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 10:41:03,711 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 10:41:03,712 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 10:41:03,712 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 10:41:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-21 10:41:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 10:41:03,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:03,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:41:03,742 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-21 10:41:03,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:03,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131471306] [2020-07-21 10:41:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:03,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 10:41:03,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:03,962 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 10:41:03,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 10:41:03,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131471306] [2020-07-21 10:41:03,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 10:41:03,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 10:41:03,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963418205] [2020-07-21 10:41:03,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 10:41:03,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:03,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 10:41:03,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 10:41:03,996 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-21 10:41:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:04,130 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 10:41:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 10:41:04,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 10:41:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:04,149 INFO L225 Difference]: With dead ends: 35 [2020-07-21 10:41:04,150 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 10:41:04,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 10:41:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 10:41:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 10:41:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 10:41:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 10:41:04,210 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 10:41:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:04,211 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 10:41:04,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 10:41:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 10:41:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 10:41:04,213 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:04,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:41:04,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:04,429 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:04,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-21 10:41:04,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:04,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [674426120] [2020-07-21 10:41:04,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:04,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 10:41:04,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:04,504 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 10:41:04,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 10:41:04,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [674426120] [2020-07-21 10:41:04,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 10:41:04,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 10:41:04,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190428283] [2020-07-21 10:41:04,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 10:41:04,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 10:41:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 10:41:04,512 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 10:41:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:04,581 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 10:41:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 10:41:04,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 10:41:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:04,584 INFO L225 Difference]: With dead ends: 27 [2020-07-21 10:41:04,584 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 10:41:04,585 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 10:41:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 10:41:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 10:41:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 10:41:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 10:41:04,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 10:41:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:04,597 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 10:41:04,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 10:41:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 10:41:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 10:41:04,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:04,601 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 10:41:04,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:04,816 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-21 10:41:04,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:04,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486992113] [2020-07-21 10:41:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:04,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 10:41:04,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:04,940 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 10:41:04,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:05,149 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:05,153 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:05,190 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 10:41:05,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486992113] [2020-07-21 10:41:05,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:05,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-07-21 10:41:05,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200387161] [2020-07-21 10:41:05,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-21 10:41:05,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-21 10:41:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-21 10:41:05,206 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2020-07-21 10:41:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:05,343 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2020-07-21 10:41:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 10:41:05,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-21 10:41:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:05,347 INFO L225 Difference]: With dead ends: 39 [2020-07-21 10:41:05,347 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 10:41:05,348 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 10:41:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 10:41:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-21 10:41:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 10:41:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 10:41:05,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 26 [2020-07-21 10:41:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:05,360 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 10:41:05,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-21 10:41:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 10:41:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-21 10:41:05,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:05,364 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 10:41:05,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:05,578 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1708682098, now seen corresponding path program 1 times [2020-07-21 10:41:05,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:05,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185400816] [2020-07-21 10:41:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:05,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 10:41:05,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:05,703 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 10:41:05,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:06,016 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:06,018 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:06,076 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:06,147 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 10:41:06,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185400816] [2020-07-21 10:41:06,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:06,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2020-07-21 10:41:06,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23704345] [2020-07-21 10:41:06,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 10:41:06,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 10:41:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-21 10:41:06,153 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 12 states. [2020-07-21 10:41:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:06,355 INFO L93 Difference]: Finished difference Result 57 states and 114 transitions. [2020-07-21 10:41:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 10:41:06,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2020-07-21 10:41:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:06,360 INFO L225 Difference]: With dead ends: 57 [2020-07-21 10:41:06,361 INFO L226 Difference]: Without dead ends: 51 [2020-07-21 10:41:06,362 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 10:41:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-21 10:41:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2020-07-21 10:41:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 10:41:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 10:41:06,379 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 67 [2020-07-21 10:41:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:06,380 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 10:41:06,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 10:41:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 10:41:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-21 10:41:06,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:06,389 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 10:41:06,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:06,602 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:06,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1655086695, now seen corresponding path program 2 times [2020-07-21 10:41:06,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:06,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [797618658] [2020-07-21 10:41:06,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:06,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 10:41:06,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:06,785 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 10:41:06,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:07,549 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:07,758 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:07,865 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:07,866 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:07,919 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:07,921 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:07,990 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 10:41:07,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [797618658] [2020-07-21 10:41:07,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:07,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2020-07-21 10:41:07,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215214381] [2020-07-21 10:41:07,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 10:41:07,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 10:41:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-07-21 10:41:07,994 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 16 states. [2020-07-21 10:41:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:08,414 INFO L93 Difference]: Finished difference Result 72 states and 183 transitions. [2020-07-21 10:41:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 10:41:08,414 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2020-07-21 10:41:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:08,422 INFO L225 Difference]: With dead ends: 72 [2020-07-21 10:41:08,423 INFO L226 Difference]: Without dead ends: 66 [2020-07-21 10:41:08,424 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 10:41:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-21 10:41:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-21 10:41:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 10:41:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 10:41:08,444 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 156 [2020-07-21 10:41:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:08,446 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 10:41:08,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 10:41:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 10:41:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-21 10:41:08,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:08,452 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 10:41:08,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:08,667 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash -700634023, now seen corresponding path program 2 times [2020-07-21 10:41:08,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:08,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617253080] [2020-07-21 10:41:08,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:08,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 10:41:08,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:08,917 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 10:41:08,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:10,138 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:10,446 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:10,613 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:10,706 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:10,775 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:10,776 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:10,863 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 10:41:10,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617253080] [2020-07-21 10:41:10,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:10,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2020-07-21 10:41:10,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640750715] [2020-07-21 10:41:10,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 10:41:10,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:10,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 10:41:10,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-07-21 10:41:10,867 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 18 states. [2020-07-21 10:41:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:11,222 INFO L93 Difference]: Finished difference Result 87 states and 270 transitions. [2020-07-21 10:41:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 10:41:11,223 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 272 [2020-07-21 10:41:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:11,233 INFO L225 Difference]: With dead ends: 87 [2020-07-21 10:41:11,233 INFO L226 Difference]: Without dead ends: 81 [2020-07-21 10:41:11,235 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 10:41:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-21 10:41:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2020-07-21 10:41:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 10:41:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 10:41:11,279 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 272 [2020-07-21 10:41:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:11,280 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 10:41:11,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 10:41:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 10:41:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2020-07-21 10:41:11,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:11,308 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 10:41:11,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:11,523 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:11,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1816565800, now seen corresponding path program 3 times [2020-07-21 10:41:11,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:11,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [442860914] [2020-07-21 10:41:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:11,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 1947 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 10:41:11,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:12,348 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 10:41:12,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:15,519 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:16,635 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,162 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,523 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,524 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,724 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,725 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,815 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,815 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,861 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:17,862 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:18,208 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 10:41:18,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [442860914] [2020-07-21 10:41:18,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:18,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 20 [2020-07-21 10:41:18,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777764347] [2020-07-21 10:41:18,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-21 10:41:18,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:18,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-21 10:41:18,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-21 10:41:18,213 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 20 states. [2020-07-21 10:41:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:18,636 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-21 10:41:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 10:41:18,637 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 871 [2020-07-21 10:41:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:18,644 INFO L225 Difference]: With dead ends: 92 [2020-07-21 10:41:18,645 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 10:41:18,646 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 10:41:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 10:41:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 10:41:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 10:41:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 10:41:18,665 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 871 [2020-07-21 10:41:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:18,667 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 10:41:18,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-21 10:41:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 10:41:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1069 [2020-07-21 10:41:18,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:18,679 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 10:41:18,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:18,894 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash -577468295, now seen corresponding path program 3 times [2020-07-21 10:41:18,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:18,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1946164747] [2020-07-21 10:41:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:19,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 2374 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 10:41:19,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 67959 backedges. 10380 proven. 122 refuted. 0 times theorem prover too weak. 57457 trivial. 0 not checked. [2020-07-21 10:41:19,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:24,332 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:24,400 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:24,400 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:24,631 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:24,632 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:24,679 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:24,680 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:25,144 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 10:41:25,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1946164747] [2020-07-21 10:41:25,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:25,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2020-07-21 10:41:25,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130468446] [2020-07-21 10:41:25,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 10:41:25,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 10:41:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-21 10:41:25,148 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 17 states. [2020-07-21 10:41:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:25,549 INFO L93 Difference]: Finished difference Result 114 states and 313 transitions. [2020-07-21 10:41:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 10:41:25,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1068 [2020-07-21 10:41:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:25,552 INFO L225 Difference]: With dead ends: 114 [2020-07-21 10:41:25,552 INFO L226 Difference]: Without dead ends: 64 [2020-07-21 10:41:25,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2147 GetRequests, 2107 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2020-07-21 10:41:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-21 10:41:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-21 10:41:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-21 10:41:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2020-07-21 10:41:25,567 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 1068 [2020-07-21 10:41:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:25,568 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2020-07-21 10:41:25,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 10:41:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2020-07-21 10:41:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2020-07-21 10:41:25,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:25,577 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 10:41:25,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:25,790 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1828338859, now seen corresponding path program 4 times [2020-07-21 10:41:25,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:25,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915875761] [2020-07-21 10:41:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:26,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 10:41:26,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 10959 proven. 356 refuted. 0 times theorem prover too weak. 25567 trivial. 0 not checked. [2020-07-21 10:41:26,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:30,227 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,228 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,331 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,332 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,385 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,825 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,924 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,973 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:30,975 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:31,271 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 10:41:31,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915875761] [2020-07-21 10:41:31,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:31,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 21 [2020-07-21 10:41:31,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620449934] [2020-07-21 10:41:31,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 10:41:31,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 10:41:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-21 10:41:31,275 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 21 states. [2020-07-21 10:41:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:31,853 INFO L93 Difference]: Finished difference Result 134 states and 258 transitions. [2020-07-21 10:41:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-21 10:41:31,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 790 [2020-07-21 10:41:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:31,856 INFO L225 Difference]: With dead ends: 134 [2020-07-21 10:41:31,856 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 10:41:31,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1595 GetRequests, 1543 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2020-07-21 10:41:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 10:41:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2020-07-21 10:41:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-21 10:41:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2020-07-21 10:41:31,869 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 790 [2020-07-21 10:41:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:31,869 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2020-07-21 10:41:31,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 10:41:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2020-07-21 10:41:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-07-21 10:41:31,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:31,874 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 10:41:32,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:32,080 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash 243817667, now seen corresponding path program 5 times [2020-07-21 10:41:32,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:32,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941273084] [2020-07-21 10:41:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:32,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 10:41:32,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 10394 proven. 1601 refuted. 0 times theorem prover too weak. 7108 trivial. 0 not checked. [2020-07-21 10:41:32,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:36,050 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:36,333 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:36,504 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:36,505 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:36,602 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:36,666 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:36,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:37,696 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:37,983 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:38,159 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:38,262 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:38,318 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:38,545 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 10:41:38,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941273084] [2020-07-21 10:41:38,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:38,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 29 [2020-07-21 10:41:38,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341810853] [2020-07-21 10:41:38,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-21 10:41:38,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-21 10:41:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-21 10:41:38,549 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand 29 states. [2020-07-21 10:41:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:39,791 INFO L93 Difference]: Finished difference Result 178 states and 337 transitions. [2020-07-21 10:41:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-21 10:41:39,792 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 572 [2020-07-21 10:41:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:39,796 INFO L225 Difference]: With dead ends: 178 [2020-07-21 10:41:39,796 INFO L226 Difference]: Without dead ends: 112 [2020-07-21 10:41:39,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1169 GetRequests, 1091 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=747, Invalid=2223, Unknown=0, NotChecked=0, Total=2970 [2020-07-21 10:41:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-21 10:41:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2020-07-21 10:41:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-21 10:41:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2020-07-21 10:41:39,834 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 572 [2020-07-21 10:41:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:39,836 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2020-07-21 10:41:39,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-21 10:41:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2020-07-21 10:41:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2020-07-21 10:41:39,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:39,843 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 10:41:40,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:40,057 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -245276294, now seen corresponding path program 6 times [2020-07-21 10:41:40,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:40,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2124708864] [2020-07-21 10:41:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:41:40,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-21 10:41:40,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:41:40,751 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 10:41:40,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:41:43,777 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:44,281 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:44,627 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:44,838 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:44,839 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:44,966 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:45,036 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:46,653 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:47,122 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:47,123 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:47,406 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:47,585 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:47,693 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:47,757 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:41:48,022 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 10:41:48,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2124708864] [2020-07-21 10:41:48,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:41:48,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 33 [2020-07-21 10:41:48,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880246551] [2020-07-21 10:41:48,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-21 10:41:48,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:41:48,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-21 10:41:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2020-07-21 10:41:48,025 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 33 states. [2020-07-21 10:41:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:41:49,585 INFO L93 Difference]: Finished difference Result 220 states and 368 transitions. [2020-07-21 10:41:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-21 10:41:49,586 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 640 [2020-07-21 10:41:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:41:49,589 INFO L225 Difference]: With dead ends: 220 [2020-07-21 10:41:49,589 INFO L226 Difference]: Without dead ends: 130 [2020-07-21 10:41:49,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1219 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=987, Invalid=3045, Unknown=0, NotChecked=0, Total=4032 [2020-07-21 10:41:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-21 10:41:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2020-07-21 10:41:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-21 10:41:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2020-07-21 10:41:49,621 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 640 [2020-07-21 10:41:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:41:49,622 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2020-07-21 10:41:49,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-21 10:41:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2020-07-21 10:41:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-21 10:41:49,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:41:49,626 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 10:41:49,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:49,840 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:41:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:41:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 7 times [2020-07-21 10:41:49,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:41:49,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996710537] [2020-07-21 10:41:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 10:41:50,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 10:41:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 10:41:50,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 10:41:50,349 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 10:41:50,349 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 10:41:50,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:41:50,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 10:41:50 BoogieIcfgContainer [2020-07-21 10:41:50,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 10:41:50,657 INFO L168 Benchmark]: Toolchain (without parser) took 47621.02 ms. Allocated memory was 138.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 103.3 MB in the beginning and 470.5 MB in the end (delta: -367.2 MB). Peak memory consumption was 751.6 MB. Max. memory is 7.1 GB. [2020-07-21 10:41:50,658 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 10:41:50,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.31 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 93.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-21 10:41:50,659 INFO L168 Benchmark]: Boogie Preprocessor took 29.08 ms. Allocated memory is still 138.9 MB. Free memory was 93.8 MB in the beginning and 92.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 10:41:50,660 INFO L168 Benchmark]: RCFGBuilder took 344.95 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.2 MB in the beginning and 170.1 MB in the end (delta: -77.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-21 10:41:50,661 INFO L168 Benchmark]: TraceAbstraction took 47003.93 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 169.4 MB in the beginning and 470.5 MB in the end (delta: -301.1 MB). Peak memory consumption was 754.3 MB. Max. memory is 7.1 GB. [2020-07-21 10:41:50,664 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 236.31 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 93.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.08 ms. Allocated memory is still 138.9 MB. Free memory was 93.8 MB in the beginning and 92.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.95 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.2 MB in the beginning and 170.1 MB in the end (delta: -77.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47003.93 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 169.4 MB in the beginning and 470.5 MB in the end (delta: -301.1 MB). Peak memory consumption was 754.3 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: 46.8s, OverallIterations: 12, TraceHistogramMax: 155, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 233 SDtfs, 1360 SDslu, 1080 SDs, 0 SdLazy, 1736 SolverSat, 2121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9059 GetRequests, 8651 SyntacticMatches, 129 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2367 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 137 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 35.6s InterpolantComputationTime, 4952 NumberOfCodeBlocks, 4952 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 8931 ConstructedInterpolants, 0 QuantifiedInterpolants, 8262155 SizeOfPredicates, 86 NumberOfNonLiveVariables, 10021 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 360379/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...