/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 BIGGEST_EQUIVALENCE_CLASS --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-21 00:31:59,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 00:31:59,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 00:31:59,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 00:31:59,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 00:31:59,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 00:31:59,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 00:31:59,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 00:31:59,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 00:31:59,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 00:31:59,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 00:31:59,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 00:31:59,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 00:31:59,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 00:31:59,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 00:31:59,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 00:31:59,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 00:31:59,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 00:31:59,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 00:31:59,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 00:31:59,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 00:31:59,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 00:31:59,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 00:31:59,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 00:31:59,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 00:31:59,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 00:31:59,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 00:31:59,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 00:31:59,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 00:31:59,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 00:31:59,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 00:31:59,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 00:31:59,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 00:31:59,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 00:31:59,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 00:31:59,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 00:31:59,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 00:31:59,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 00:31:59,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 00:31:59,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 00:31:59,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 00:31:59,962 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 00:31:59,976 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 00:31:59,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 00:31:59,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 00:31:59,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 00:31:59,978 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 00:31:59,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 00:31:59,979 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 00:31:59,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 00:31:59,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 00:31:59,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 00:31:59,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 00:31:59,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 00:31:59,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 00:31:59,980 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 00:31:59,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 00:31:59,981 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 00:31:59,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 00:31:59,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 00:31:59,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 00:31:59,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 00:31:59,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 00:31:59,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 00:31:59,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 00:31:59,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 00:31:59,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 00:31:59,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 00:31:59,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:31:59,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 00:31:59,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 00:31:59,983 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 -> BIGGEST_EQUIVALENCE_CLASS 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-21 00:32:00,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 00:32:00,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 00:32:00,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 00:32:00,293 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 00:32:00,295 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 00:32:00,296 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 00:32:00,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e651cdef/53bc4e5b093149208b4515912ee04004/FLAG1a2adae30 [2020-07-21 00:32:00,858 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 00:32:00,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 00:32:00,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e651cdef/53bc4e5b093149208b4515912ee04004/FLAG1a2adae30 [2020-07-21 00:32:01,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e651cdef/53bc4e5b093149208b4515912ee04004 [2020-07-21 00:32:01,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 00:32:01,241 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 00:32:01,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 00:32:01,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 00:32:01,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 00:32:01,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21859794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01, skipping insertion in model container [2020-07-21 00:32:01,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 00:32:01,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 00:32:01,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 00:32:01,455 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 00:32:01,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 00:32:01,480 INFO L208 MainTranslator]: Completed translation [2020-07-21 00:32:01,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01 WrapperNode [2020-07-21 00:32:01,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 00:32:01,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 00:32:01,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 00:32:01,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 00:32:01,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... [2020-07-21 00:32:01,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 00:32:01,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 00:32:01,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 00:32:01,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 00:32:01,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 00:32:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 00:32:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 00:32:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-21 00:32:01,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 00:32:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 00:32:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 00:32:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-21 00:32:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 00:32:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 00:32:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 00:32:01,831 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 00:32:01,831 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 00:32:01,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:32:01 BoogieIcfgContainer [2020-07-21 00:32:01,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 00:32:01,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 00:32:01,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 00:32:01,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 00:32:01,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:32:01" (1/3) ... [2020-07-21 00:32:01,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a9d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:32:01, skipping insertion in model container [2020-07-21 00:32:01,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:32:01" (2/3) ... [2020-07-21 00:32:01,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a9d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:32:01, skipping insertion in model container [2020-07-21 00:32:01,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:32:01" (3/3) ... [2020-07-21 00:32:01,845 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-21 00:32:01,857 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 00:32:01,865 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 00:32:01,881 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 00:32:01,912 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 00:32:01,912 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 00:32:01,912 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 00:32:01,913 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 00:32:01,913 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 00:32:01,913 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 00:32:01,913 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 00:32:01,914 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 00:32:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-21 00:32:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 00:32:01,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:01,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:01,948 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-21 00:32:01,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:01,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846985038] [2020-07-21 00:32:01,971 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-21 00:32:02,126 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 00:32:02,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:02,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 00:32:02,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 00:32:02,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 00:32:02,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [846985038] [2020-07-21 00:32:02,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 00:32:02,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 00:32:02,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322106084] [2020-07-21 00:32:02,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 00:32:02,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 00:32:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 00:32:02,275 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-21 00:32:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:02,402 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 00:32:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 00:32:02,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 00:32:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:02,416 INFO L225 Difference]: With dead ends: 35 [2020-07-21 00:32:02,416 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 00:32:02,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 00:32:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 00:32:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 00:32:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 00:32:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 00:32:02,467 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 00:32:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:02,468 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 00:32:02,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 00:32:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 00:32:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 00:32:02,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:02,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:02,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:02,677 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-21 00:32:02,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:02,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1800758157] [2020-07-21 00:32:02,679 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-21 00:32:02,705 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 00:32:02,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:02,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 00:32:02,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 00:32:02,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 00:32:02,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1800758157] [2020-07-21 00:32:02,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 00:32:02,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 00:32:02,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006764478] [2020-07-21 00:32:02,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 00:32:02,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 00:32:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 00:32:02,745 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 00:32:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:02,833 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 00:32:02,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 00:32:02,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 00:32:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:02,836 INFO L225 Difference]: With dead ends: 27 [2020-07-21 00:32:02,836 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 00:32:02,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 00:32:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 00:32:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 00:32:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 00:32:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 00:32:02,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 00:32:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:02,853 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 00:32:02,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 00:32:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 00:32:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 00:32:02,857 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:02,858 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:03,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:03,070 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:03,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-21 00:32:03,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:03,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868013745] [2020-07-21 00:32:03,072 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-21 00:32:03,101 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:32:03,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:03,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 00:32:03,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 00:32:03,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 00:32:03,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [868013745] [2020-07-21 00:32:03,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 00:32:03,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 00:32:03,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459363041] [2020-07-21 00:32:03,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 00:32:03,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:03,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 00:32:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-21 00:32:03,174 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-07-21 00:32:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:03,290 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-21 00:32:03,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 00:32:03,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-21 00:32:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:03,291 INFO L225 Difference]: With dead ends: 38 [2020-07-21 00:32:03,292 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 00:32:03,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-21 00:32:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 00:32:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-21 00:32:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-21 00:32:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-21 00:32:03,301 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-21 00:32:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:03,301 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-21 00:32:03,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 00:32:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-21 00:32:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 00:32:03,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:03,304 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:03,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:03,518 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-07-21 00:32:03,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:03,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045574311] [2020-07-21 00:32:03,520 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-21 00:32:03,560 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 00:32:03,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:03,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 00:32:03,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 00:32:03,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:32:03,774 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:03,777 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 00:32:03,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045574311] [2020-07-21 00:32:03,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:32:03,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-07-21 00:32:03,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408944083] [2020-07-21 00:32:03,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-21 00:32:03,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-21 00:32:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-21 00:32:03,820 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2020-07-21 00:32:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:03,959 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-07-21 00:32:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 00:32:03,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-21 00:32:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:03,962 INFO L225 Difference]: With dead ends: 39 [2020-07-21 00:32:03,962 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 00:32:03,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-21 00:32:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 00:32:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-21 00:32:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-21 00:32:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2020-07-21 00:32:03,975 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 27 [2020-07-21 00:32:03,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:03,975 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2020-07-21 00:32:03,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-21 00:32:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2020-07-21 00:32:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-07-21 00:32:03,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:03,979 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:04,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:04,194 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1317930072, now seen corresponding path program 2 times [2020-07-21 00:32:04,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:04,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931146196] [2020-07-21 00:32:04,196 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-21 00:32:04,261 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:32:04,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:04,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 00:32:04,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 221 proven. 13 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-07-21 00:32:04,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:32:04,822 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 58 proven. 126 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2020-07-21 00:32:04,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931146196] [2020-07-21 00:32:04,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:32:04,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2020-07-21 00:32:04,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488647291] [2020-07-21 00:32:04,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 00:32:04,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 00:32:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-21 00:32:04,880 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 11 states. [2020-07-21 00:32:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:05,039 INFO L93 Difference]: Finished difference Result 65 states and 113 transitions. [2020-07-21 00:32:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 00:32:05,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2020-07-21 00:32:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:05,043 INFO L225 Difference]: With dead ends: 65 [2020-07-21 00:32:05,043 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 00:32:05,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-07-21 00:32:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 00:32:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2020-07-21 00:32:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-21 00:32:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2020-07-21 00:32:05,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 93 [2020-07-21 00:32:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:05,056 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2020-07-21 00:32:05,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 00:32:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2020-07-21 00:32:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 00:32:05,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:05,059 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:05,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:05,263 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2020-07-21 00:32:05,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:05,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196407770] [2020-07-21 00:32:05,266 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-21 00:32:05,315 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 00:32:05,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:05,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 00:32:05,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 170 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-07-21 00:32:05,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:32:05,918 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:05,920 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:05,986 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:05,987 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:06,224 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:06,281 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:06,283 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 182 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2020-07-21 00:32:06,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196407770] [2020-07-21 00:32:06,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:32:06,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2020-07-21 00:32:06,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113428955] [2020-07-21 00:32:06,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 00:32:06,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 00:32:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-21 00:32:06,325 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 17 states. [2020-07-21 00:32:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:06,739 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2020-07-21 00:32:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 00:32:06,740 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2020-07-21 00:32:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:06,751 INFO L225 Difference]: With dead ends: 78 [2020-07-21 00:32:06,752 INFO L226 Difference]: Without dead ends: 49 [2020-07-21 00:32:06,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 167 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2020-07-21 00:32:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-21 00:32:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-21 00:32:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-21 00:32:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2020-07-21 00:32:06,764 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 96 [2020-07-21 00:32:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:06,765 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2020-07-21 00:32:06,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 00:32:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2020-07-21 00:32:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-21 00:32:06,767 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:06,767 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:06,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:06,983 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:06,984 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 4 times [2020-07-21 00:32:06,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:06,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198208232] [2020-07-21 00:32:06,985 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-21 00:32:07,057 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 00:32:07,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:07,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 00:32:07,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-07-21 00:32:07,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:32:07,712 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:07,713 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:07,884 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:07,884 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:07,984 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:07,986 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:08,047 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:08,048 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-07-21 00:32:08,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198208232] [2020-07-21 00:32:08,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:32:08,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2020-07-21 00:32:08,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106396706] [2020-07-21 00:32:08,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 00:32:08,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 00:32:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-07-21 00:32:08,109 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 16 states. [2020-07-21 00:32:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:08,340 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2020-07-21 00:32:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 00:32:08,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2020-07-21 00:32:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:08,344 INFO L225 Difference]: With dead ends: 65 [2020-07-21 00:32:08,344 INFO L226 Difference]: Without dead ends: 59 [2020-07-21 00:32:08,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 194 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2020-07-21 00:32:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-21 00:32:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-21 00:32:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-21 00:32:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2020-07-21 00:32:08,358 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 109 [2020-07-21 00:32:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:08,358 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2020-07-21 00:32:08,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 00:32:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2020-07-21 00:32:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2020-07-21 00:32:08,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:08,369 INFO L422 BasicCegarLoop]: trace histogram [71, 71, 57, 35, 35, 35, 35, 35, 35, 35, 22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:08,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:08,584 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:08,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash 51219549, now seen corresponding path program 5 times [2020-07-21 00:32:08,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:08,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [849859572] [2020-07-21 00:32:08,587 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-21 00:32:08,688 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:32:08,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:08,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 00:32:08,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 6226 proven. 418 refuted. 0 times theorem prover too weak. 7272 trivial. 0 not checked. [2020-07-21 00:32:08,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:32:11,179 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,180 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,288 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,289 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,349 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,350 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,757 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,876 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,883 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:11,943 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 596 proven. 2877 refuted. 0 times theorem prover too weak. 10443 trivial. 0 not checked. [2020-07-21 00:32:12,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [849859572] [2020-07-21 00:32:12,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:32:12,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 21 [2020-07-21 00:32:12,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797035324] [2020-07-21 00:32:12,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 00:32:12,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:12,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 00:32:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-21 00:32:12,192 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand 21 states. [2020-07-21 00:32:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:12,707 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2020-07-21 00:32:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-21 00:32:12,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 490 [2020-07-21 00:32:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:12,711 INFO L225 Difference]: With dead ends: 124 [2020-07-21 00:32:12,711 INFO L226 Difference]: Without dead ends: 73 [2020-07-21 00:32:12,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 995 GetRequests, 943 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2020-07-21 00:32:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-21 00:32:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2020-07-21 00:32:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-21 00:32:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2020-07-21 00:32:12,726 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 490 [2020-07-21 00:32:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:12,726 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2020-07-21 00:32:12,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 00:32:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2020-07-21 00:32:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-07-21 00:32:12,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:12,733 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:12,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:12,947 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1242507885, now seen corresponding path program 6 times [2020-07-21 00:32:12,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:12,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1094580505] [2020-07-21 00:32:12,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-21 00:32:13,083 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 00:32:13,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:13,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 00:32:13,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 984 proven. 1855 refuted. 0 times theorem prover too weak. 4281 trivial. 0 not checked. [2020-07-21 00:32:13,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:32:15,223 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:15,465 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:15,623 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:15,624 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:15,713 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:15,715 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:15,770 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:15,771 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:16,737 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:17,007 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:17,008 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:17,180 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:17,181 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:17,281 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:17,339 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 984 proven. 1930 refuted. 0 times theorem prover too weak. 4206 trivial. 0 not checked. [2020-07-21 00:32:17,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1094580505] [2020-07-21 00:32:17,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:32:17,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 29 [2020-07-21 00:32:17,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573276785] [2020-07-21 00:32:17,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-21 00:32:17,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-21 00:32:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-21 00:32:17,469 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 29 states. [2020-07-21 00:32:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:18,503 INFO L93 Difference]: Finished difference Result 173 states and 311 transitions. [2020-07-21 00:32:18,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-21 00:32:18,504 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 354 [2020-07-21 00:32:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:18,508 INFO L225 Difference]: With dead ends: 173 [2020-07-21 00:32:18,508 INFO L226 Difference]: Without dead ends: 112 [2020-07-21 00:32:18,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 655 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=747, Invalid=2223, Unknown=0, NotChecked=0, Total=2970 [2020-07-21 00:32:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-21 00:32:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2020-07-21 00:32:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-21 00:32:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2020-07-21 00:32:18,526 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 354 [2020-07-21 00:32:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:18,527 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2020-07-21 00:32:18,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-21 00:32:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2020-07-21 00:32:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-07-21 00:32:18,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:18,531 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:18,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:18,733 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1052494023, now seen corresponding path program 7 times [2020-07-21 00:32:18,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:18,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [346400924] [2020-07-21 00:32:18,735 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-21 00:32:18,955 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 00:32:18,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:32:18,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-21 00:32:18,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:32:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3803 refuted. 0 times theorem prover too weak. 13331 trivial. 0 not checked. [2020-07-21 00:32:19,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:32:22,068 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:22,069 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:22,522 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:22,809 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:23,019 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:23,130 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:23,131 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:23,190 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:24,647 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,069 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,383 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,553 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,554 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,653 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,654 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,711 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:32:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3911 refuted. 0 times theorem prover too weak. 13223 trivial. 0 not checked. [2020-07-21 00:32:25,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [346400924] [2020-07-21 00:32:25,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:32:25,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 33 [2020-07-21 00:32:25,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115084376] [2020-07-21 00:32:25,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-21 00:32:25,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:32:25,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-21 00:32:25,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2020-07-21 00:32:25,890 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 33 states. [2020-07-21 00:32:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:32:27,304 INFO L93 Difference]: Finished difference Result 220 states and 368 transitions. [2020-07-21 00:32:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-21 00:32:27,305 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 572 [2020-07-21 00:32:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:32:27,310 INFO L225 Difference]: With dead ends: 220 [2020-07-21 00:32:27,311 INFO L226 Difference]: Without dead ends: 130 [2020-07-21 00:32:27,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1083 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-21 00:32:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-21 00:32:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2020-07-21 00:32:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-21 00:32:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2020-07-21 00:32:27,339 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 572 [2020-07-21 00:32:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:32:27,341 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2020-07-21 00:32:27,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-21 00:32:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2020-07-21 00:32:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-21 00:32:27,344 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:32:27,344 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:32:27,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:27,558 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:32:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:32:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 8 times [2020-07-21 00:32:27,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:32:27,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [456156167] [2020-07-21 00:32:27,560 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-21 00:32:27,825 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 00:32:27,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 00:32:27,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 00:32:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 00:32:27,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 00:32:27,988 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 00:32:27,988 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 00:32:28,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:32:28,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 12:32:28 BoogieIcfgContainer [2020-07-21 00:32:28,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 00:32:28,292 INFO L168 Benchmark]: Toolchain (without parser) took 27051.15 ms. Allocated memory was 135.8 MB in the beginning and 665.8 MB in the end (delta: 530.1 MB). Free memory was 101.0 MB in the beginning and 317.7 MB in the end (delta: -216.8 MB). Peak memory consumption was 313.3 MB. Max. memory is 7.1 GB. [2020-07-21 00:32:28,293 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 135.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 00:32:28,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.93 ms. Allocated memory is still 135.8 MB. Free memory was 100.5 MB in the beginning and 91.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-21 00:32:28,294 INFO L168 Benchmark]: Boogie Preprocessor took 24.01 ms. Allocated memory is still 135.8 MB. Free memory was 91.4 MB in the beginning and 90.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 00:32:28,295 INFO L168 Benchmark]: RCFGBuilder took 329.73 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.8 MB in the beginning and 167.8 MB in the end (delta: -78.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-21 00:32:28,296 INFO L168 Benchmark]: TraceAbstraction took 26452.04 ms. Allocated memory was 199.8 MB in the beginning and 665.8 MB in the end (delta: 466.1 MB). Free memory was 167.1 MB in the beginning and 317.7 MB in the end (delta: -150.6 MB). Peak memory consumption was 315.5 MB. Max. memory is 7.1 GB. [2020-07-21 00:32:28,299 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.55 ms. Allocated memory is still 135.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.93 ms. Allocated memory is still 135.8 MB. Free memory was 100.5 MB in the beginning and 91.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.01 ms. Allocated memory is still 135.8 MB. Free memory was 91.4 MB in the beginning and 90.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 329.73 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.8 MB in the beginning and 167.8 MB in the end (delta: -78.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26452.04 ms. Allocated memory was 199.8 MB in the beginning and 665.8 MB in the end (delta: 466.1 MB). Free memory was 167.1 MB in the beginning and 317.7 MB in the end (delta: -150.6 MB). Peak memory consumption was 315.5 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: 26.2s, OverallIterations: 11, TraceHistogramMax: 83, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 226 SDtfs, 1124 SDslu, 837 SDs, 0 SdLazy, 1480 SolverSat, 1480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3636 GetRequests, 3296 SyntacticMatches, 103 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 2257 NumberOfCodeBlocks, 1578 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3518 ConstructedInterpolants, 0 QuantifiedInterpolants, 2163709 SizeOfPredicates, 70 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 67327/83110 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...