/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 05:43:51,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:43:51,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:43:51,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:43:51,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:43:51,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:43:51,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:43:51,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:43:51,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:43:51,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:43:51,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:43:51,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:43:51,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:43:51,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:43:51,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:43:51,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:43:51,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:43:51,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:43:51,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:43:51,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:43:51,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:43:51,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:43:51,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:43:51,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:43:51,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:43:51,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:43:51,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:43:51,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:43:51,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:43:51,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:43:51,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:43:51,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:43:51,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:43:51,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:43:51,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:43:51,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:43:51,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:43:51,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:43:51,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:43:51,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:43:51,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:43:51,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 05:43:51,331 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:43:51,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:43:51,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:43:51,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:43:51,333 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:43:51,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:43:51,334 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:43:51,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:43:51,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:43:51,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:43:51,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:43:51,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:43:51,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:43:51,335 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:43:51,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:43:51,336 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:43:51,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:43:51,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:43:51,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:43:51,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:43:51,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:43:51,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:43:51,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:43:51,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:43:51,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:43:51,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:43:51,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:43:51,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:43:51,338 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:43:51,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 05:43:51,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:43:51,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:43:51,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:43:51,745 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:43:51,746 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:43:51,747 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 05:43:51,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80af28f0a/acfd684f545f47c9aaf8f648674896bf/FLAGda63ed65d [2020-07-20 05:43:52,230 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:43:52,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-20 05:43:52,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80af28f0a/acfd684f545f47c9aaf8f648674896bf/FLAGda63ed65d [2020-07-20 05:43:52,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80af28f0a/acfd684f545f47c9aaf8f648674896bf [2020-07-20 05:43:52,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:43:52,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:43:52,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:43:52,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:43:52,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:43:52,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d934066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52, skipping insertion in model container [2020-07-20 05:43:52,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:43:52,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:43:52,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:43:52,886 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:43:52,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:43:52,923 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:43:52,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52 WrapperNode [2020-07-20 05:43:52,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:43:52,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:43:52,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:43:52,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:43:52,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... [2020-07-20 05:43:52,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:43:52,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:43:52,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:43:52,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:43:52,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:43:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:43:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:43:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 05:43:53,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:43:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:43:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:43:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 05:43:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:43:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:43:53,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:43:53,281 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:43:53,282 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 05:43:53,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:53 BoogieIcfgContainer [2020-07-20 05:43:53,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:43:53,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:43:53,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:43:53,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:43:53,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:43:52" (1/3) ... [2020-07-20 05:43:53,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a4bf0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:53, skipping insertion in model container [2020-07-20 05:43:53,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:52" (2/3) ... [2020-07-20 05:43:53,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a4bf0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:53, skipping insertion in model container [2020-07-20 05:43:53,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:53" (3/3) ... [2020-07-20 05:43:53,295 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-20 05:43:53,307 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:43:53,316 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 05:43:53,332 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 05:43:53,403 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:43:53,403 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:43:53,404 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:43:53,404 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:43:53,404 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:43:53,404 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:43:53,405 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:43:53,405 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:43:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 05:43:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 05:43:53,458 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:53,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:53,459 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:53,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:53,468 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 05:43:53,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:53,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316948088] [2020-07-20 05:43:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:43:53,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316948088] [2020-07-20 05:43:53,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:43:53,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:43:53,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312399395] [2020-07-20 05:43:53,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:43:53,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:53,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:43:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:43:53,722 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 05:43:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:53,832 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 05:43:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:43:53,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 05:43:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:53,843 INFO L225 Difference]: With dead ends: 35 [2020-07-20 05:43:53,843 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 05:43:53,847 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 05:43:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 05:43:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 05:43:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 05:43:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 05:43:53,894 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 05:43:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:53,895 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 05:43:53,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:43:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 05:43:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:43:53,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:53,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:53,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:43:53,898 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:53,899 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 05:43:53,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:53,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417748945] [2020-07-20 05:43:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:43:53,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417748945] [2020-07-20 05:43:53,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:43:53,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:43:53,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980499416] [2020-07-20 05:43:53,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:43:53,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:53,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:43:53,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:43:53,980 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 05:43:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:54,042 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 05:43:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:43:54,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 05:43:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:54,044 INFO L225 Difference]: With dead ends: 27 [2020-07-20 05:43:54,045 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 05:43:54,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 05:43:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 05:43:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 05:43:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 05:43:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 05:43:54,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 05:43:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:54,055 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 05:43:54,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:43:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 05:43:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 05:43:54,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:54,057 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:54,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 05:43:54,058 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 05:43:54,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:54,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031656103] [2020-07-20 05:43:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 05:43:54,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031656103] [2020-07-20 05:43:54,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182689454] [2020-07-20 05:43:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2487c85f No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:54,256 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2487c85f issued 3 check-sat command(s) [2020-07-20 05:43:54,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:54,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:43:54,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 05:43:54,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:54,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-20 05:43:54,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786190756] [2020-07-20 05:43:54,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:43:54,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:43:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:43:54,339 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 05:43:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:54,459 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-20 05:43:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 05:43:54,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 05:43:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:54,461 INFO L225 Difference]: With dead ends: 38 [2020-07-20 05:43:54,461 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 05:43:54,463 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 05:43:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 05:43:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-20 05:43:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-20 05:43:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-20 05:43:54,471 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-20 05:43:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:54,472 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-20 05:43:54,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:43:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-20 05:43:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 05:43:54,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:54,474 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:54,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-20 05:43:54,688 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:54,689 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 05:43:54,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:54,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062491542] [2020-07-20 05:43:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 05:43:54,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062491542] [2020-07-20 05:43:54,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644539383] [2020-07-20 05:43:54,856 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2478279a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:54,898 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2478279a issued 3 check-sat command(s) [2020-07-20 05:43:54,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:54,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:43:54,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 05:43:54,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:54,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-20 05:43:54,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888074033] [2020-07-20 05:43:54,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 05:43:54,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 05:43:54,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 05:43:54,926 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-07-20 05:43:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:55,060 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-20 05:43:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 05:43:55,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-20 05:43:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:55,066 INFO L225 Difference]: With dead ends: 41 [2020-07-20 05:43:55,066 INFO L226 Difference]: Without dead ends: 37 [2020-07-20 05:43:55,067 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 05:43:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-20 05:43:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-20 05:43:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-20 05:43:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-20 05:43:55,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-20 05:43:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:55,087 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-20 05:43:55,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 05:43:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-20 05:43:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 05:43:55,091 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:55,091 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:55,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:55,308 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-07-20 05:43:55,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:55,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404032214] [2020-07-20 05:43:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-20 05:43:55,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404032214] [2020-07-20 05:43:55,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681840793] [2020-07-20 05:43:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@754e3bde No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:55,511 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@754e3bde issued 3 check-sat command(s) [2020-07-20 05:43:55,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:55,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:43:55,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 05:43:55,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:55,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-20 05:43:55,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750328022] [2020-07-20 05:43:55,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 05:43:55,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 05:43:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-20 05:43:55,583 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-07-20 05:43:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:55,836 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-07-20 05:43:55,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 05:43:55,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-20 05:43:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:55,839 INFO L225 Difference]: With dead ends: 72 [2020-07-20 05:43:55,840 INFO L226 Difference]: Without dead ends: 41 [2020-07-20 05:43:55,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-20 05:43:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-20 05:43:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-20 05:43:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 05:43:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-20 05:43:55,850 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-07-20 05:43:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:55,850 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-20 05:43:55,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 05:43:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-20 05:43:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-20 05:43:55,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:55,853 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:56,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:56,067 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2020-07-20 05:43:56,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:56,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467720384] [2020-07-20 05:43:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-20 05:43:56,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467720384] [2020-07-20 05:43:56,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213453754] [2020-07-20 05:43:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4c1ae8 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:56,384 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4c1ae8 issued 3 check-sat command(s) [2020-07-20 05:43:56,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:56,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 05:43:56,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-20 05:43:56,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:56,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-20 05:43:56,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913473964] [2020-07-20 05:43:56,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:43:56,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:56,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:43:56,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:43:56,431 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 9 states. [2020-07-20 05:43:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:56,602 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2020-07-20 05:43:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 05:43:56,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2020-07-20 05:43:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:56,608 INFO L225 Difference]: With dead ends: 83 [2020-07-20 05:43:56,608 INFO L226 Difference]: Without dead ends: 79 [2020-07-20 05:43:56,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:43:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-20 05:43:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2020-07-20 05:43:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-20 05:43:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-07-20 05:43:56,624 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 68 [2020-07-20 05:43:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:56,625 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-07-20 05:43:56,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:43:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2020-07-20 05:43:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-20 05:43:56,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:56,629 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:56,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:56,843 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2068257585, now seen corresponding path program 4 times [2020-07-20 05:43:56,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:56,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109653562] [2020-07-20 05:43:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-07-20 05:43:57,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109653562] [2020-07-20 05:43:57,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799402623] [2020-07-20 05:43:57,375 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5bab804e No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:57,449 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5bab804e issued 3 check-sat command(s) [2020-07-20 05:43:57,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:57,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 05:43:57,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-07-20 05:43:57,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:57,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-20 05:43:57,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842376058] [2020-07-20 05:43:57,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 05:43:57,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 05:43:57,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-20 05:43:57,509 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 10 states. [2020-07-20 05:43:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:57,774 INFO L93 Difference]: Finished difference Result 150 states and 231 transitions. [2020-07-20 05:43:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 05:43:57,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2020-07-20 05:43:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:57,781 INFO L225 Difference]: With dead ends: 150 [2020-07-20 05:43:57,781 INFO L226 Difference]: Without dead ends: 146 [2020-07-20 05:43:57,783 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 05:43:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-20 05:43:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2020-07-20 05:43:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-20 05:43:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2020-07-20 05:43:57,813 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 150 [2020-07-20 05:43:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:57,814 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2020-07-20 05:43:57,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 05:43:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2020-07-20 05:43:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-20 05:43:57,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:57,819 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 05:43:58,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 05:43:58,035 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:58,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 5 times [2020-07-20 05:43:58,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:58,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102733290] [2020-07-20 05:43:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:43:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,701 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 05:43:58,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102733290] [2020-07-20 05:43:58,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107122554] [2020-07-20 05:43:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3acc93d6 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:58,808 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3acc93d6 issued 3 check-sat command(s) [2020-07-20 05:43:58,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:58,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 05:43:58,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:58,969 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 05:43:58,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:58,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-07-20 05:43:58,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140404648] [2020-07-20 05:43:58,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 05:43:58,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 05:43:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-20 05:43:58,973 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand 17 states. [2020-07-20 05:43:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:59,735 INFO L93 Difference]: Finished difference Result 229 states and 428 transitions. [2020-07-20 05:43:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-20 05:43:59,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 218 [2020-07-20 05:43:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:59,738 INFO L225 Difference]: With dead ends: 229 [2020-07-20 05:43:59,738 INFO L226 Difference]: Without dead ends: 101 [2020-07-20 05:43:59,743 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 05:43:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-20 05:43:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2020-07-20 05:43:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-20 05:43:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-20 05:43:59,756 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 218 [2020-07-20 05:43:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:59,756 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-20 05:43:59,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 05:43:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-20 05:43:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-07-20 05:43:59,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:59,763 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 05:43:59,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:59,976 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 6 times [2020-07-20 05:43:59,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:59,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403859394] [2020-07-20 05:43:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:44:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,074 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 05:44:01,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403859394] [2020-07-20 05:44:01,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53475768] [2020-07-20 05:44:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7653038a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:44:01,211 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7653038a issued 4 check-sat command(s) [2020-07-20 05:44:01,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:44:01,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 05:44:01,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:44:01,398 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 05:44:01,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:44:01,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 21 [2020-07-20 05:44:01,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527931031] [2020-07-20 05:44:01,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 05:44:01,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:44:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 05:44:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-20 05:44:01,401 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 21 states. [2020-07-20 05:44:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:44:02,322 INFO L93 Difference]: Finished difference Result 212 states and 396 transitions. [2020-07-20 05:44:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-20 05:44:02,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 327 [2020-07-20 05:44:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:44:02,325 INFO L225 Difference]: With dead ends: 212 [2020-07-20 05:44:02,325 INFO L226 Difference]: Without dead ends: 119 [2020-07-20 05:44:02,328 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 05:44:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-20 05:44:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2020-07-20 05:44:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-20 05:44:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2020-07-20 05:44:02,342 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 327 [2020-07-20 05:44:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:44:02,343 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2020-07-20 05:44:02,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 05:44:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2020-07-20 05:44:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 05:44:02,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:44:02,347 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 05:44:02,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:44:02,561 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:44:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:44:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 7 times [2020-07-20 05:44:02,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:44:02,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530270275] [2020-07-20 05:44:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@8e46284 [2020-07-20 05:44:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:44:02,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:44:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:44:02,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:44:02,701 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:44:02,701 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:44:02,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 05:44:02,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:44:02 BoogieIcfgContainer [2020-07-20 05:44:02,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:44:02,769 INFO L168 Benchmark]: Toolchain (without parser) took 10161.99 ms. Allocated memory was 136.8 MB in the beginning and 436.2 MB in the end (delta: 299.4 MB). Free memory was 102.0 MB in the beginning and 303.3 MB in the end (delta: -201.3 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:02,770 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 05:44:02,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.24 ms. Allocated memory is still 136.8 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:02,772 INFO L168 Benchmark]: Boogie Preprocessor took 33.37 ms. Allocated memory is still 136.8 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:02,772 INFO L168 Benchmark]: RCFGBuilder took 327.13 ms. Allocated memory was 136.8 MB in the beginning and 198.7 MB in the end (delta: 61.9 MB). Free memory was 91.0 MB in the beginning and 166.0 MB in the end (delta: -75.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:02,773 INFO L168 Benchmark]: TraceAbstraction took 9479.26 ms. Allocated memory was 198.7 MB in the beginning and 436.2 MB in the end (delta: 237.5 MB). Free memory was 166.0 MB in the beginning and 303.3 MB in the end (delta: -137.3 MB). Peak memory consumption was 100.2 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:02,777 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.24 ms. Allocated memory is still 136.8 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.37 ms. Allocated memory is still 136.8 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 327.13 ms. Allocated memory was 136.8 MB in the beginning and 198.7 MB in the end (delta: 61.9 MB). Free memory was 91.0 MB in the beginning and 166.0 MB in the end (delta: -75.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9479.26 ms. Allocated memory was 198.7 MB in the beginning and 436.2 MB in the end (delta: 237.5 MB). Free memory was 166.0 MB in the beginning and 303.3 MB in the end (delta: -137.3 MB). Peak memory consumption was 100.2 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: 9.3s, OverallIterations: 10, TraceHistogramMax: 47, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 496 SDslu, 667 SDs, 0 SdLazy, 1335 SolverSat, 452 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.7s 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s 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...