/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 DAGSIZE --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-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 03:34:54,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 03:34:55,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 03:34:55,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 03:34:55,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 03:34:55,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 03:34:55,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 03:34:55,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 03:34:55,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 03:34:55,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 03:34:55,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 03:34:55,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 03:34:55,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 03:34:55,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 03:34:55,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 03:34:55,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 03:34:55,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 03:34:55,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 03:34:55,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 03:34:55,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 03:34:55,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 03:34:55,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 03:34:55,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 03:34:55,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 03:34:55,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 03:34:55,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 03:34:55,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 03:34:55,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 03:34:55,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 03:34:55,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 03:34:55,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 03:34:55,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 03:34:55,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 03:34:55,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 03:34:55,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 03:34:55,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 03:34:55,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 03:34:55,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 03:34:55,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 03:34:55,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 03:34:55,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 03:34:55,059 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 03:34:55,076 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 03:34:55,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 03:34:55,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 03:34:55,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 03:34:55,079 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 03:34:55,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 03:34:55,079 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 03:34:55,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 03:34:55,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 03:34:55,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 03:34:55,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 03:34:55,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 03:34:55,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 03:34:55,081 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 03:34:55,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 03:34:55,081 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 03:34:55,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 03:34:55,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 03:34:55,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 03:34:55,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 03:34:55,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 03:34:55,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 03:34:55,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 03:34:55,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 03:34:55,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 03:34:55,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 03:34:55,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 03:34:55,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 03:34:55,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 03:34:55,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE 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 03:34:55,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 03:34:55,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 03:34:55,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 03:34:55,420 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 03:34:55,420 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 03:34:55,421 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-20 03:34:55,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e5cd048/fc01344c2af64e3996d052430563089b/FLAG9edaa2869 [2020-07-20 03:34:55,933 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 03:34:55,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-20 03:34:55,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e5cd048/fc01344c2af64e3996d052430563089b/FLAG9edaa2869 [2020-07-20 03:34:56,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e5cd048/fc01344c2af64e3996d052430563089b [2020-07-20 03:34:56,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 03:34:56,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 03:34:56,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 03:34:56,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 03:34:56,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 03:34:56,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5259c586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56, skipping insertion in model container [2020-07-20 03:34:56,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 03:34:56,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 03:34:56,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:34:56,534 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 03:34:56,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:34:56,569 INFO L208 MainTranslator]: Completed translation [2020-07-20 03:34:56,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56 WrapperNode [2020-07-20 03:34:56,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 03:34:56,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 03:34:56,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 03:34:56,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 03:34:56,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (1/1) ... [2020-07-20 03:34:56,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 03:34:56,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 03:34:56,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 03:34:56,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 03:34:56,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (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 03:34:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 03:34:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 03:34:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 03:34:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 03:34:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 03:34:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 03:34:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 03:34:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 03:34:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 03:34:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 03:34:57,130 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 03:34:57,131 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 03:34:57,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:34:57 BoogieIcfgContainer [2020-07-20 03:34:57,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 03:34:57,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 03:34:57,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 03:34:57,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 03:34:57,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:34:56" (1/3) ... [2020-07-20 03:34:57,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d007e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:34:57, skipping insertion in model container [2020-07-20 03:34:57,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:34:56" (2/3) ... [2020-07-20 03:34:57,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d007e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:34:57, skipping insertion in model container [2020-07-20 03:34:57,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:34:57" (3/3) ... [2020-07-20 03:34:57,159 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-20 03:34:57,174 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 03:34:57,199 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 03:34:57,218 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 03:34:57,261 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 03:34:57,261 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 03:34:57,263 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 03:34:57,263 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 03:34:57,263 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 03:34:57,263 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 03:34:57,263 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 03:34:57,264 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 03:34:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 03:34:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 03:34:57,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:34:57,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:34:57,326 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:34:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:34:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 03:34:57,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:34:57,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713136298] [2020-07-20 03:34:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:34:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:57,653 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 03:34:57,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713136298] [2020-07-20 03:34:57,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:34:57,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:34:57,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925803671] [2020-07-20 03:34:57,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:34:57,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:34:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:34:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:34:57,688 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 03:34:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:34:57,805 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 03:34:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:34:57,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 03:34:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:34:57,818 INFO L225 Difference]: With dead ends: 35 [2020-07-20 03:34:57,819 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 03:34:57,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 03:34:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 03:34:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 03:34:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 03:34:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 03:34:57,878 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 03:34:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:34:57,879 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 03:34:57,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:34:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 03:34:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 03:34:57,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:34:57,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:34:57,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 03:34:57,883 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:34:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:34:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 03:34:57,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:34:57,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473872047] [2020-07-20 03:34:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:34:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:57,954 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 03:34:57,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473872047] [2020-07-20 03:34:57,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:34:57,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:34:57,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436121407] [2020-07-20 03:34:57,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:34:57,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:34:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:34:57,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:34:57,960 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 03:34:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:34:58,042 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 03:34:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:34:58,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 03:34:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:34:58,044 INFO L225 Difference]: With dead ends: 27 [2020-07-20 03:34:58,045 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 03:34:58,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 03:34:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 03:34:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 03:34:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 03:34:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 03:34:58,056 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 03:34:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:34:58,056 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 03:34:58,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:34:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 03:34:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 03:34:58,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:34:58,059 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 03:34:58,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 03:34:58,059 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:34:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:34:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 03:34:58,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:34:58,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185733910] [2020-07-20 03:34:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:34:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,222 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 03:34:58,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185733910] [2020-07-20 03:34:58,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43246051] [2020-07-20 03:34:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6149fe28 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 03:34:58,293 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6149fe28 issued 3 check-sat command(s) [2020-07-20 03:34:58,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:34:58,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 03:34:58,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:34:58,377 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 03:34:58,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:34:58,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-20 03:34:58,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406217465] [2020-07-20 03:34:58,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 03:34:58,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:34:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 03:34:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:34:58,380 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 03:34:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:34:58,505 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-20 03:34:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 03:34:58,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 03:34:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:34:58,507 INFO L225 Difference]: With dead ends: 38 [2020-07-20 03:34:58,507 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 03:34:58,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-20 03:34:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 03:34:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-20 03:34:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-20 03:34:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-20 03:34:58,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-20 03:34:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:34:58,518 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-20 03:34:58,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 03:34:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-20 03:34:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 03:34:58,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:34:58,520 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 03:34:58,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-20 03:34:58,735 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:34:58,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:34:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 03:34:58,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:34:58,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663824163] [2020-07-20 03:34:58,738 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:34:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:58,915 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 03:34:58,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663824163] [2020-07-20 03:34:58,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186106708] [2020-07-20 03:34:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5e097065 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 03:34:58,969 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5e097065 issued 3 check-sat command(s) [2020-07-20 03:34:58,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:34:58,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 03:34:58,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:34:59,009 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 03:34:59,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:34:59,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-20 03:34:59,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433202487] [2020-07-20 03:34:59,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 03:34:59,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:34:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 03:34:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 03:34:59,014 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-07-20 03:34:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:34:59,137 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-20 03:34:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 03:34:59,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-20 03:34:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:34:59,141 INFO L225 Difference]: With dead ends: 41 [2020-07-20 03:34:59,141 INFO L226 Difference]: Without dead ends: 37 [2020-07-20 03:34:59,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 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 03:34:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-20 03:34:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-20 03:34:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-20 03:34:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-20 03:34:59,176 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-20 03:34:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:34:59,177 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-20 03:34:59,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 03:34:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-20 03:34:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 03:34:59,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:34:59,182 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 03:34:59,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:34:59,397 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:34:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:34:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-07-20 03:34:59,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:34:59,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887901025] [2020-07-20 03:34:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:34:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:34:59,559 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 03:34:59,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887901025] [2020-07-20 03:34:59,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901244287] [2020-07-20 03:34:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@239eb139 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 03:34:59,598 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@239eb139 issued 3 check-sat command(s) [2020-07-20 03:34:59,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:34:59,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 03:34:59,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:34:59,667 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 03:34:59,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:34:59,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-20 03:34:59,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130936460] [2020-07-20 03:34:59,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 03:34:59,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:34:59,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 03:34:59,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:34:59,671 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-07-20 03:34:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:34:59,923 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-07-20 03:34:59,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 03:34:59,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-20 03:34:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:34:59,926 INFO L225 Difference]: With dead ends: 72 [2020-07-20 03:34:59,926 INFO L226 Difference]: Without dead ends: 41 [2020-07-20 03:34:59,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-20 03:34:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-20 03:34:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-20 03:34:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 03:34:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-20 03:34:59,938 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-07-20 03:34:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:34:59,939 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-20 03:34:59,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 03:34:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-20 03:34:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-20 03:34:59,942 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:34:59,942 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 03:35:00,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:35:00,158 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:35:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:35:00,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2020-07-20 03:35:00,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:35:00,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777153915] [2020-07-20 03:35:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:35:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:00,445 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 03:35:00,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777153915] [2020-07-20 03:35:00,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829065955] [2020-07-20 03:35:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@22330442 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 03:35:00,514 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@22330442 issued 3 check-sat command(s) [2020-07-20 03:35:00,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:35:00,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 03:35:00,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:35:00,599 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 03:35:00,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:35:00,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-20 03:35:00,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915139388] [2020-07-20 03:35:00,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 03:35:00,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:35:00,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 03:35:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:35:00,606 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 9 states. [2020-07-20 03:35:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:35:00,795 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2020-07-20 03:35:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 03:35:00,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2020-07-20 03:35:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:35:00,807 INFO L225 Difference]: With dead ends: 83 [2020-07-20 03:35:00,807 INFO L226 Difference]: Without dead ends: 79 [2020-07-20 03:35:00,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-20 03:35:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-20 03:35:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2020-07-20 03:35:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-20 03:35:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-07-20 03:35:00,848 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 68 [2020-07-20 03:35:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:35:00,849 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-07-20 03:35:00,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 03:35:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2020-07-20 03:35:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-20 03:35:00,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:35:00,862 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 03:35:01,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:35:01,077 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:35:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:35:01,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2068257585, now seen corresponding path program 4 times [2020-07-20 03:35:01,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:35:01,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568316261] [2020-07-20 03:35:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:35:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:01,582 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 03:35:01,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568316261] [2020-07-20 03:35:01,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781031351] [2020-07-20 03:35:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@799efe78 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 03:35:01,662 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@799efe78 issued 3 check-sat command(s) [2020-07-20 03:35:01,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:35:01,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 03:35:01,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:35:01,731 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 03:35:01,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:35:01,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-20 03:35:01,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537486174] [2020-07-20 03:35:01,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 03:35:01,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:35:01,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 03:35:01,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-20 03:35:01,736 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 10 states. [2020-07-20 03:35:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:35:01,982 INFO L93 Difference]: Finished difference Result 150 states and 231 transitions. [2020-07-20 03:35:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 03:35:01,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2020-07-20 03:35:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:35:01,988 INFO L225 Difference]: With dead ends: 150 [2020-07-20 03:35:01,988 INFO L226 Difference]: Without dead ends: 146 [2020-07-20 03:35:01,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-07-20 03:35:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-20 03:35:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2020-07-20 03:35:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-20 03:35:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2020-07-20 03:35:02,018 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 150 [2020-07-20 03:35:02,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:35:02,019 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2020-07-20 03:35:02,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 03:35:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2020-07-20 03:35:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-20 03:35:02,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:35:02,023 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:35:02,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 03:35:02,238 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:35:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:35:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 5 times [2020-07-20 03:35:02,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:35:02,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844668627] [2020-07-20 03:35:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:35:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-07-20 03:35:03,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844668627] [2020-07-20 03:35:03,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428696245] [2020-07-20 03:35:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@169ef9f2 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 03:35:03,137 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@169ef9f2 issued 3 check-sat command(s) [2020-07-20 03:35:03,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:35:03,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 03:35:03,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:35:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2020-07-20 03:35:03,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:35:03,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-07-20 03:35:03,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912692920] [2020-07-20 03:35:03,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 03:35:03,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:35:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 03:35:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-20 03:35:03,267 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand 17 states. [2020-07-20 03:35:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:35:03,985 INFO L93 Difference]: Finished difference Result 229 states and 428 transitions. [2020-07-20 03:35:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-20 03:35:03,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 218 [2020-07-20 03:35:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:35:03,989 INFO L225 Difference]: With dead ends: 229 [2020-07-20 03:35:03,989 INFO L226 Difference]: Without dead ends: 101 [2020-07-20 03:35:03,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-07-20 03:35:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-20 03:35:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2020-07-20 03:35:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-20 03:35:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-20 03:35:04,007 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 218 [2020-07-20 03:35:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:35:04,008 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-20 03:35:04,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 03:35:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-20 03:35:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-07-20 03:35:04,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:35:04,014 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:35:04,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:35:04,227 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:35:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:35:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 6 times [2020-07-20 03:35:04,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:35:04,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420664095] [2020-07-20 03:35:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:35:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:35:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-07-20 03:35:05,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420664095] [2020-07-20 03:35:05,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088228765] [2020-07-20 03:35:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5e9aa09b 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 03:35:05,797 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5e9aa09b issued 4 check-sat command(s) [2020-07-20 03:35:05,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:35:05,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 03:35:05,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:35:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 461 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-07-20 03:35:06,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:35:06,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 21 [2020-07-20 03:35:06,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592952905] [2020-07-20 03:35:06,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 03:35:06,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:35:06,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 03:35:06,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-20 03:35:06,038 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 21 states. [2020-07-20 03:35:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:35:07,005 INFO L93 Difference]: Finished difference Result 212 states and 396 transitions. [2020-07-20 03:35:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-20 03:35:07,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 327 [2020-07-20 03:35:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:35:07,009 INFO L225 Difference]: With dead ends: 212 [2020-07-20 03:35:07,009 INFO L226 Difference]: Without dead ends: 119 [2020-07-20 03:35:07,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2020-07-20 03:35:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-20 03:35:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2020-07-20 03:35:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-20 03:35:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2020-07-20 03:35:07,040 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 327 [2020-07-20 03:35:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:35:07,041 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2020-07-20 03:35:07,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 03:35:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2020-07-20 03:35:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 03:35:07,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:35:07,046 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:35:07,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:35:07,262 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:35:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:35:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 7 times [2020-07-20 03:35:07,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:35:07,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501216795] [2020-07-20 03:35:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3a1facbb [2020-07-20 03:35:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 03:35:07,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 03:35:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 03:35:07,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 03:35:07,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 03:35:07,404 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 03:35:07,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 03:35:07,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 03:35:07 BoogieIcfgContainer [2020-07-20 03:35:07,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 03:35:07,477 INFO L168 Benchmark]: Toolchain (without parser) took 11140.74 ms. Allocated memory was 143.7 MB in the beginning and 436.2 MB in the end (delta: 292.6 MB). Free memory was 101.3 MB in the beginning and 183.7 MB in the end (delta: -82.3 MB). Peak memory consumption was 210.2 MB. Max. memory is 7.1 GB. [2020-07-20 03:35:07,478 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 143.7 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 03:35:07,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.80 ms. Allocated memory is still 143.7 MB. Free memory was 100.9 MB in the beginning and 91.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-20 03:35:07,480 INFO L168 Benchmark]: Boogie Preprocessor took 36.93 ms. Allocated memory is still 143.7 MB. Free memory was 91.7 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 03:35:07,481 INFO L168 Benchmark]: RCFGBuilder took 535.03 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 90.4 MB in the beginning and 169.4 MB in the end (delta: -79.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-20 03:35:07,483 INFO L168 Benchmark]: TraceAbstraction took 10329.01 ms. Allocated memory was 201.9 MB in the beginning and 436.2 MB in the end (delta: 234.4 MB). Free memory was 169.4 MB in the beginning and 183.7 MB in the end (delta: -14.3 MB). Peak memory consumption was 220.1 MB. Max. memory is 7.1 GB. [2020-07-20 03:35:07,490 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.27 ms. Allocated memory is still 143.7 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.80 ms. Allocated memory is still 143.7 MB. Free memory was 100.9 MB in the beginning and 91.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.93 ms. Allocated memory is still 143.7 MB. Free memory was 91.7 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 535.03 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 90.4 MB in the beginning and 169.4 MB in the end (delta: -79.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10329.01 ms. Allocated memory was 201.9 MB in the beginning and 436.2 MB in the end (delta: 234.4 MB). Free memory was 169.4 MB in the beginning and 183.7 MB in the end (delta: -14.3 MB). Peak memory consumption was 220.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.1s, OverallIterations: 10, TraceHistogramMax: 47, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 496 SDslu, 667 SDs, 0 SdLazy, 1330 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1118 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=7, 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, 9 MinimizatonAttempts, 45 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2025 NumberOfCodeBlocks, 1898 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1723 ConstructedInterpolants, 0 QuantifiedInterpolants, 554179 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1709 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 15813/20072 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...