./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/Fibonacci05.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 f0bc64117ef8398002009c167867d7baf0a85044 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-30f4e4a [2019-11-28 00:24:09,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:24:09,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:24:09,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:24:09,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:24:09,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:24:09,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:24:09,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:24:09,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:24:09,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:24:09,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:24:09,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:24:09,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:24:09,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:24:09,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:24:09,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:24:09,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:24:09,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:24:09,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:24:09,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:24:09,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:24:09,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:24:09,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:24:09,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:24:09,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:24:09,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:24:09,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:24:09,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:24:09,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:24:09,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:24:09,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:24:09,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:24:09,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:24:09,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:24:09,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:24:09,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:24:09,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:24:09,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:24:09,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:24:09,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:24:09,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:24:09,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:24:09,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:24:09,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:24:09,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:24:09,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:24:09,340 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:24:09,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:24:09,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:24:09,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:24:09,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:24:09,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:24:09,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:24:09,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:24:09,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:24:09,343 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:24:09,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:24:09,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:24:09,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:24:09,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:24:09,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:24:09,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:24:09,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:24:09,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:24:09,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:24:09,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:24:09,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:24:09,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:24:09,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:24:09,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:24:09,348 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 -> f0bc64117ef8398002009c167867d7baf0a85044 [2019-11-28 00:24:09,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:24:09,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:24:09,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:24:09,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:24:09,667 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:24:09,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-28 00:24:09,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2884def31/0275fbdc04bf4db285c8678a6a83aac5/FLAG2acd944a2 [2019-11-28 00:24:10,192 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:24:10,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-28 00:24:10,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2884def31/0275fbdc04bf4db285c8678a6a83aac5/FLAG2acd944a2 [2019-11-28 00:24:10,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2884def31/0275fbdc04bf4db285c8678a6a83aac5 [2019-11-28 00:24:10,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:24:10,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:24:10,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:10,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:24:10,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:24:10,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cf407f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10, skipping insertion in model container [2019-11-28 00:24:10,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:24:10,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:24:10,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:10,815 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:24:10,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:10,848 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:24:10,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10 WrapperNode [2019-11-28 00:24:10,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:10,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:10,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:24:10,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:24:10,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:10,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:24:10,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:24:10,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:24:10,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:24:10,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:24:10,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:24:10,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:24:10,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (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 00:24:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 00:24:11,018 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 00:24:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:24:11,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:24:11,196 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:24:11,197 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:24:11,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:11 BoogieIcfgContainer [2019-11-28 00:24:11,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:24:11,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:24:11,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:24:11,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:24:11,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:24:10" (1/3) ... [2019-11-28 00:24:11,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609bc26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:11, skipping insertion in model container [2019-11-28 00:24:11,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (2/3) ... [2019-11-28 00:24:11,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609bc26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:11, skipping insertion in model container [2019-11-28 00:24:11,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:11" (3/3) ... [2019-11-28 00:24:11,228 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2019-11-28 00:24:11,262 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:24:11,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:24:11,316 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:24:11,342 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:24:11,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:24:11,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:24:11,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:24:11,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:24:11,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:24:11,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:24:11,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:24:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 00:24:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:24:11,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:11,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:11,369 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:11,374 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-11-28 00:24:11,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:11,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5962201] [2019-11-28 00:24:11,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,579 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 00:24:11,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5962201] [2019-11-28 00:24:11,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:11,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:24:11,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595690303] [2019-11-28 00:24:11,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:24:11,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:24:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:24:11,605 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2019-11-28 00:24:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:11,736 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-28 00:24:11,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:11,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:24:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:11,749 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:24:11,750 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:24:11,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:24:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:24:11,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:24:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:24:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 00:24:11,793 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-28 00:24:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:11,794 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 00:24:11,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:24:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 00:24:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:24:11,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:11,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:11,797 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:11,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:11,797 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-11-28 00:24:11,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:11,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972599304] [2019-11-28 00:24:11,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,854 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 00:24:11,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972599304] [2019-11-28 00:24:11,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:11,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:24:11,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111901714] [2019-11-28 00:24:11,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:24:11,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:24:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:24:11,860 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-11-28 00:24:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:11,959 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-28 00:24:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:11,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 00:24:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:11,962 INFO L225 Difference]: With dead ends: 23 [2019-11-28 00:24:11,962 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 00:24:11,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:24:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 00:24:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 00:24:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:24:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 00:24:11,975 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 00:24:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:11,976 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 00:24:11,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:24:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 00:24:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:24:11,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:11,980 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 00:24:11,980 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-11-28 00:24:11,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:11,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486386581] [2019-11-28 00:24:11,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:24:12,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486386581] [2019-11-28 00:24:12,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722887296] [2019-11-28 00:24:12,154 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 00:24:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:12,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:12,286 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 00:24:12,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:12,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 00:24:12,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864954910] [2019-11-28 00:24:12,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:24:12,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:12,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:24:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:12,293 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-11-28 00:24:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:12,434 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-28 00:24:12,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:12,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 00:24:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:12,436 INFO L225 Difference]: With dead ends: 34 [2019-11-28 00:24:12,437 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 00:24:12,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:24:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 00:24:12,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 00:24:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 00:24:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-28 00:24:12,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-11-28 00:24:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:12,445 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-28 00:24:12,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:24:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-11-28 00:24:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:24:12,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:12,447 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 00:24:12,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:12,651 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2019-11-28 00:24:12,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:12,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097510871] [2019-11-28 00:24:12,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,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 00:24:12,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097510871] [2019-11-28 00:24:12,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899189410] [2019-11-28 00:24:12,834 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 00:24:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:12,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:12,890 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 00:24:12,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:12,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 00:24:12,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132012117] [2019-11-28 00:24:12,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:24:12,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:12,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:24:12,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:24:12,894 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. [2019-11-28 00:24:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:13,010 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-11-28 00:24:13,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:13,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 00:24:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:13,014 INFO L225 Difference]: With dead ends: 37 [2019-11-28 00:24:13,014 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 00:24:13,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:13,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 00:24:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-28 00:24:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:24:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-28 00:24:13,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2019-11-28 00:24:13,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:13,029 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-28 00:24:13,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:24:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-11-28 00:24:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:24:13,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:13,032 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:13,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:13,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2019-11-28 00:24:13,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:13,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613009675] [2019-11-28 00:24:13,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:24:13,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613009675] [2019-11-28 00:24:13,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651842478] [2019-11-28 00:24:13,476 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 00:24:13,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:13,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:13,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:13,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 00:24:13,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:13,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-28 00:24:13,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953574564] [2019-11-28 00:24:13,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:24:13,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:24:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:13,599 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 14 states. [2019-11-28 00:24:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:13,864 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2019-11-28 00:24:13,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:24:13,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-28 00:24:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:13,868 INFO L225 Difference]: With dead ends: 67 [2019-11-28 00:24:13,868 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 00:24:13,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:24:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 00:24:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 00:24:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:24:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-28 00:24:13,878 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 36 [2019-11-28 00:24:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:13,879 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-28 00:24:13,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:24:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-28 00:24:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 00:24:13,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:13,882 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:14,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:14,086 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:14,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash 300559544, now seen corresponding path program 3 times [2019-11-28 00:24:14,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:14,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844046773] [2019-11-28 00:24:14,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-28 00:24:14,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844046773] [2019-11-28 00:24:14,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145920766] [2019-11-28 00:24:14,374 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 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 00:24:14,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 00:24:14,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:14,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:14,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 00:24:14,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:14,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-28 00:24:14,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903811881] [2019-11-28 00:24:14,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:24:14,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:24:14,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:24:14,476 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 12 states. [2019-11-28 00:24:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:14,660 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2019-11-28 00:24:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:24:14,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-28 00:24:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:14,665 INFO L225 Difference]: With dead ends: 76 [2019-11-28 00:24:14,665 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 00:24:14,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:24:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 00:24:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-11-28 00:24:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:24:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2019-11-28 00:24:14,690 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 64 [2019-11-28 00:24:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:14,690 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2019-11-28 00:24:14,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:24:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2019-11-28 00:24:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 00:24:14,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:14,695 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:14,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:14,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:14,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 4 times [2019-11-28 00:24:14,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:14,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147153942] [2019-11-28 00:24:14,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-28 00:24:15,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147153942] [2019-11-28 00:24:15,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439449462] [2019-11-28 00:24:15,306 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 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 00:24:15,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:24:15,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:15,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:24:15,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-28 00:24:15,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:15,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2019-11-28 00:24:15,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644490098] [2019-11-28 00:24:15,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:24:15,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:24:15,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:15,466 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand 14 states. [2019-11-28 00:24:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:15,678 INFO L93 Difference]: Finished difference Result 143 states and 224 transitions. [2019-11-28 00:24:15,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:24:15,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2019-11-28 00:24:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:15,690 INFO L225 Difference]: With dead ends: 143 [2019-11-28 00:24:15,691 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 00:24:15,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:24:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 00:24:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-11-28 00:24:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 00:24:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2019-11-28 00:24:15,744 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 105 [2019-11-28 00:24:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:15,745 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2019-11-28 00:24:15,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:24:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2019-11-28 00:24:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 00:24:15,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:15,758 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:15,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:15,965 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1078106151, now seen corresponding path program 5 times [2019-11-28 00:24:15,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:15,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700560569] [2019-11-28 00:24:15,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 439 proven. 754 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2019-11-28 00:24:16,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700560569] [2019-11-28 00:24:16,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893767468] [2019-11-28 00:24:16,829 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 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 00:24:16,955 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-28 00:24:16,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:16,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:24:16,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 586 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2019-11-28 00:24:17,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:17,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 26 [2019-11-28 00:24:17,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287971247] [2019-11-28 00:24:17,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 00:24:17,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 00:24:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:24:17,096 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 26 states. [2019-11-28 00:24:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:17,714 INFO L93 Difference]: Finished difference Result 219 states and 396 transitions. [2019-11-28 00:24:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 00:24:17,714 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 214 [2019-11-28 00:24:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:17,717 INFO L225 Difference]: With dead ends: 219 [2019-11-28 00:24:17,717 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 00:24:17,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 00:24:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 00:24:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2019-11-28 00:24:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 00:24:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2019-11-28 00:24:17,734 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 214 [2019-11-28 00:24:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:17,735 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2019-11-28 00:24:17,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 00:24:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2019-11-28 00:24:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 00:24:17,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:17,739 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 00:24:17,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:17,943 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash 418459252, now seen corresponding path program 6 times [2019-11-28 00:24:17,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:17,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802613994] [2019-11-28 00:24:17,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,306 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 00:24:18,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802613994] [2019-11-28 00:24:18,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704035573] [2019-11-28 00:24:18,307 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 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 00:24:18,382 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-28 00:24:18,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:18,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:24:18,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:18,445 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 00:24:18,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:18,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 16 [2019-11-28 00:24:18,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710530770] [2019-11-28 00:24:18,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:24:18,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:18,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:24:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:24:18,448 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand 16 states. [2019-11-28 00:24:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:18,638 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2019-11-28 00:24:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:24:18,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-11-28 00:24:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:18,640 INFO L225 Difference]: With dead ends: 81 [2019-11-28 00:24:18,641 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 00:24:18,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:24:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 00:24:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 00:24:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 00:24:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2019-11-28 00:24:18,671 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 173 [2019-11-28 00:24:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:18,673 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2019-11-28 00:24:18,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:24:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2019-11-28 00:24:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-28 00:24:18,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:18,683 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 00:24:18,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:18,888 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 675718022, now seen corresponding path program 7 times [2019-11-28 00:24:18,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:18,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001985890] [2019-11-28 00:24:18,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-11-28 00:24:19,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001985890] [2019-11-28 00:24:19,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487517323] [2019-11-28 00:24:19,630 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 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 00:24:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:24:19,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-11-28 00:24:19,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:19,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 18 [2019-11-28 00:24:19,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68376481] [2019-11-28 00:24:19,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:24:19,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:24:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:24:19,856 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand 18 states. [2019-11-28 00:24:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:20,177 INFO L93 Difference]: Finished difference Result 259 states and 385 transitions. [2019-11-28 00:24:20,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:24:20,178 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 282 [2019-11-28 00:24:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:20,183 INFO L225 Difference]: With dead ends: 259 [2019-11-28 00:24:20,183 INFO L226 Difference]: Without dead ends: 255 [2019-11-28 00:24:20,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:24:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-28 00:24:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2019-11-28 00:24:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-28 00:24:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 357 transitions. [2019-11-28 00:24:20,214 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 357 transitions. Word has length 282 [2019-11-28 00:24:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:20,215 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 357 transitions. [2019-11-28 00:24:20,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:24:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 357 transitions. [2019-11-28 00:24:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-28 00:24:20,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:20,226 INFO L410 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:20,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:20,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1653353793, now seen corresponding path program 8 times [2019-11-28 00:24:20,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:20,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602789754] [2019-11-28 00:24:20,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:24:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:24:20,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:24:20,631 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:24:20,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:24:20 BoogieIcfgContainer [2019-11-28 00:24:20,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:24:20,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:24:20,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:24:20,746 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:24:20,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:11" (3/4) ... [2019-11-28 00:24:20,749 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:24:20,891 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:24:20,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:24:20,894 INFO L168 Benchmark]: Toolchain (without parser) took 10303.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.7 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -246.8 MB). Peak memory consumption was 134.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:20,895 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:20,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.31 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:20,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.26 ms. Allocated memory is still 1.0 GB. Free memory is still 944.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:20,896 INFO L168 Benchmark]: Boogie Preprocessor took 76.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:20,896 INFO L168 Benchmark]: RCFGBuilder took 242.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:20,897 INFO L168 Benchmark]: TraceAbstraction took 9535.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.8 MB). Peak memory consumption was 147.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:20,897 INFO L168 Benchmark]: Witness Printer took 146.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:20,899 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.31 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 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 29.26 ms. Allocated memory is still 1.0 GB. Free memory is still 944.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 242.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9535.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.8 MB). Peak memory consumption was 147.1 MB. Max. memory is 11.5 GB. * Witness Printer took 146.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 67, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 156 SDtfs, 525 SDslu, 505 SDs, 0 SdLazy, 1225 SolverSat, 527 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1324 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 49 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2316 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1839 ConstructedInterpolants, 0 QuantifiedInterpolants, 555961 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1937 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 14272/19266 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...