./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:29:37,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:29:37,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:29:37,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:29:37,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:29:37,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:29:37,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:29:37,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:29:37,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:29:37,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:29:37,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:29:37,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:29:37,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:29:37,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:29:37,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:29:37,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:29:37,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:29:37,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:29:37,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:29:37,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:29:37,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:29:37,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:29:37,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:29:37,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:29:37,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:29:37,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:29:37,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:29:37,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:29:37,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:29:37,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:29:37,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:29:37,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:29:37,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:29:37,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:29:37,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:29:37,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:29:37,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:29:37,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:29:37,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:29:37,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:29:37,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:29:37,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:29:37,171 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:29:37,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:29:37,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:29:37,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:29:37,173 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:29:37,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:29:37,173 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:29:37,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:29:37,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:29:37,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:29:37,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:29:37,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:29:37,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:29:37,175 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:29:37,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:29:37,175 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:29:37,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:29:37,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:29:37,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:29:37,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:29:37,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:29:37,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:37,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:29:37,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:29:37,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:29:37,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:29:37,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:29:37,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:29:37,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:29:37,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2019-11-28 17:29:37,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:29:37,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:29:37,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:29:37,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:29:37,573 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:29:37,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2019-11-28 17:29:37,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafe4f021/b04e78dce3dd4a0d9b759de21c7822cb/FLAG10c3fb52d [2019-11-28 17:29:38,121 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:29:38,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2019-11-28 17:29:38,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafe4f021/b04e78dce3dd4a0d9b759de21c7822cb/FLAG10c3fb52d [2019-11-28 17:29:38,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafe4f021/b04e78dce3dd4a0d9b759de21c7822cb [2019-11-28 17:29:38,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:29:38,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:29:38,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:38,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:29:38,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:29:38,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569c12aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38, skipping insertion in model container [2019-11-28 17:29:38,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:29:38,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:29:38,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:38,709 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:29:38,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:38,743 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:29:38,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38 WrapperNode [2019-11-28 17:29:38,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:38,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:38,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:29:38,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:29:38,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:38,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:29:38,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:29:38,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:29:38,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (1/1) ... [2019-11-28 17:29:38,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:29:38,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:29:38,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:29:38,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:29:38,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (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 [2019-11-28 17:29:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:29:38,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:29:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-28 17:29:38,924 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-28 17:29:39,088 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:29:39,089 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:29:39,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:39 BoogieIcfgContainer [2019-11-28 17:29:39,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:29:39,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:29:39,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:29:39,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:29:39,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:29:38" (1/3) ... [2019-11-28 17:29:39,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337101a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:39, skipping insertion in model container [2019-11-28 17:29:39,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:38" (2/3) ... [2019-11-28 17:29:39,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337101a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:39, skipping insertion in model container [2019-11-28 17:29:39,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:39" (3/3) ... [2019-11-28 17:29:39,114 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2019-11-28 17:29:39,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:29:39,140 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:29:39,174 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:29:39,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:29:39,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:29:39,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:29:39,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:29:39,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:29:39,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:29:39,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:29:39,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:29:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-28 17:29:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:29:39,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:39,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:39,241 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-11-28 17:29:39,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:39,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180109392] [2019-11-28 17:29:39,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:29:39,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180109392] [2019-11-28 17:29:39,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:39,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:29:39,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50677406] [2019-11-28 17:29:39,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:29:39,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:29:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:39,512 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2019-11-28 17:29:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:39,641 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-28 17:29:39,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:39,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 17:29:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:39,655 INFO L225 Difference]: With dead ends: 29 [2019-11-28 17:29:39,656 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:29:39,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:29:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:29:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:29:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 17:29:39,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-28 17:29:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:39,712 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 17:29:39,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:29:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 17:29:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:29:39,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:39,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:39,715 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:39,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-11-28 17:29:39,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:39,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233509265] [2019-11-28 17:29:39,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:29:39,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233509265] [2019-11-28 17:29:39,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:39,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:29:39,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577232644] [2019-11-28 17:29:39,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:29:39,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:39,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:29:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:39,789 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 7 states. [2019-11-28 17:29:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:39,873 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-28 17:29:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:39,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 17:29:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:39,877 INFO L225 Difference]: With dead ends: 23 [2019-11-28 17:29:39,877 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 17:29:39,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 17:29:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 17:29:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:29:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 17:29:39,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 17:29:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:39,886 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 17:29:39,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:29:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 17:29:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:29:39,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:39,888 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:39,888 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-11-28 17:29:39,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:39,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167751497] [2019-11-28 17:29:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:29:40,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167751497] [2019-11-28 17:29:40,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287982274] [2019-11-28 17:29:40,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 17:29:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,135 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:40,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:29:40,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:40,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-28 17:29:40,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056902055] [2019-11-28 17:29:40,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:40,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:40,227 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 10 states. [2019-11-28 17:29:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:40,362 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-11-28 17:29:40,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:29:40,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 17:29:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:40,364 INFO L225 Difference]: With dead ends: 41 [2019-11-28 17:29:40,364 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:29:40,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:29:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-28 17:29:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 17:29:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 17:29:40,378 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2019-11-28 17:29:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:40,380 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 17:29:40,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-28 17:29:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:29:40,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:40,384 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:40,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:40,586 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-11-28 17:29:40,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:40,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915788181] [2019-11-28 17:29:40,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:29:40,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915788181] [2019-11-28 17:29:40,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36543391] [2019-11-28 17:29:40,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 17:29:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,805 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:40,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:29:40,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:40,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-28 17:29:40,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675637317] [2019-11-28 17:29:40,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:40,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:40,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:40,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:40,836 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2019-11-28 17:29:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:40,982 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-11-28 17:29:40,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:29:40,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 17:29:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:40,986 INFO L225 Difference]: With dead ends: 47 [2019-11-28 17:29:40,987 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 17:29:40,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 17:29:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 17:29:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:29:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 17:29:41,003 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 23 [2019-11-28 17:29:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:41,004 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 17:29:41,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-11-28 17:29:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:29:41,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:41,008 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:41,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:41,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:41,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1840059703, now seen corresponding path program 2 times [2019-11-28 17:29:41,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:41,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215100851] [2019-11-28 17:29:41,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 17:29:41,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215100851] [2019-11-28 17:29:41,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503762714] [2019-11-28 17:29:41,402 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 17:29:41,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:41,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:41,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:41,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 17:29:41,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:41,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-28 17:29:41,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642065649] [2019-11-28 17:29:41,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:41,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:41,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:41,493 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 12 states. [2019-11-28 17:29:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:41,696 INFO L93 Difference]: Finished difference Result 67 states and 101 transitions. [2019-11-28 17:29:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:29:41,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 17:29:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:41,699 INFO L225 Difference]: With dead ends: 67 [2019-11-28 17:29:41,699 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:29:41,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:29:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:29:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 17:29:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-28 17:29:41,708 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 35 [2019-11-28 17:29:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:41,708 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-28 17:29:41,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-28 17:29:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:29:41,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:41,710 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:41,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:41,919 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash 624826665, now seen corresponding path program 2 times [2019-11-28 17:29:41,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:41,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290902614] [2019-11-28 17:29:41,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 17:29:42,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290902614] [2019-11-28 17:29:42,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350356910] [2019-11-28 17:29:42,134 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 17:29:42,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:42,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:42,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:42,173 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 17:29:42,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:42,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-28 17:29:42,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14573535] [2019-11-28 17:29:42,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:42,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:42,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:42,200 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 12 states. [2019-11-28 17:29:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:42,380 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-28 17:29:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:29:42,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-28 17:29:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:42,385 INFO L225 Difference]: With dead ends: 52 [2019-11-28 17:29:42,385 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 17:29:42,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:29:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 17:29:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-28 17:29:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:29:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2019-11-28 17:29:42,412 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 37 [2019-11-28 17:29:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:42,414 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-11-28 17:29:42,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2019-11-28 17:29:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 17:29:42,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:42,421 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:42,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:42,627 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:42,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1133813247, now seen corresponding path program 3 times [2019-11-28 17:29:42,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:42,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312711858] [2019-11-28 17:29:42,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 73 proven. 128 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-28 17:29:42,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312711858] [2019-11-28 17:29:42,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738808537] [2019-11-28 17:29:42,999 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-28 17:29:43,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 17:29:43,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:43,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:43,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-28 17:29:43,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:43,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-11-28 17:29:43,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714964543] [2019-11-28 17:29:43,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:29:43,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:29:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:29:43,138 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand 16 states. [2019-11-28 17:29:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:43,395 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2019-11-28 17:29:43,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:29:43,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-11-28 17:29:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:43,397 INFO L225 Difference]: With dead ends: 94 [2019-11-28 17:29:43,397 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 17:29:43,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:29:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 17:29:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-28 17:29:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 17:29:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-11-28 17:29:43,408 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 89 [2019-11-28 17:29:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:43,409 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-11-28 17:29:43,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:29:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-11-28 17:29:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 17:29:43,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:43,411 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:43,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:43,615 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-11-28 17:29:43,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:43,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689304273] [2019-11-28 17:29:43,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 57 proven. 117 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-28 17:29:43,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689304273] [2019-11-28 17:29:43,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562734973] [2019-11-28 17:29:43,967 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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 [2019-11-28 17:29:44,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:29:44,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:44,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:44,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-28 17:29:44,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:44,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 19 [2019-11-28 17:29:44,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169206354] [2019-11-28 17:29:44,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:29:44,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:29:44,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:29:44,095 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 19 states. [2019-11-28 17:29:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:44,468 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2019-11-28 17:29:44,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:29:44,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-11-28 17:29:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:44,471 INFO L225 Difference]: With dead ends: 93 [2019-11-28 17:29:44,471 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 17:29:44,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:29:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 17:29:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-28 17:29:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 17:29:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-11-28 17:29:44,497 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 78 [2019-11-28 17:29:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:44,498 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-11-28 17:29:44,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:29:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-11-28 17:29:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 17:29:44,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:44,501 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:44,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:44,714 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 5 times [2019-11-28 17:29:44,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:44,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754128810] [2019-11-28 17:29:44,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 166 proven. 339 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-11-28 17:29:45,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754128810] [2019-11-28 17:29:45,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053181804] [2019-11-28 17:29:45,184 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-11-28 17:29:45,245 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 17:29:45,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:45,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:29:45,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-11-28 17:29:45,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:45,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 25 [2019-11-28 17:29:45,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886209421] [2019-11-28 17:29:45,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:29:45,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:29:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:29:45,377 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 25 states. [2019-11-28 17:29:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:45,884 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2019-11-28 17:29:45,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 17:29:45,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-11-28 17:29:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:45,886 INFO L225 Difference]: With dead ends: 111 [2019-11-28 17:29:45,886 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 17:29:45,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 17:29:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 17:29:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-28 17:29:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:29:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-11-28 17:29:45,898 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2019-11-28 17:29:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:45,899 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-11-28 17:29:45,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:29:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-11-28 17:29:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 17:29:45,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:45,901 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:46,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:46,106 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2009245247, now seen corresponding path program 6 times [2019-11-28 17:29:46,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:46,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998254417] [2019-11-28 17:29:46,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-28 17:29:46,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998254417] [2019-11-28 17:29:46,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904213233] [2019-11-28 17:29:46,544 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:46,628 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-28 17:29:46,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:46,629 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:46,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-11-28 17:29:46,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:46,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 18 [2019-11-28 17:29:46,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703854329] [2019-11-28 17:29:46,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:29:46,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:46,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:29:46,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:29:46,685 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 18 states. [2019-11-28 17:29:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:46,964 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-11-28 17:29:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:29:46,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-11-28 17:29:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:46,968 INFO L225 Difference]: With dead ends: 182 [2019-11-28 17:29:46,969 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 17:29:46,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:29:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 17:29:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2019-11-28 17:29:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-28 17:29:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2019-11-28 17:29:46,994 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2019-11-28 17:29:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:46,995 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2019-11-28 17:29:46,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:29:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2019-11-28 17:29:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-28 17:29:47,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:47,001 INFO L410 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:47,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:47,215 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:47,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash 503828745, now seen corresponding path program 7 times [2019-11-28 17:29:47,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:47,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319645608] [2019-11-28 17:29:47,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 930 proven. 1704 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2019-11-28 17:29:48,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319645608] [2019-11-28 17:29:48,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470658951] [2019-11-28 17:29:48,616 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 17:29:48,761 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1021 proven. 540 refuted. 0 times theorem prover too weak. 5559 trivial. 0 not checked. [2019-11-28 17:29:48,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:48,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11] total 32 [2019-11-28 17:29:48,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046388788] [2019-11-28 17:29:48,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 17:29:48,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 17:29:48,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-11-28 17:29:48,937 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand 32 states. [2019-11-28 17:29:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:49,923 INFO L93 Difference]: Finished difference Result 290 states and 519 transitions. [2019-11-28 17:29:49,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-28 17:29:49,924 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2019-11-28 17:29:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:49,928 INFO L225 Difference]: With dead ends: 290 [2019-11-28 17:29:49,928 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 17:29:49,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=484, Invalid=2066, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 17:29:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 17:29:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2019-11-28 17:29:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 17:29:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-11-28 17:29:49,949 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 350 [2019-11-28 17:29:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:49,949 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-11-28 17:29:49,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 17:29:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-11-28 17:29:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-28 17:29:49,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:49,954 INFO L410 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:50,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:50,158 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash 960836894, now seen corresponding path program 8 times [2019-11-28 17:29:50,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:50,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676579419] [2019-11-28 17:29:50,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:29:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:29:50,268 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:29:50,268 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:29:50,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:29:50 BoogieIcfgContainer [2019-11-28 17:29:50,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:29:50,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:29:50,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:29:50,407 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:29:50,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:39" (3/4) ... [2019-11-28 17:29:50,411 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:29:50,576 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:29:50,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:29:50,579 INFO L168 Benchmark]: Toolchain (without parser) took 12089.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 960.4 MB in the beginning and 989.8 MB in the end (delta: -29.4 MB). Peak memory consumption was 319.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:50,580 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:29:50,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.77 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:50,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:29:50,581 INFO L168 Benchmark]: Boogie Preprocessor took 75.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -126.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:50,582 INFO L168 Benchmark]: RCFGBuilder took 234.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:50,582 INFO L168 Benchmark]: TraceAbstraction took 11314.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 325.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:50,583 INFO L168 Benchmark]: Witness Printer took 170.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 989.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:50,585 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.89 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.77 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -126.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11314.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 269.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 325.2 MB. Max. memory is 11.5 GB. * Witness Printer took 170.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 989.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 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; [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) [L25] int result = fibo(x); [L26] COND TRUE result == 13 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 51, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 184 SDtfs, 591 SDslu, 819 SDs, 0 SdLazy, 2214 SolverSat, 656 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1401 GetRequests, 1200 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2179 NumberOfCodeBlocks, 2097 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1877 ConstructedInterpolants, 0 QuantifiedInterpolants, 608453 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1920 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 16858/21046 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...