/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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-79ed534 [2020-07-20 05:29:15,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:29:15,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:29:15,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:29:15,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:29:15,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:29:15,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:29:15,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:29:15,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:29:15,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:29:15,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:29:15,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:29:15,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:29:15,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:29:15,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:29:15,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:29:15,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:29:15,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:29:15,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:29:15,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:29:15,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:29:15,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:29:15,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:29:15,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:29:15,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:29:15,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:29:15,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:29:15,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:29:15,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:29:15,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:29:15,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:29:15,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:29:15,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:29:15,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:29:15,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:29:15,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:29:15,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:29:15,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:29:15,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:29:15,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:29:15,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:29:15,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 05:29:15,098 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:29:15,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:29:15,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:29:15,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:29:15,100 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:29:15,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:29:15,101 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:29:15,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:29:15,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:29:15,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:29:15,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:29:15,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:29:15,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:29:15,102 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:29:15,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:29:15,102 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:29:15,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:29:15,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:29:15,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:29:15,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:29:15,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:29:15,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:29:15,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:29:15,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:29:15,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:29:15,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:29:15,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:29:15,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:29:15,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:29:15,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 05:29:15,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:29:15,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:29:15,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:29:15,424 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:29:15,424 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:29:15,425 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-20 05:29:15,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7828994f6/d70d21d2820143f2bf1d77cd48aeff54/FLAG0372f7e34 [2020-07-20 05:29:16,013 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:29:16,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-20 05:29:16,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7828994f6/d70d21d2820143f2bf1d77cd48aeff54/FLAG0372f7e34 [2020-07-20 05:29:16,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7828994f6/d70d21d2820143f2bf1d77cd48aeff54 [2020-07-20 05:29:16,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:29:16,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:29:16,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:29:16,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:29:16,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:29:16,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333f1255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16, skipping insertion in model container [2020-07-20 05:29:16,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:29:16,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:29:16,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:29:16,627 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:29:16,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:29:16,660 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:29:16,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16 WrapperNode [2020-07-20 05:29:16,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:29:16,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:29:16,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:29:16,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:29:16,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... [2020-07-20 05:29:16,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:29:16,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:29:16,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:29:16,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:29:16,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:29:16,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:29:16,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:29:16,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-20 05:29:16,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:29:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:29:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:29:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-20 05:29:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:29:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:29:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:29:17,003 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:29:17,003 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 05:29:17,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:29:17 BoogieIcfgContainer [2020-07-20 05:29:17,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:29:17,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:29:17,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:29:17,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:29:17,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:29:16" (1/3) ... [2020-07-20 05:29:17,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f3853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:29:17, skipping insertion in model container [2020-07-20 05:29:17,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:29:16" (2/3) ... [2020-07-20 05:29:17,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726f3853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:29:17, skipping insertion in model container [2020-07-20 05:29:17,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:29:17" (3/3) ... [2020-07-20 05:29:17,048 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-20 05:29:17,080 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:29:17,103 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 05:29:17,137 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 05:29:17,170 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:29:17,171 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:29:17,171 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:29:17,172 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:29:17,172 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:29:17,172 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:29:17,172 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:29:17,172 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:29:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-20 05:29:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 05:29:17,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:17,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:17,201 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-20 05:29:17,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:17,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328962757] [2020-07-20 05:29:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:29:17,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328962757] [2020-07-20 05:29:17,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:29:17,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:29:17,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519426819] [2020-07-20 05:29:17,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:29:17,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:29:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:29:17,471 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-20 05:29:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:17,596 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 05:29:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:29:17,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 05:29:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:17,610 INFO L225 Difference]: With dead ends: 35 [2020-07-20 05:29:17,611 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 05:29:17,614 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:29:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 05:29:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 05:29:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 05:29:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 05:29:17,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 05:29:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:17,664 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 05:29:17,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:29:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 05:29:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:29:17,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:17,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:17,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:29:17,668 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-20 05:29:17,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:17,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870071038] [2020-07-20 05:29:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:29:17,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870071038] [2020-07-20 05:29:17,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:29:17,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:29:17,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270686420] [2020-07-20 05:29:17,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:29:17,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:17,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:29:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:29:17,745 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 05:29:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:17,820 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 05:29:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:29:17,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 05:29:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:17,822 INFO L225 Difference]: With dead ends: 27 [2020-07-20 05:29:17,822 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 05:29:17,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:29:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 05:29:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 05:29:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 05:29:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 05:29:17,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 05:29:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:17,831 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 05:29:17,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:29:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 05:29:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 05:29:17,833 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:17,833 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:17,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 05:29:17,834 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-20 05:29:17,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:17,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968052493] [2020-07-20 05:29:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 05:29:17,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968052493] [2020-07-20 05:29:17,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982461411] [2020-07-20 05:29:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@fa81280 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:18,020 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@fa81280 issued 3 check-sat command(s) [2020-07-20 05:29:18,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:18,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:29:18,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 05:29:18,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:18,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-20 05:29:18,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062561714] [2020-07-20 05:29:18,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:29:18,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:29:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:29:18,151 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 05:29:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:18,287 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-20 05:29:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 05:29:18,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 05:29:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:18,289 INFO L225 Difference]: With dead ends: 38 [2020-07-20 05:29:18,289 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 05:29:18,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:29:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 05:29:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-20 05:29:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-20 05:29:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-20 05:29:18,298 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-20 05:29:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:18,299 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-20 05:29:18,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:29:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-20 05:29:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 05:29:18,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:18,301 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:18,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-20 05:29:18,516 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-07-20 05:29:18,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:18,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787617603] [2020-07-20 05:29:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 05:29:18,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787617603] [2020-07-20 05:29:18,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398099841] [2020-07-20 05:29:18,664 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a83d097 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:18,697 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7a83d097 issued 3 check-sat command(s) [2020-07-20 05:29:18,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:18,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:29:18,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 05:29:18,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:18,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-20 05:29:18,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565563177] [2020-07-20 05:29:18,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 05:29:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 05:29:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 05:29:18,726 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-07-20 05:29:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:18,828 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-20 05:29:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 05:29:18,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-20 05:29:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:18,831 INFO L225 Difference]: With dead ends: 41 [2020-07-20 05:29:18,831 INFO L226 Difference]: Without dead ends: 37 [2020-07-20 05:29:18,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:29:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-20 05:29:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-20 05:29:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-20 05:29:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-20 05:29:18,843 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-20 05:29:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:18,844 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-20 05:29:18,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 05:29:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-20 05:29:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 05:29:18,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:18,846 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:19,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:19,060 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-07-20 05:29:19,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:19,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106288651] [2020-07-20 05:29:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-20 05:29:19,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106288651] [2020-07-20 05:29:19,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656403554] [2020-07-20 05:29:19,287 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@315cc7ea No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:19,321 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@315cc7ea issued 3 check-sat command(s) [2020-07-20 05:29:19,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:19,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:29:19,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 05:29:19,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:19,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-07-20 05:29:19,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685438045] [2020-07-20 05:29:19,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 05:29:19,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:19,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 05:29:19,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-20 05:29:19,398 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-07-20 05:29:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:19,651 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2020-07-20 05:29:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 05:29:19,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-20 05:29:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:19,653 INFO L225 Difference]: With dead ends: 71 [2020-07-20 05:29:19,653 INFO L226 Difference]: Without dead ends: 38 [2020-07-20 05:29:19,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-20 05:29:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-20 05:29:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-20 05:29:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-20 05:29:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-20 05:29:19,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2020-07-20 05:29:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:19,665 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-20 05:29:19,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 05:29:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-20 05:29:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-20 05:29:19,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:19,670 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-20 05:29:19,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:19,889 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 3 times [2020-07-20 05:29:19,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:19,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552876170] [2020-07-20 05:29:19,892 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,109 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-20 05:29:20,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552876170] [2020-07-20 05:29:20,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535963731] [2020-07-20 05:29:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@76197731 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:20,188 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@76197731 issued 3 check-sat command(s) [2020-07-20 05:29:20,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:20,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 05:29:20,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:20,244 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-20 05:29:20,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:20,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-20 05:29:20,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534545378] [2020-07-20 05:29:20,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:29:20,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:29:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:29:20,247 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 9 states. [2020-07-20 05:29:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:20,403 INFO L93 Difference]: Finished difference Result 80 states and 111 transitions. [2020-07-20 05:29:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 05:29:20,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2020-07-20 05:29:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:20,407 INFO L225 Difference]: With dead ends: 80 [2020-07-20 05:29:20,407 INFO L226 Difference]: Without dead ends: 76 [2020-07-20 05:29:20,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:29:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-20 05:29:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2020-07-20 05:29:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-20 05:29:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2020-07-20 05:29:20,423 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 68 [2020-07-20 05:29:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:20,424 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2020-07-20 05:29:20,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:29:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2020-07-20 05:29:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-20 05:29:20,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:20,427 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:20,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:20,641 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 4 times [2020-07-20 05:29:20,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:20,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797185656] [2020-07-20 05:29:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-07-20 05:29:21,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797185656] [2020-07-20 05:29:21,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322263137] [2020-07-20 05:29:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4aed2a6 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:21,125 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4aed2a6 issued 3 check-sat command(s) [2020-07-20 05:29:21,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:21,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 05:29:21,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-07-20 05:29:21,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:21,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2020-07-20 05:29:21,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092099284] [2020-07-20 05:29:21,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 05:29:21,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 05:29:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-07-20 05:29:21,207 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 15 states. [2020-07-20 05:29:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:21,652 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2020-07-20 05:29:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-20 05:29:21,653 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2020-07-20 05:29:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:21,655 INFO L225 Difference]: With dead ends: 137 [2020-07-20 05:29:21,655 INFO L226 Difference]: Without dead ends: 71 [2020-07-20 05:29:21,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-07-20 05:29:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-20 05:29:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2020-07-20 05:29:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-20 05:29:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-07-20 05:29:21,668 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 150 [2020-07-20 05:29:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:21,669 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-07-20 05:29:21,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 05:29:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-07-20 05:29:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 05:29:21,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:21,672 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:21,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 05:29:21,886 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 5 times [2020-07-20 05:29:21,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:21,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999137993] [2020-07-20 05:29:21,887 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-07-20 05:29:22,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999137993] [2020-07-20 05:29:22,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692476264] [2020-07-20 05:29:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f97e389 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:22,382 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f97e389 issued 3 check-sat command(s) [2020-07-20 05:29:22,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:22,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 05:29:22,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-07-20 05:29:22,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:22,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-07-20 05:29:22,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893986192] [2020-07-20 05:29:22,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 05:29:22,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 05:29:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:29:22,490 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 11 states. [2020-07-20 05:29:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:22,765 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-07-20 05:29:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 05:29:22,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 177 [2020-07-20 05:29:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:22,770 INFO L225 Difference]: With dead ends: 180 [2020-07-20 05:29:22,770 INFO L226 Difference]: Without dead ends: 176 [2020-07-20 05:29:22,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-07-20 05:29:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-07-20 05:29:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-07-20 05:29:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-20 05:29:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-07-20 05:29:22,802 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-07-20 05:29:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:22,803 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-07-20 05:29:22,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 05:29:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-07-20 05:29:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-07-20 05:29:22,809 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:22,809 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-20 05:29:23,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:23,011 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1242507885, now seen corresponding path program 6 times [2020-07-20 05:29:23,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:23,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608652322] [2020-07-20 05:29:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-07-20 05:29:24,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608652322] [2020-07-20 05:29:24,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696363052] [2020-07-20 05:29:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4eaed441 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:24,272 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4eaed441 issued 3 check-sat command(s) [2020-07-20 05:29:24,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:24,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 05:29:24,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2020-07-20 05:29:24,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:24,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 19 [2020-07-20 05:29:24,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098381171] [2020-07-20 05:29:24,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 05:29:24,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:24,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 05:29:24,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2020-07-20 05:29:24,436 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 19 states. [2020-07-20 05:29:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:25,198 INFO L93 Difference]: Finished difference Result 274 states and 458 transitions. [2020-07-20 05:29:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-20 05:29:25,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 354 [2020-07-20 05:29:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:25,201 INFO L225 Difference]: With dead ends: 274 [2020-07-20 05:29:25,201 INFO L226 Difference]: Without dead ends: 116 [2020-07-20 05:29:25,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2020-07-20 05:29:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-20 05:29:25,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2020-07-20 05:29:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-20 05:29:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2020-07-20 05:29:25,229 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 354 [2020-07-20 05:29:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:25,230 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2020-07-20 05:29:25,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 05:29:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2020-07-20 05:29:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2020-07-20 05:29:25,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:25,246 INFO L422 BasicCegarLoop]: trace histogram [97, 97, 78, 48, 48, 48, 48, 48, 48, 48, 30, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:25,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:25,460 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash -457025650, now seen corresponding path program 7 times [2020-07-20 05:29:25,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:25,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722186289] [2020-07-20 05:29:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:29:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 4036 proven. 3782 refuted. 0 times theorem prover too weak. 18321 trivial. 0 not checked. [2020-07-20 05:29:28,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722186289] [2020-07-20 05:29:28,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930313673] [2020-07-20 05:29:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a00f349 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:29:28,713 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@a00f349 issued 4 check-sat command(s) [2020-07-20 05:29:28,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:29:28,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 1485 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-20 05:29:28,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:29:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 2363 proven. 4673 refuted. 0 times theorem prover too weak. 19103 trivial. 0 not checked. [2020-07-20 05:29:29,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:29:29,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 21 [2020-07-20 05:29:29,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231700527] [2020-07-20 05:29:29,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 05:29:29,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:29:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 05:29:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2020-07-20 05:29:29,331 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand 21 states. [2020-07-20 05:29:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:29:30,273 INFO L93 Difference]: Finished difference Result 220 states and 366 transitions. [2020-07-20 05:29:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-20 05:29:30,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 667 [2020-07-20 05:29:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:29:30,279 INFO L225 Difference]: With dead ends: 220 [2020-07-20 05:29:30,280 INFO L226 Difference]: Without dead ends: 130 [2020-07-20 05:29:30,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=525, Invalid=2025, Unknown=0, NotChecked=0, Total=2550 [2020-07-20 05:29:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-20 05:29:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2020-07-20 05:29:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-20 05:29:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-07-20 05:29:30,319 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 667 [2020-07-20 05:29:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:29:30,322 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-07-20 05:29:30,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 05:29:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-07-20 05:29:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-20 05:29:30,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:29:30,338 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:29:30,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 05:29:30,553 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:29:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:29:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 8 times [2020-07-20 05:29:30,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:29:30,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147932649] [2020-07-20 05:29:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1edcaa4a [2020-07-20 05:29:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:29:30,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:29:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:29:30,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:29:30,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:29:30,833 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:29:30,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 05:29:30,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:29:30 BoogieIcfgContainer [2020-07-20 05:29:30,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:29:30,928 INFO L168 Benchmark]: Toolchain (without parser) took 14539.46 ms. Allocated memory was 136.3 MB in the beginning and 780.7 MB in the end (delta: 644.3 MB). Free memory was 100.8 MB in the beginning and 265.2 MB in the end (delta: -164.4 MB). Peak memory consumption was 479.9 MB. Max. memory is 7.1 GB. [2020-07-20 05:29:30,929 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 05:29:30,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.01 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 91.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-20 05:29:30,931 INFO L168 Benchmark]: Boogie Preprocessor took 24.09 ms. Allocated memory is still 136.3 MB. Free memory was 91.1 MB in the beginning and 89.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-20 05:29:30,931 INFO L168 Benchmark]: RCFGBuilder took 321.87 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 167.2 MB in the end (delta: -77.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-20 05:29:30,932 INFO L168 Benchmark]: TraceAbstraction took 13900.07 ms. Allocated memory was 199.8 MB in the beginning and 780.7 MB in the end (delta: 580.9 MB). Free memory was 167.2 MB in the beginning and 265.2 MB in the end (delta: -98.0 MB). Peak memory consumption was 482.9 MB. Max. memory is 7.1 GB. [2020-07-20 05:29:30,936 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.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.01 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 91.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.09 ms. Allocated memory is still 136.3 MB. Free memory was 91.1 MB in the beginning and 89.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.87 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 167.2 MB in the end (delta: -77.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13900.07 ms. Allocated memory was 199.8 MB in the beginning and 780.7 MB in the end (delta: 580.9 MB). Free memory was 167.2 MB in the beginning and 265.2 MB in the end (delta: -98.0 MB). Peak memory consumption was 482.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 11, TraceHistogramMax: 97, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 233 SDtfs, 636 SDslu, 756 SDs, 0 SdLazy, 1544 SolverSat, 602 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2150 GetRequests, 1964 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred 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, 10 MinimizatonAttempts, 63 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 3508 NumberOfCodeBlocks, 3305 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3027 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745301 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3055 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 58952/72660 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...