./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/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.25-f470102 [2019-11-28 17:28:16,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:28:16,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:28:16,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:28:16,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:28:16,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:28:16,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:28:16,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:28:16,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:28:16,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:28:16,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:28:16,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:28:16,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:28:16,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:28:16,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:28:16,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:28:16,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:28:16,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:28:16,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:28:16,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:28:16,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:28:16,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:28:16,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:28:16,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:28:16,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:28:16,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:28:16,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:28:16,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:28:16,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:28:16,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:28:16,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:28:16,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:28:16,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:28:16,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:28:16,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:28:16,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:28:16,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:28:16,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:28:16,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:28:16,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:28:16,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:28:16,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:28:17,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:28:17,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:28:17,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:28:17,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:28:17,018 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:28:17,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:28:17,018 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:28:17,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:28:17,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:28:17,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:28:17,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:28:17,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:28:17,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:28:17,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:28:17,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:28:17,022 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:28:17,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:28:17,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:28:17,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:28:17,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:28:17,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:28:17,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:17,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:28:17,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:28:17,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:28:17,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:28:17,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:28:17,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:28:17,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:28:17,026 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 17:28:17,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:28:17,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:28:17,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:28:17,371 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:28:17,371 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:28:17,372 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 17:28:17,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6e3d531/08052cd16aa2497d9cab5716e4ee3553/FLAGbfea0db41 [2019-11-28 17:28:17,939 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:28:17,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-28 17:28:17,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6e3d531/08052cd16aa2497d9cab5716e4ee3553/FLAGbfea0db41 [2019-11-28 17:28:18,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6e3d531/08052cd16aa2497d9cab5716e4ee3553 [2019-11-28 17:28:18,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:28:18,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:28:18,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:18,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:28:18,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:28:18,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350f7de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18, skipping insertion in model container [2019-11-28 17:28:18,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:28:18,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:28:18,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:18,482 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:28:18,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:18,527 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:28:18,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18 WrapperNode [2019-11-28 17:28:18,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:18,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:18,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:28:18,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:28:18,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:18,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:28:18,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:28:18,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:28:18,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... [2019-11-28 17:28:18,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:28:18,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:28:18,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:28:18,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:28:18,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:18,733 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 17:28:18,733 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 17:28:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:28:18,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:28:18,932 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:28:18,932 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:28:18,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:18 BoogieIcfgContainer [2019-11-28 17:28:18,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:28:18,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:28:18,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:28:18,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:28:18,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:28:18" (1/3) ... [2019-11-28 17:28:18,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641123f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:18, skipping insertion in model container [2019-11-28 17:28:18,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:18" (2/3) ... [2019-11-28 17:28:18,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641123f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:18, skipping insertion in model container [2019-11-28 17:28:18,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:18" (3/3) ... [2019-11-28 17:28:18,948 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2019-11-28 17:28:18,978 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:28:19,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:28:19,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:28:19,078 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:28:19,079 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:28:19,079 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:28:19,079 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:28:19,079 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:28:19,080 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:28:19,080 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:28:19,080 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:28:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 17:28:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:28:19,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:19,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:19,108 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-11-28 17:28:19,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:19,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579211936] [2019-11-28 17:28:19,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:28:19,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579211936] [2019-11-28 17:28:19,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:19,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:28:19,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353493442] [2019-11-28 17:28:19,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:28:19,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:19,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:28:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:28:19,342 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2019-11-28 17:28:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:19,465 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-28 17:28:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:28:19,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 17:28:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:19,475 INFO L225 Difference]: With dead ends: 30 [2019-11-28 17:28:19,476 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:28:19,479 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 17:28:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:28:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:28:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:28:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 17:28:19,521 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-28 17:28:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:19,522 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 17:28:19,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:28:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 17:28:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:28:19,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:19,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:19,524 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-11-28 17:28:19,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:19,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794992844] [2019-11-28 17:28:19,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:28:19,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794992844] [2019-11-28 17:28:19,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:19,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:28:19,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850354490] [2019-11-28 17:28:19,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:28:19,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:28:19,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:28:19,592 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-11-28 17:28:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:19,682 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-28 17:28:19,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:28:19,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 17:28:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:19,684 INFO L225 Difference]: With dead ends: 23 [2019-11-28 17:28:19,684 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 17:28:19,685 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 17:28:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 17:28:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 17:28:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:28:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 17:28:19,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 17:28:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:19,698 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 17:28:19,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:28:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 17:28:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:28:19,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:19,701 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:19,702 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-11-28 17:28:19,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:19,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440446235] [2019-11-28 17:28:19,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,854 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 17:28:19,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440446235] [2019-11-28 17:28:19,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391782966] [2019-11-28 17:28:19,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:19,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:28:19,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:28:19,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:19,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 17:28:19,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885138145] [2019-11-28 17:28:19,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:28:19,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:28:19,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:28:19,996 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-11-28 17:28:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:20,139 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-28 17:28:20,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:28:20,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 17:28:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:20,141 INFO L225 Difference]: With dead ends: 34 [2019-11-28 17:28:20,142 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 17:28:20,143 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 17:28:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 17:28:20,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 17:28:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 17:28:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-28 17:28:20,150 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-11-28 17:28:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:20,151 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-28 17:28:20,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:28:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-11-28 17:28:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:28:20,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:20,153 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:20,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:20,357 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:20,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:20,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2019-11-28 17:28:20,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:20,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426770507] [2019-11-28 17:28:20,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:28:20,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426770507] [2019-11-28 17:28:20,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226856606] [2019-11-28 17:28:20,510 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) [2019-11-28 17:28:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:20,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:28:20,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:28:20,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:20,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 17:28:20,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488681230] [2019-11-28 17:28:20,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:28:20,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:20,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:28:20,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:28:20,575 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. [2019-11-28 17:28:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:20,693 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-11-28 17:28:20,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:28:20,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 17:28:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:20,696 INFO L225 Difference]: With dead ends: 37 [2019-11-28 17:28:20,696 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 17:28:20,697 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 17:28:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 17:28:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-28 17:28:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 17:28:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-28 17:28:20,709 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2019-11-28 17:28:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:20,709 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-28 17:28:20,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:28:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-11-28 17:28:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 17:28:20,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:20,711 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 17:28:20,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:20,924 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2019-11-28 17:28:20,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:20,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848611549] [2019-11-28 17:28:20,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,152 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 17:28:21,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848611549] [2019-11-28 17:28:21,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855760571] [2019-11-28 17:28:21,154 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:21,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:21,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:21,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:28:21,203 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:21,299 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 17:28:21,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:21,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-28 17:28:21,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958031879] [2019-11-28 17:28:21,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:28:21,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:21,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:28:21,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:28:21,306 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 14 states. [2019-11-28 17:28:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:21,599 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2019-11-28 17:28:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:28:21,600 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-28 17:28:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:21,602 INFO L225 Difference]: With dead ends: 67 [2019-11-28 17:28:21,602 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 17:28:21,606 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 17:28:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 17:28:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 17:28:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:28:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-28 17:28:21,623 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 36 [2019-11-28 17:28:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:21,624 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-28 17:28:21,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:28:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-28 17:28:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 17:28:21,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:21,631 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 17:28:21,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:21,838 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:21,839 INFO L82 PathProgramCache]: Analyzing trace with hash 300559544, now seen corresponding path program 3 times [2019-11-28 17:28:21,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:21,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576382619] [2019-11-28 17:28:21,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,078 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 17:28:22,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576382619] [2019-11-28 17:28:22,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837871556] [2019-11-28 17:28:22,079 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 17:28:22,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 17:28:22,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:22,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:28:22,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:22,166 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 17:28:22,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:22,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-28 17:28:22,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934241292] [2019-11-28 17:28:22,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:28:22,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:28:22,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:28:22,169 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 12 states. [2019-11-28 17:28:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:22,363 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2019-11-28 17:28:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:28:22,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-28 17:28:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:22,373 INFO L225 Difference]: With dead ends: 76 [2019-11-28 17:28:22,373 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 17:28:22,374 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 17:28:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 17:28:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-11-28 17:28:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:28:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2019-11-28 17:28:22,407 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 64 [2019-11-28 17:28:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:22,408 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2019-11-28 17:28:22,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:28:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2019-11-28 17:28:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 17:28:22,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:22,416 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 17:28:22,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:22,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:22,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:22,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 4 times [2019-11-28 17:28:22,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:22,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610490829] [2019-11-28 17:28:22,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,101 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 17:28:23,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610490829] [2019-11-28 17:28:23,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601213391] [2019-11-28 17:28:23,102 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 17:28:23,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:28:23,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:23,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:28:23,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:23,252 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 17:28:23,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:23,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2019-11-28 17:28:23,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338350732] [2019-11-28 17:28:23,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:28:23,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:28:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:28:23,258 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand 14 states. [2019-11-28 17:28:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:23,470 INFO L93 Difference]: Finished difference Result 143 states and 224 transitions. [2019-11-28 17:28:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:28:23,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2019-11-28 17:28:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:23,475 INFO L225 Difference]: With dead ends: 143 [2019-11-28 17:28:23,475 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 17:28:23,476 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 17:28:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 17:28:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-11-28 17:28:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 17:28:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2019-11-28 17:28:23,503 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 105 [2019-11-28 17:28:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:23,504 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2019-11-28 17:28:23,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:28:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2019-11-28 17:28:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 17:28:23,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:23,509 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 17:28:23,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:23,714 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1078106151, now seen corresponding path program 5 times [2019-11-28 17:28:23,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:23,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407028215] [2019-11-28 17:28:23,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:24,480 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 17:28:24,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407028215] [2019-11-28 17:28:24,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119319665] [2019-11-28 17:28:24,481 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 17:28:24,605 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-28 17:28:24,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:24,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 17:28:24,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:24,792 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 17:28:24,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:24,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 26 [2019-11-28 17:28:24,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298920927] [2019-11-28 17:28:24,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 17:28:24,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 17:28:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:28:24,800 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 26 states. [2019-11-28 17:28:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:25,457 INFO L93 Difference]: Finished difference Result 219 states and 396 transitions. [2019-11-28 17:28:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 17:28:25,458 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 214 [2019-11-28 17:28:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:25,462 INFO L225 Difference]: With dead ends: 219 [2019-11-28 17:28:25,462 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 17:28:25,472 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 17:28:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 17:28:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2019-11-28 17:28:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 17:28:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2019-11-28 17:28:25,489 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 214 [2019-11-28 17:28:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:25,490 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2019-11-28 17:28:25,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 17:28:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2019-11-28 17:28:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 17:28:25,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:25,494 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:25,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:25,708 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash 418459252, now seen corresponding path program 6 times [2019-11-28 17:28:25,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:25,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561437449] [2019-11-28 17:28:25,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-28 17:28:26,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561437449] [2019-11-28 17:28:26,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223259992] [2019-11-28 17:28:26,123 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 17:28:26,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-28 17:28:26,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:26,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:28:26,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-11-28 17:28:26,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:26,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 16 [2019-11-28 17:28:26,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935480385] [2019-11-28 17:28:26,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:28:26,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:26,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:28:26,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:28:26,283 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand 16 states. [2019-11-28 17:28:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:26,465 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2019-11-28 17:28:26,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:28:26,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-11-28 17:28:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:26,468 INFO L225 Difference]: With dead ends: 81 [2019-11-28 17:28:26,468 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 17:28:26,468 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 17:28:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 17:28:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 17:28:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 17:28:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2019-11-28 17:28:26,480 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 173 [2019-11-28 17:28:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:26,481 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2019-11-28 17:28:26,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:28:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2019-11-28 17:28:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-28 17:28:26,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:26,487 INFO L410 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:26,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:26,693 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:26,693 INFO L82 PathProgramCache]: Analyzing trace with hash 675718022, now seen corresponding path program 7 times [2019-11-28 17:28:26,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:26,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135829886] [2019-11-28 17:28:26,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,471 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 17:28:27,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135829886] [2019-11-28 17:28:27,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832066437] [2019-11-28 17:28:27,472 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 17:28:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:27,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:28:27,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:27,690 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 17:28:27,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:27,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 18 [2019-11-28 17:28:27,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222222079] [2019-11-28 17:28:27,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:28:27,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:27,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:28:27,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:28:27,694 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand 18 states. [2019-11-28 17:28:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:27,971 INFO L93 Difference]: Finished difference Result 259 states and 385 transitions. [2019-11-28 17:28:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:28:27,971 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 282 [2019-11-28 17:28:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:27,975 INFO L225 Difference]: With dead ends: 259 [2019-11-28 17:28:27,975 INFO L226 Difference]: Without dead ends: 255 [2019-11-28 17:28:27,976 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 17:28:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-28 17:28:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2019-11-28 17:28:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-28 17:28:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 357 transitions. [2019-11-28 17:28:28,005 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 357 transitions. Word has length 282 [2019-11-28 17:28:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:28,006 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 357 transitions. [2019-11-28 17:28:28,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:28:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 357 transitions. [2019-11-28 17:28:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-28 17:28:28,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:28,015 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 17:28:28,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:28,220 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1653353793, now seen corresponding path program 8 times [2019-11-28 17:28:28,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:28,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190137043] [2019-11-28 17:28:28,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:28:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:28:28,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:28:28,454 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:28:28,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:28:28 BoogieIcfgContainer [2019-11-28 17:28:28,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:28:28,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:28:28,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:28:28,620 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:28:28,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:18" (3/4) ... [2019-11-28 17:28:28,624 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:28:28,795 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:28:28,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:28:28,797 INFO L168 Benchmark]: Toolchain (without parser) took 10521.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.2 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -366.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:28,799 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:28,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:28,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:28,800 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:28,800 INFO L168 Benchmark]: RCFGBuilder took 274.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:28,801 INFO L168 Benchmark]: TraceAbstraction took 9683.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -253.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:28,801 INFO L168 Benchmark]: Witness Printer took 176.12 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 17:28:28,803 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 274.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9683.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -253.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Witness Printer took 176.12 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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.3s, OverallIterations: 11, TraceHistogramMax: 67, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 156 SDtfs, 525 SDslu, 505 SDs, 0 SdLazy, 1216 SolverSat, 530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s 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.1s 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...