/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 13:11:14,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 13:11:14,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 13:11:14,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 13:11:14,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 13:11:14,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 13:11:14,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 13:11:14,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 13:11:14,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 13:11:14,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 13:11:14,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 13:11:14,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 13:11:14,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 13:11:14,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 13:11:14,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 13:11:14,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 13:11:14,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 13:11:14,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 13:11:14,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 13:11:14,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 13:11:14,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 13:11:14,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 13:11:14,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 13:11:14,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 13:11:14,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 13:11:14,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 13:11:14,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 13:11:14,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 13:11:14,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 13:11:14,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 13:11:14,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 13:11:14,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 13:11:14,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 13:11:14,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 13:11:14,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 13:11:14,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 13:11:14,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 13:11:14,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 13:11:14,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 13:11:14,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 13:11:14,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 13:11:14,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 13:11:14,859 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 13:11:14,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 13:11:14,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 13:11:14,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 13:11:14,861 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 13:11:14,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 13:11:14,861 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 13:11:14,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 13:11:14,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 13:11:14,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 13:11:14,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 13:11:14,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 13:11:14,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 13:11:14,863 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 13:11:14,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 13:11:14,863 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 13:11:14,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 13:11:14,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 13:11:14,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 13:11:14,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 13:11:14,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 13:11:14,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 13:11:14,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 13:11:14,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 13:11:14,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 13:11:14,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 13:11:14,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:14,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 13:11:14,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 13:11:14,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 13:11:15,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 13:11:15,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 13:11:15,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 13:11:15,176 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 13:11:15,176 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 13:11:15,177 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-20 13:11:15,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bb9fae3/0e72a1d5b70f4cf3a9d529bdc5f9600e/FLAG6e6c8f531 [2020-07-20 13:11:15,708 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 13:11:15,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-20 13:11:15,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bb9fae3/0e72a1d5b70f4cf3a9d529bdc5f9600e/FLAG6e6c8f531 [2020-07-20 13:11:16,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bb9fae3/0e72a1d5b70f4cf3a9d529bdc5f9600e [2020-07-20 13:11:16,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 13:11:16,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 13:11:16,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 13:11:16,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 13:11:16,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 13:11:16,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1c3bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16, skipping insertion in model container [2020-07-20 13:11:16,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 13:11:16,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 13:11:16,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 13:11:16,332 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 13:11:16,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 13:11:16,362 INFO L208 MainTranslator]: Completed translation [2020-07-20 13:11:16,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16 WrapperNode [2020-07-20 13:11:16,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 13:11:16,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 13:11:16,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 13:11:16,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 13:11:16,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... [2020-07-20 13:11:16,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 13:11:16,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 13:11:16,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 13:11:16,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 13:11:16,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 13:11:16,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 13:11:16,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 13:11:16,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-20 13:11:16,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 13:11:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 13:11:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 13:11:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-20 13:11:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 13:11:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 13:11:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 13:11:16,715 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 13:11:16,715 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 13:11:16,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:11:16 BoogieIcfgContainer [2020-07-20 13:11:16,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 13:11:16,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 13:11:16,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 13:11:16,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 13:11:16,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:11:16" (1/3) ... [2020-07-20 13:11:16,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3955e459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:11:16, skipping insertion in model container [2020-07-20 13:11:16,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:11:16" (2/3) ... [2020-07-20 13:11:16,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3955e459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:11:16, skipping insertion in model container [2020-07-20 13:11:16,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:11:16" (3/3) ... [2020-07-20 13:11:16,749 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-20 13:11:16,783 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 13:11:16,804 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 13:11:16,827 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 13:11:16,853 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 13:11:16,853 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 13:11:16,853 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 13:11:16,854 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 13:11:16,854 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 13:11:16,854 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 13:11:16,854 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 13:11:16,854 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 13:11:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-20 13:11:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 13:11:16,880 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:16,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:16,882 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-20 13:11:16,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:16,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538412184] [2020-07-20 13:11:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:16,961 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:16,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:16,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 13:11:16,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 13:11:17,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 13:11:17,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538412184] [2020-07-20 13:11:17,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 13:11:17,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 13:11:17,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082978615] [2020-07-20 13:11:17,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 13:11:17,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:17,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 13:11:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 13:11:17,072 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-20 13:11:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:17,195 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 13:11:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 13:11:17,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 13:11:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:17,207 INFO L225 Difference]: With dead ends: 35 [2020-07-20 13:11:17,208 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 13:11:17,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 13:11:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 13:11:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 13:11:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 13:11:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 13:11:17,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 13:11:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:17,253 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 13:11:17,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 13:11:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 13:11:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 13:11:17,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:17,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:17,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:17,462 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-20 13:11:17,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:17,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1257368331] [2020-07-20 13:11:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:17,490 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:17,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:17,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 13:11:17,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 13:11:17,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 13:11:17,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1257368331] [2020-07-20 13:11:17,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 13:11:17,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 13:11:17,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861175750] [2020-07-20 13:11:17,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 13:11:17,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 13:11:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 13:11:17,530 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 13:11:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:17,595 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 13:11:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 13:11:17,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 13:11:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:17,597 INFO L225 Difference]: With dead ends: 27 [2020-07-20 13:11:17,597 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 13:11:17,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 13:11:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 13:11:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 13:11:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 13:11:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 13:11:17,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 13:11:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:17,607 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 13:11:17,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 13:11:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 13:11:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 13:11:17,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:17,610 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:17,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:17,823 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-20 13:11:17,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:17,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1567675358] [2020-07-20 13:11:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:17,859 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:17,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:17,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 13:11:17,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 13:11:17,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:18,084 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:18,088 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 13:11:18,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1567675358] [2020-07-20 13:11:18,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:18,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-07-20 13:11:18,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398603304] [2020-07-20 13:11:18,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 13:11:18,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 13:11:18,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-20 13:11:18,130 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2020-07-20 13:11:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:18,264 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2020-07-20 13:11:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 13:11:18,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-20 13:11:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:18,267 INFO L225 Difference]: With dead ends: 39 [2020-07-20 13:11:18,267 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 13:11:18,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-20 13:11:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 13:11:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-20 13:11:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 13:11:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 13:11:18,278 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 26 [2020-07-20 13:11:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:18,279 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 13:11:18,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 13:11:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 13:11:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-20 13:11:18,282 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:18,282 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:18,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:18,497 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1708682098, now seen corresponding path program 1 times [2020-07-20 13:11:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:18,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132561927] [2020-07-20 13:11:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:18,552 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:18,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:18,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 13:11:18,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2020-07-20 13:11:18,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:18,907 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:18,908 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:18,957 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-07-20 13:11:18,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132561927] [2020-07-20 13:11:18,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:18,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2020-07-20 13:11:18,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528777679] [2020-07-20 13:11:19,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 13:11:19,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 13:11:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-20 13:11:19,001 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 12 states. [2020-07-20 13:11:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:19,166 INFO L93 Difference]: Finished difference Result 57 states and 114 transitions. [2020-07-20 13:11:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 13:11:19,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2020-07-20 13:11:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:19,170 INFO L225 Difference]: With dead ends: 57 [2020-07-20 13:11:19,171 INFO L226 Difference]: Without dead ends: 51 [2020-07-20 13:11:19,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-20 13:11:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-20 13:11:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2020-07-20 13:11:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 13:11:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 13:11:19,187 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 67 [2020-07-20 13:11:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:19,188 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 13:11:19,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 13:11:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 13:11:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-20 13:11:19,191 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:19,192 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:19,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:19,406 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1655086695, now seen corresponding path program 2 times [2020-07-20 13:11:19,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:19,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20093215] [2020-07-20 13:11:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:19,514 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:19,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:19,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 13:11:19,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 69 proven. 379 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2020-07-20 13:11:19,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:20,397 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:20,569 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:20,670 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:20,671 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:20,718 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:20,719 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 69 proven. 401 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2020-07-20 13:11:20,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20093215] [2020-07-20 13:11:20,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:20,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2020-07-20 13:11:20,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654496722] [2020-07-20 13:11:20,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 13:11:20,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:20,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 13:11:20,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-07-20 13:11:20,802 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 16 states. [2020-07-20 13:11:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:21,166 INFO L93 Difference]: Finished difference Result 72 states and 183 transitions. [2020-07-20 13:11:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 13:11:21,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2020-07-20 13:11:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:21,174 INFO L225 Difference]: With dead ends: 72 [2020-07-20 13:11:21,174 INFO L226 Difference]: Without dead ends: 66 [2020-07-20 13:11:21,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 289 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2020-07-20 13:11:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-20 13:11:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-20 13:11:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 13:11:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 13:11:21,198 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 156 [2020-07-20 13:11:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:21,199 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 13:11:21,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 13:11:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 13:11:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-20 13:11:21,203 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:21,204 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 31, 19, 19, 19, 19, 19, 19, 19, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:21,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:21,416 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash -700634023, now seen corresponding path program 2 times [2020-07-20 13:11:21,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:21,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1502633942] [2020-07-20 13:11:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:21,543 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:21,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:21,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 13:11:21,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 142 proven. 942 refuted. 0 times theorem prover too weak. 3029 trivial. 0 not checked. [2020-07-20 13:11:21,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:22,889 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:23,189 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:23,341 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:23,422 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:23,473 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:23,474 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 142 proven. 982 refuted. 0 times theorem prover too weak. 2989 trivial. 0 not checked. [2020-07-20 13:11:23,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1502633942] [2020-07-20 13:11:23,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:23,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 18 [2020-07-20 13:11:23,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657085759] [2020-07-20 13:11:23,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 13:11:23,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 13:11:23,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-07-20 13:11:23,585 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 18 states. [2020-07-20 13:11:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:23,906 INFO L93 Difference]: Finished difference Result 87 states and 270 transitions. [2020-07-20 13:11:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 13:11:23,906 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 272 [2020-07-20 13:11:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:23,911 INFO L225 Difference]: With dead ends: 87 [2020-07-20 13:11:23,911 INFO L226 Difference]: Without dead ends: 81 [2020-07-20 13:11:23,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 516 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-07-20 13:11:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-20 13:11:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2020-07-20 13:11:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 13:11:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 13:11:23,935 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 272 [2020-07-20 13:11:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:23,936 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 13:11:23,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 13:11:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 13:11:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2020-07-20 13:11:23,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:23,957 INFO L422 BasicCegarLoop]: trace histogram [133, 133, 67, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:24,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:24,172 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1816565800, now seen corresponding path program 3 times [2020-07-20 13:11:24,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:24,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823862666] [2020-07-20 13:11:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:24,460 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:24,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:24,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 13:11:24,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 764 proven. 4420 refuted. 0 times theorem prover too weak. 40653 trivial. 0 not checked. [2020-07-20 13:11:24,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:28,008 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:29,110 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:29,609 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:29,954 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:29,956 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:30,149 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:30,150 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:30,240 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:30,241 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:30,291 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:30,292 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 764 proven. 4490 refuted. 0 times theorem prover too weak. 40583 trivial. 0 not checked. [2020-07-20 13:11:30,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823862666] [2020-07-20 13:11:30,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:30,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 20 [2020-07-20 13:11:30,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857457819] [2020-07-20 13:11:30,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-20 13:11:30,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:30,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-20 13:11:30,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-20 13:11:30,636 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 20 states. [2020-07-20 13:11:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:31,042 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-20 13:11:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 13:11:31,043 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 871 [2020-07-20 13:11:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:31,051 INFO L225 Difference]: With dead ends: 92 [2020-07-20 13:11:31,052 INFO L226 Difference]: Without dead ends: 88 [2020-07-20 13:11:31,053 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1750 GetRequests, 1707 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2020-07-20 13:11:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-20 13:11:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-20 13:11:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 13:11:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 13:11:31,074 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 871 [2020-07-20 13:11:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:31,076 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 13:11:31,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-20 13:11:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 13:11:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2020-07-20 13:11:31,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:31,118 INFO L422 BasicCegarLoop]: trace histogram [155, 155, 130, 77, 77, 77, 77, 77, 77, 77, 53, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:31,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:31,333 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:31,334 INFO L82 PathProgramCache]: Analyzing trace with hash -44594725, now seen corresponding path program 3 times [2020-07-20 13:11:31,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:31,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [814551462] [2020-07-20 13:11:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:31,717 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:31,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:31,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 1931 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 13:11:31,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 67829 backedges. 10367 proven. 120 refuted. 0 times theorem prover too weak. 57342 trivial. 0 not checked. [2020-07-20 13:11:32,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:36,523 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:36,572 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:36,573 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:36,810 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:36,812 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:36,855 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:36,857 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 67829 backedges. 1020 proven. 6126 refuted. 0 times theorem prover too weak. 60683 trivial. 0 not checked. [2020-07-20 13:11:37,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [814551462] [2020-07-20 13:11:37,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:37,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2020-07-20 13:11:37,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711879280] [2020-07-20 13:11:37,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 13:11:37,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:37,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 13:11:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-20 13:11:37,329 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 17 states. [2020-07-20 13:11:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:37,712 INFO L93 Difference]: Finished difference Result 114 states and 313 transitions. [2020-07-20 13:11:37,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 13:11:37,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1067 [2020-07-20 13:11:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:37,714 INFO L225 Difference]: With dead ends: 114 [2020-07-20 13:11:37,714 INFO L226 Difference]: Without dead ends: 64 [2020-07-20 13:11:37,718 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2145 GetRequests, 2105 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2020-07-20 13:11:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-20 13:11:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-20 13:11:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-20 13:11:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2020-07-20 13:11:37,730 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 1067 [2020-07-20 13:11:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:37,730 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2020-07-20 13:11:37,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 13:11:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2020-07-20 13:11:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2020-07-20 13:11:37,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:37,737 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 68, 41, 41, 41, 41, 41, 41, 41, 27, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:37,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:37,945 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1053586695, now seen corresponding path program 4 times [2020-07-20 13:11:37,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:37,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455884130] [2020-07-20 13:11:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:38,164 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:38,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:38,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 13:11:38,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19170 backedges. 6851 proven. 276 refuted. 0 times theorem prover too weak. 12043 trivial. 0 not checked. [2020-07-20 13:11:38,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:41,548 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:41,549 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:41,641 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:41,642 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:41,699 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:42,084 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:42,173 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:42,222 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:42,223 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19170 backedges. 737 proven. 3501 refuted. 0 times theorem prover too weak. 14932 trivial. 0 not checked. [2020-07-20 13:11:42,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455884130] [2020-07-20 13:11:42,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:42,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 21 [2020-07-20 13:11:42,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174688615] [2020-07-20 13:11:42,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 13:11:42,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:42,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 13:11:42,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-20 13:11:42,413 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 21 states. [2020-07-20 13:11:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:42,950 INFO L93 Difference]: Finished difference Result 134 states and 258 transitions. [2020-07-20 13:11:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-20 13:11:42,951 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 573 [2020-07-20 13:11:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:42,954 INFO L225 Difference]: With dead ends: 134 [2020-07-20 13:11:42,954 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 13:11:42,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1109 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2020-07-20 13:11:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 13:11:42,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2020-07-20 13:11:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-20 13:11:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2020-07-20 13:11:42,966 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 573 [2020-07-20 13:11:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:42,967 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2020-07-20 13:11:42,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 13:11:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2020-07-20 13:11:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2020-07-20 13:11:42,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:42,972 INFO L422 BasicCegarLoop]: trace histogram [95, 95, 77, 47, 47, 47, 47, 47, 47, 47, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:43,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:43,184 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:43,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1925755229, now seen corresponding path program 5 times [2020-07-20 13:11:43,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:43,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065813675] [2020-07-20 13:11:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:43,451 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:11:43,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:43,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 13:11:43,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 11719 proven. 839 refuted. 0 times theorem prover too weak. 12552 trivial. 0 not checked. [2020-07-20 13:11:43,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:47,329 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:47,492 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:47,586 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:47,646 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:48,267 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:48,268 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:48,441 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:48,535 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:48,536 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:48,588 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 988 proven. 4592 refuted. 0 times theorem prover too weak. 19530 trivial. 0 not checked. [2020-07-20 13:11:48,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065813675] [2020-07-20 13:11:48,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:48,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 25 [2020-07-20 13:11:48,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464190258] [2020-07-20 13:11:48,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-20 13:11:48,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-20 13:11:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-07-20 13:11:48,815 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand 25 states. [2020-07-20 13:11:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:49,594 INFO L93 Difference]: Finished difference Result 159 states and 279 transitions. [2020-07-20 13:11:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-20 13:11:49,595 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 654 [2020-07-20 13:11:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:49,597 INFO L225 Difference]: With dead ends: 159 [2020-07-20 13:11:49,598 INFO L226 Difference]: Without dead ends: 93 [2020-07-20 13:11:49,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1328 GetRequests, 1263 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2020-07-20 13:11:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-20 13:11:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2020-07-20 13:11:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-20 13:11:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2020-07-20 13:11:49,611 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 654 [2020-07-20 13:11:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:49,614 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2020-07-20 13:11:49,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-20 13:11:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2020-07-20 13:11:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-07-20 13:11:49,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:49,620 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:49,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:49,829 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 6 times [2020-07-20 13:11:49,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:49,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461925345] [2020-07-20 13:11:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:50,111 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 13:11:50,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:11:50,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-20 13:11:50,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:11:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3340 refuted. 0 times theorem prover too weak. 11128 trivial. 0 not checked. [2020-07-20 13:11:50,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:11:53,206 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:53,676 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:53,955 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:53,956 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:54,129 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:54,230 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:54,295 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:55,866 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:55,867 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,324 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,325 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,604 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,605 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,778 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,779 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,890 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:56,945 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:11:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2020-07-20 13:11:57,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461925345] [2020-07-20 13:11:57,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:11:57,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 33 [2020-07-20 13:11:57,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102054065] [2020-07-20 13:11:57,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-20 13:11:57,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:11:57,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-20 13:11:57,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2020-07-20 13:11:57,188 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 33 states. [2020-07-20 13:11:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:11:58,685 INFO L93 Difference]: Finished difference Result 215 states and 403 transitions. [2020-07-20 13:11:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-20 13:11:58,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 531 [2020-07-20 13:11:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:11:58,689 INFO L225 Difference]: With dead ends: 215 [2020-07-20 13:11:58,690 INFO L226 Difference]: Without dead ends: 137 [2020-07-20 13:11:58,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1001 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=987, Invalid=3045, Unknown=0, NotChecked=0, Total=4032 [2020-07-20 13:11:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-20 13:11:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2020-07-20 13:11:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-20 13:11:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2020-07-20 13:11:58,706 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 531 [2020-07-20 13:11:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:11:58,707 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2020-07-20 13:11:58,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-20 13:11:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2020-07-20 13:11:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-20 13:11:58,711 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:11:58,711 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:11:58,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:58,925 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:11:58,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:11:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 7 times [2020-07-20 13:11:58,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:11:58,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475521388] [2020-07-20 13:11:58,926 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:59,251 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 13:11:59,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 13:11:59,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 13:11:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 13:11:59,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 13:11:59,452 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 13:11:59,453 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 13:11:59,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:11:59,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 01:11:59 BoogieIcfgContainer [2020-07-20 13:11:59,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 13:11:59,822 INFO L168 Benchmark]: Toolchain (without parser) took 43701.54 ms. Allocated memory was 144.7 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 101.9 MB in the beginning and 547.1 MB in the end (delta: -445.3 MB). Peak memory consumption was 648.4 MB. Max. memory is 7.1 GB. [2020-07-20 13:11:59,823 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 13:11:59,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.75 ms. Allocated memory is still 144.7 MB. Free memory was 101.4 MB in the beginning and 92.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-20 13:11:59,824 INFO L168 Benchmark]: Boogie Preprocessor took 110.03 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 92.2 MB in the beginning and 180.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-20 13:11:59,825 INFO L168 Benchmark]: RCFGBuilder took 249.72 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 167.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-07-20 13:11:59,826 INFO L168 Benchmark]: TraceAbstraction took 43094.87 ms. Allocated memory was 201.3 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 167.8 MB in the beginning and 547.1 MB in the end (delta: -379.3 MB). Peak memory consumption was 657.7 MB. Max. memory is 7.1 GB. [2020-07-20 13:11:59,830 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 240.75 ms. Allocated memory is still 144.7 MB. Free memory was 101.4 MB in the beginning and 92.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.03 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 92.2 MB in the beginning and 180.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 249.72 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 167.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43094.87 ms. Allocated memory was 201.3 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 167.8 MB in the beginning and 547.1 MB in the end (delta: -379.3 MB). Peak memory consumption was 657.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.8s, OverallIterations: 12, TraceHistogramMax: 155, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 229 SDtfs, 1125 SDslu, 1054 SDs, 0 SdLazy, 1627 SolverSat, 1734 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8564 GetRequests, 8169 SyntacticMatches, 125 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 137 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 4707 NumberOfCodeBlocks, 3790 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 8441 ConstructedInterpolants, 0 QuantifiedInterpolants, 7465029 SizeOfPredicates, 84 NumberOfNonLiveVariables, 7965 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 325870/359896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...