/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 15:45:11,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 15:45:11,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 15:45:11,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 15:45:11,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 15:45:11,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 15:45:11,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 15:45:11,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 15:45:11,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 15:45:11,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 15:45:11,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 15:45:11,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 15:45:11,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 15:45:11,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 15:45:11,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 15:45:11,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 15:45:11,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 15:45:11,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 15:45:11,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 15:45:11,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 15:45:11,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 15:45:11,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 15:45:11,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 15:45:11,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 15:45:11,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 15:45:11,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 15:45:11,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 15:45:11,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 15:45:11,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 15:45:11,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 15:45:11,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 15:45:11,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 15:45:11,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 15:45:11,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 15:45:11,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 15:45:11,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 15:45:11,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 15:45:11,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 15:45:11,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 15:45:11,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 15:45:11,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 15:45:11,957 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 15:45:11,972 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 15:45:11,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 15:45:11,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 15:45:11,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 15:45:11,974 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 15:45:11,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 15:45:11,974 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 15:45:11,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 15:45:11,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 15:45:11,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 15:45:11,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 15:45:11,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 15:45:11,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 15:45:11,977 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 15:45:11,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 15:45:11,978 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 15:45:11,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 15:45:11,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 15:45:11,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 15:45:11,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 15:45:11,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 15:45:11,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 15:45:11,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 15:45:11,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 15:45:11,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 15:45:11,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 15:45:11,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:11,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 15:45:11,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 15:45:11,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 -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 15:45:12,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 15:45:12,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 15:45:12,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 15:45:12,350 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 15:45:12,350 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 15:45:12,351 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 15:45:12,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f1975f2/2e16a909aa85416a930551ffbabb0c7a/FLAGce9040e5e [2020-07-21 15:45:12,808 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 15:45:12,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-21 15:45:12,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f1975f2/2e16a909aa85416a930551ffbabb0c7a/FLAGce9040e5e [2020-07-21 15:45:13,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f1975f2/2e16a909aa85416a930551ffbabb0c7a [2020-07-21 15:45:13,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 15:45:13,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 15:45:13,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 15:45:13,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 15:45:13,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 15:45:13,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c28b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13, skipping insertion in model container [2020-07-21 15:45:13,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 15:45:13,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 15:45:13,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 15:45:13,432 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 15:45:13,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 15:45:13,463 INFO L208 MainTranslator]: Completed translation [2020-07-21 15:45:13,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13 WrapperNode [2020-07-21 15:45:13,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 15:45:13,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 15:45:13,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 15:45:13,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 15:45:13,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (1/1) ... [2020-07-21 15:45:13,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 15:45:13,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 15:45:13,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 15:45:13,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 15:45:13,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (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 15:45:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 15:45:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 15:45:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-21 15:45:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 15:45:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 15:45:13,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 15:45:13,663 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-21 15:45:13,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 15:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 15:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 15:45:13,833 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 15:45:13,834 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 15:45:13,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:45:13 BoogieIcfgContainer [2020-07-21 15:45:13,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 15:45:13,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 15:45:13,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 15:45:13,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 15:45:13,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:45:13" (1/3) ... [2020-07-21 15:45:13,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d28f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:45:13, skipping insertion in model container [2020-07-21 15:45:13,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:45:13" (2/3) ... [2020-07-21 15:45:13,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d28f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:45:13, skipping insertion in model container [2020-07-21 15:45:13,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:45:13" (3/3) ... [2020-07-21 15:45:13,846 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-21 15:45:13,857 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 15:45:13,865 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 15:45:13,879 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 15:45:13,903 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 15:45:13,903 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 15:45:13,903 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 15:45:13,904 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 15:45:13,904 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 15:45:13,904 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 15:45:13,904 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 15:45:13,904 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 15:45:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-21 15:45:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 15:45:13,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:13,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:13,928 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:13,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:13,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-21 15:45:13,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:13,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1764088602] [2020-07-21 15:45:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:14,014 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:45:14,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:14,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 15:45:14,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:14,112 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 15:45:14,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 15:45:14,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1764088602] [2020-07-21 15:45:14,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 15:45:14,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 15:45:14,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142453374] [2020-07-21 15:45:14,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 15:45:14,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 15:45:14,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 15:45:14,140 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-21 15:45:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:14,268 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 15:45:14,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 15:45:14,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 15:45:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:14,281 INFO L225 Difference]: With dead ends: 35 [2020-07-21 15:45:14,282 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 15:45:14,285 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 15:45:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 15:45:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 15:45:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 15:45:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 15:45:14,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 15:45:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:14,331 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 15:45:14,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 15:45:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 15:45:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 15:45:14,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:14,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:14,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:14,543 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-21 15:45:14,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:14,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1724440072] [2020-07-21 15:45:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:14,573 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:45:14,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:14,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 15:45:14,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:14,612 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 15:45:14,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 15:45:14,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1724440072] [2020-07-21 15:45:14,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 15:45:14,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 15:45:14,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616843038] [2020-07-21 15:45:14,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 15:45:14,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:14,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 15:45:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 15:45:14,618 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 15:45:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:14,684 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 15:45:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 15:45:14,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 15:45:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:14,687 INFO L225 Difference]: With dead ends: 27 [2020-07-21 15:45:14,687 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 15:45:14,688 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 15:45:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 15:45:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 15:45:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 15:45:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 15:45:14,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 15:45:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:14,698 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 15:45:14,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 15:45:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 15:45:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 15:45:14,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:14,700 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 15:45:14,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:14,915 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:14,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-21 15:45:14,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:14,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966787975] [2020-07-21 15:45:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:14,977 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:14,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:14,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 15:45:14,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-21 15:45:15,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:15,245 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:15,252 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 15:45:15,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966787975] [2020-07-21 15:45:15,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:15,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-07-21 15:45:15,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539334483] [2020-07-21 15:45:15,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-21 15:45:15,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-21 15:45:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-21 15:45:15,297 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2020-07-21 15:45:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:15,429 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2020-07-21 15:45:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 15:45:15,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-21 15:45:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:15,433 INFO L225 Difference]: With dead ends: 39 [2020-07-21 15:45:15,433 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 15:45:15,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-07-21 15:45:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 15:45:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-21 15:45:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 15:45:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 15:45:15,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 26 [2020-07-21 15:45:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:15,446 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 15:45:15,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-21 15:45:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 15:45:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-21 15:45:15,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:15,450 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:15,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:15,666 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1708682098, now seen corresponding path program 1 times [2020-07-21 15:45:15,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:15,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45100921] [2020-07-21 15:45:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:15,717 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:45:15,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:15,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 15:45:15,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 58 proven. 68 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-21 15:45:15,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:16,253 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:16,319 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:16,460 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 58 proven. 77 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-07-21 15:45:16,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [45100921] [2020-07-21 15:45:16,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:16,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 17 [2020-07-21 15:45:16,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725241765] [2020-07-21 15:45:16,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 15:45:16,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 15:45:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-07-21 15:45:16,498 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 17 states. [2020-07-21 15:45:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:16,868 INFO L93 Difference]: Finished difference Result 74 states and 130 transitions. [2020-07-21 15:45:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 15:45:16,869 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2020-07-21 15:45:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:16,872 INFO L225 Difference]: With dead ends: 74 [2020-07-21 15:45:16,872 INFO L226 Difference]: Without dead ends: 49 [2020-07-21 15:45:16,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2020-07-21 15:45:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-21 15:45:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-21 15:45:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 15:45:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2020-07-21 15:45:16,885 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 67 [2020-07-21 15:45:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:16,886 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2020-07-21 15:45:16,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 15:45:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-21 15:45:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-21 15:45:16,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:16,889 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:17,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:17,094 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 2 times [2020-07-21 15:45:17,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:17,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001637628] [2020-07-21 15:45:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:17,149 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:17,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:17,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 15:45:17,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-21 15:45:17,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:17,595 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:17,697 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:17,749 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:17,750 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-07-21 15:45:17,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001637628] [2020-07-21 15:45:17,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:17,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2020-07-21 15:45:17,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398682747] [2020-07-21 15:45:17,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-21 15:45:17,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-21 15:45:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-21 15:45:17,783 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 14 states. [2020-07-21 15:45:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:17,978 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2020-07-21 15:45:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 15:45:17,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2020-07-21 15:45:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:17,981 INFO L225 Difference]: With dead ends: 60 [2020-07-21 15:45:17,981 INFO L226 Difference]: Without dead ends: 54 [2020-07-21 15:45:17,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2020-07-21 15:45:17,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-21 15:45:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-21 15:45:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 15:45:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2020-07-21 15:45:17,994 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 68 [2020-07-21 15:45:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:17,995 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2020-07-21 15:45:17,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-21 15:45:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2020-07-21 15:45:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-21 15:45:18,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:18,001 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:18,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:18,215 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1009195755, now seen corresponding path program 3 times [2020-07-21 15:45:18,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:18,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003085326] [2020-07-21 15:45:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:18,303 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:45:18,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:18,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 15:45:18,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 839 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2020-07-21 15:45:18,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:19,755 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:19,926 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:20,030 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:20,089 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:20,749 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:20,899 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:20,989 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:20,990 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:21,041 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:21,042 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 891 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2020-07-21 15:45:21,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003085326] [2020-07-21 15:45:21,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:21,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 25 [2020-07-21 15:45:21,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703405629] [2020-07-21 15:45:21,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-21 15:45:21,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-21 15:45:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-07-21 15:45:21,114 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand 25 states. [2020-07-21 15:45:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:21,945 INFO L93 Difference]: Finished difference Result 134 states and 235 transitions. [2020-07-21 15:45:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-21 15:45:21,946 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2020-07-21 15:45:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:21,952 INFO L225 Difference]: With dead ends: 134 [2020-07-21 15:45:21,952 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 15:45:21,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 391 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2020-07-21 15:45:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 15:45:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2020-07-21 15:45:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-21 15:45:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2020-07-21 15:45:21,971 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 218 [2020-07-21 15:45:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:21,972 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2020-07-21 15:45:21,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-21 15:45:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2020-07-21 15:45:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-07-21 15:45:21,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:21,979 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 15:45:22,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:22,193 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:22,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1242507885, now seen corresponding path program 4 times [2020-07-21 15:45:22,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:22,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1803636614] [2020-07-21 15:45:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:22,330 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 15:45:22,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:22,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 15:45:22,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 984 proven. 1850 refuted. 0 times theorem prover too weak. 4286 trivial. 0 not checked. [2020-07-21 15:45:22,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:24,471 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:24,471 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:24,741 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:24,742 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:24,912 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:25,006 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:25,073 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:25,074 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,034 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,035 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,316 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,492 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,493 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,595 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,596 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,647 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,648 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:26,758 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 15:45:26,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1803636614] [2020-07-21 15:45:26,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:26,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 29 [2020-07-21 15:45:26,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889808570] [2020-07-21 15:45:26,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-21 15:45:26,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-21 15:45:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-21 15:45:26,761 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 29 states. [2020-07-21 15:45:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:27,908 INFO L93 Difference]: Finished difference Result 182 states and 293 transitions. [2020-07-21 15:45:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-21 15:45:27,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 354 [2020-07-21 15:45:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:27,917 INFO L225 Difference]: With dead ends: 182 [2020-07-21 15:45:27,917 INFO L226 Difference]: Without dead ends: 109 [2020-07-21 15:45:27,923 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 15:45:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-21 15:45:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2020-07-21 15:45:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-21 15:45:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2020-07-21 15:45:27,941 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 354 [2020-07-21 15:45:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:27,943 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2020-07-21 15:45:27,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-21 15:45:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2020-07-21 15:45:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 15:45:27,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:27,948 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 15:45:28,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:28,161 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 5 times [2020-07-21 15:45:28,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:28,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76289775] [2020-07-21 15:45:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:28,313 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:28,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 15:45:28,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 15:45:28,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 15:45:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-07-21 15:45:28,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 15:45:29,952 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,342 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,607 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,608 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,780 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,781 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,864 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,908 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,909 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 15:45:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2020-07-21 15:45:30,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76289775] [2020-07-21 15:45:30,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 15:45:30,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 18 [2020-07-21 15:45:30,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746832076] [2020-07-21 15:45:30,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 15:45:30,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 15:45:30,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 15:45:30,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-07-21 15:45:30,982 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand 18 states. [2020-07-21 15:45:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 15:45:31,236 INFO L93 Difference]: Finished difference Result 102 states and 139 transitions. [2020-07-21 15:45:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 15:45:31,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 286 [2020-07-21 15:45:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 15:45:31,240 INFO L225 Difference]: With dead ends: 102 [2020-07-21 15:45:31,241 INFO L226 Difference]: Without dead ends: 98 [2020-07-21 15:45:31,241 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 540 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-07-21 15:45:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-21 15:45:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-21 15:45:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-21 15:45:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2020-07-21 15:45:31,255 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 286 [2020-07-21 15:45:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 15:45:31,256 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2020-07-21 15:45:31,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 15:45:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2020-07-21 15:45:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-21 15:45:31,266 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 15:45:31,267 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 15:45:31,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:31,480 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 15:45:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 15:45:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 6 times [2020-07-21 15:45:31,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 15:45:31,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454390009] [2020-07-21 15:45:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:31,734 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 15:45:31,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 15:45:31,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 15:45:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 15:45:31,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 15:45:31,902 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 15:45:31,902 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 15:45:32,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 15:45:32,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:45:32 BoogieIcfgContainer [2020-07-21 15:45:32,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 15:45:32,198 INFO L168 Benchmark]: Toolchain (without parser) took 19009.51 ms. Allocated memory was 148.9 MB in the beginning and 393.7 MB in the end (delta: 244.8 MB). Free memory was 106.7 MB in the beginning and 310.1 MB in the end (delta: -203.5 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2020-07-21 15:45:32,199 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 148.9 MB. Free memory was 125.1 MB in the beginning and 124.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-21 15:45:32,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.06 ms. Allocated memory is still 148.9 MB. Free memory was 106.2 MB in the beginning and 96.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-21 15:45:32,201 INFO L168 Benchmark]: Boogie Preprocessor took 29.82 ms. Allocated memory is still 148.9 MB. Free memory was 96.9 MB in the beginning and 95.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 15:45:32,202 INFO L168 Benchmark]: RCFGBuilder took 342.38 ms. Allocated memory was 148.9 MB in the beginning and 204.5 MB in the end (delta: 55.6 MB). Free memory was 95.5 MB in the beginning and 172.5 MB in the end (delta: -77.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-21 15:45:32,203 INFO L168 Benchmark]: TraceAbstraction took 18356.69 ms. Allocated memory was 204.5 MB in the beginning and 393.7 MB in the end (delta: 189.3 MB). Free memory was 171.9 MB in the beginning and 310.1 MB in the end (delta: -138.2 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2020-07-21 15:45:32,206 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 148.9 MB. Free memory was 125.1 MB in the beginning and 124.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.06 ms. Allocated memory is still 148.9 MB. Free memory was 106.2 MB in the beginning and 96.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.82 ms. Allocated memory is still 148.9 MB. Free memory was 96.9 MB in the beginning and 95.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.38 ms. Allocated memory was 148.9 MB in the beginning and 204.5 MB in the end (delta: 55.6 MB). Free memory was 95.5 MB in the beginning and 172.5 MB in the end (delta: -77.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18356.69 ms. Allocated memory was 204.5 MB in the beginning and 393.7 MB in the end (delta: 189.3 MB). Free memory was 171.9 MB in the beginning and 310.1 MB in the end (delta: -138.2 MB). Peak memory consumption was 51.0 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: 18.2s, OverallIterations: 9, TraceHistogramMax: 67, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 167 SDtfs, 1004 SDslu, 702 SDs, 0 SdLazy, 1052 SolverSat, 1306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2140 GetRequests, 1877 SyntacticMatches, 80 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=8, 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, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 1509 NumberOfCodeBlocks, 1177 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2051 ConstructedInterpolants, 0 QuantifiedInterpolants, 898455 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1869 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 21128/29304 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...