./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.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 7e40a98558d0111ea95f3ee60a44cc14c7768182 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:51:54,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:51:54,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:51:54,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:51:54,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:51:54,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:51:54,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:51:54,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:51:54,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:51:54,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:51:54,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:51:54,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:51:54,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:51:54,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:51:54,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:51:54,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:51:54,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:51:54,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:51:54,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:51:54,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:51:54,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:51:54,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:51:54,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:51:54,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:51:54,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:51:54,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:51:54,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:51:54,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:51:54,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:51:54,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:51:54,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:51:54,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:51:54,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:51:54,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:51:54,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:51:54,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:51:54,441 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:51:54,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:51:54,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:51:54,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:51:54,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:51:54,472 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:51:54,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:51:54,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:51:54,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:51:54,473 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:51:54,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:51:54,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:51:54,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:51:54,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:51:54,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:51:54,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:51:54,475 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:51:54,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:51:54,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:51:54,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:51:54,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:51:54,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:51:54,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:51:54,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:51:54,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:51:54,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:51:54,478 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:51:54,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:51:54,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:51:54,479 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2018-12-31 09:51:54,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:51:54,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:51:54,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:51:54,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:51:54,578 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:51:54,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:51:54,650 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfcd2e8b/d6413e9793284f08a7d6cd390318255d/FLAG948c0f0af [2018-12-31 09:51:55,136 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:51:55,137 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:51:55,143 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfcd2e8b/d6413e9793284f08a7d6cd390318255d/FLAG948c0f0af [2018-12-31 09:51:55,497 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfcd2e8b/d6413e9793284f08a7d6cd390318255d [2018-12-31 09:51:55,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:51:55,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:51:55,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:51:55,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:51:55,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:51:55,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ab9922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55, skipping insertion in model container [2018-12-31 09:51:55,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:51:55,538 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:51:55,726 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:51:55,733 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:51:55,754 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:51:55,768 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:51:55,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55 WrapperNode [2018-12-31 09:51:55,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:51:55,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:51:55,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:51:55,770 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:51:55,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:51:55,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:51:55,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:51:55,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:51:55,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (1/1) ... [2018-12-31 09:51:55,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:51:55,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:51:55,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:51:55,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:51:55,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (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 [2018-12-31 09:51:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-31 09:51:55,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-31 09:51:55,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:51:55,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:51:56,178 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:51:56,178 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:51:56,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:56 BoogieIcfgContainer [2018-12-31 09:51:56,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:51:56,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:51:56,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:51:56,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:51:56,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:51:55" (1/3) ... [2018-12-31 09:51:56,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde2ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:51:56, skipping insertion in model container [2018-12-31 09:51:56,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:55" (2/3) ... [2018-12-31 09:51:56,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde2ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:51:56, skipping insertion in model container [2018-12-31 09:51:56,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:56" (3/3) ... [2018-12-31 09:51:56,203 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:51:56,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:51:56,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:51:56,281 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:51:56,328 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:51:56,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:51:56,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:51:56,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:51:56,329 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:51:56,329 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:51:56,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:51:56,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:51:56,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:51:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-31 09:51:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 09:51:56,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:56,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:56,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:56,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:56,363 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2018-12-31 09:51:56,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:56,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:56,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:56,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:56,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:51:56,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:56,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:56,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:56,593 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2018-12-31 09:51:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:56,731 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-12-31 09:51:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:51:56,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 09:51:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:56,742 INFO L225 Difference]: With dead ends: 27 [2018-12-31 09:51:56,743 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 09:51:56,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 09:51:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 09:51:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:51:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:51:56,787 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2018-12-31 09:51:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:56,788 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:51:56,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:51:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 09:51:56,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:56,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:56,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2018-12-31 09:51:56,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:56,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:56,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:56,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:51:56,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:56,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:56,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:56,873 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2018-12-31 09:51:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:57,180 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-12-31 09:51:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:51:57,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 09:51:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:57,182 INFO L225 Difference]: With dead ends: 23 [2018-12-31 09:51:57,182 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:51:57,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:51:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-31 09:51:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:51:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:51:57,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2018-12-31 09:51:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:57,190 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:51:57,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:51:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:51:57,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:57,194 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:57,194 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2018-12-31 09:51:57,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:51:57,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:57,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:57,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:57,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:51:57,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:57,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-31 09:51:57,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:51:57,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:51:57,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:51:57,801 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2018-12-31 09:51:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:58,154 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-12-31 09:51:58,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:51:58,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-31 09:51:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:58,158 INFO L225 Difference]: With dead ends: 34 [2018-12-31 09:51:58,158 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:51:58,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:51:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:51:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 09:51:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 09:51:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-31 09:51:58,167 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2018-12-31 09:51:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:58,167 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-31 09:51:58,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:51:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-31 09:51:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:51:58,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:58,171 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:58,172 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2018-12-31 09:51:58,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:58,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:58,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:51:58,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:58,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:58,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:58,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:51:58,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:58,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:51:58,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:51:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:51:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:58,428 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2018-12-31 09:51:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:58,742 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2018-12-31 09:51:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:51:58,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-31 09:51:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:58,747 INFO L225 Difference]: With dead ends: 28 [2018-12-31 09:51:58,748 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 09:51:58,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:51:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 09:51:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-31 09:51:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 09:51:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-31 09:51:58,765 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2018-12-31 09:51:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:58,767 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-31 09:51:58,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:51:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-12-31 09:51:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:58,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:58,771 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:58,772 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2018-12-31 09:51:58,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:58,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:58,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:58,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-31 09:51:58,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:58,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:58,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:51:58,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:51:58,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:58,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 09:51:59,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:59,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-12-31 09:51:59,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:51:59,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:51:59,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:51:59,044 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 8 states. [2018-12-31 09:51:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:59,272 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2018-12-31 09:51:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:51:59,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-31 09:51:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:59,278 INFO L225 Difference]: With dead ends: 36 [2018-12-31 09:51:59,278 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 09:51:59,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:51:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 09:51:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-12-31 09:51:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 09:51:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-12-31 09:51:59,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2018-12-31 09:51:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:59,289 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-12-31 09:51:59,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:51:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2018-12-31 09:51:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 09:51:59,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:59,293 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:59,294 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:59,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1115014434, now seen corresponding path program 3 times [2018-12-31 09:51:59,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:59,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:59,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-31 09:51:59,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:59,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:59,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:51:59,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-31 09:51:59,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:59,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-12-31 09:51:59,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:59,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-12-31 09:51:59,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 09:51:59,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 09:51:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:51:59,791 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 12 states. [2018-12-31 09:52:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:00,290 INFO L93 Difference]: Finished difference Result 72 states and 139 transitions. [2018-12-31 09:52:00,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:52:00,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2018-12-31 09:52:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:00,295 INFO L225 Difference]: With dead ends: 72 [2018-12-31 09:52:00,295 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 09:52:00,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:52:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 09:52:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-12-31 09:52:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 09:52:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 59 transitions. [2018-12-31 09:52:00,310 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 59 transitions. Word has length 92 [2018-12-31 09:52:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:00,311 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 59 transitions. [2018-12-31 09:52:00,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 09:52:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 59 transitions. [2018-12-31 09:52:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 09:52:00,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:00,314 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:00,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -181993491, now seen corresponding path program 4 times [2018-12-31 09:52:00,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:00,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-12-31 09:52:00,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:00,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:00,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:52:00,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:52:00,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:00,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-31 09:52:00,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-12-31 09:52:00,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:52:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:52:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:52:00,573 INFO L87 Difference]: Start difference. First operand 39 states and 59 transitions. Second operand 8 states. [2018-12-31 09:52:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:00,917 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2018-12-31 09:52:00,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:52:00,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-31 09:52:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:00,922 INFO L225 Difference]: With dead ends: 48 [2018-12-31 09:52:00,922 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 09:52:00,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:52:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 09:52:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-31 09:52:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 09:52:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-12-31 09:52:00,935 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 78 [2018-12-31 09:52:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:00,935 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2018-12-31 09:52:00,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:52:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2018-12-31 09:52:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-31 09:52:00,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:00,939 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:00,939 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2037341067, now seen corresponding path program 5 times [2018-12-31 09:52:00,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:00,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-12-31 09:52:01,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:01,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:01,248 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 09:52:01,326 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-12-31 09:52:01,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:01,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-12-31 09:52:01,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:01,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 14 [2018-12-31 09:52:01,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 09:52:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 09:52:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:52:01,582 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand 14 states. [2018-12-31 09:52:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:02,216 INFO L93 Difference]: Finished difference Result 114 states and 225 transitions. [2018-12-31 09:52:02,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 09:52:02,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 132 [2018-12-31 09:52:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:02,219 INFO L225 Difference]: With dead ends: 114 [2018-12-31 09:52:02,219 INFO L226 Difference]: Without dead ends: 68 [2018-12-31 09:52:02,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2018-12-31 09:52:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-31 09:52:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-31 09:52:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 09:52:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2018-12-31 09:52:02,240 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 132 [2018-12-31 09:52:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:02,241 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2018-12-31 09:52:02,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 09:52:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2018-12-31 09:52:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-31 09:52:02,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:02,244 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:02,244 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash 418459252, now seen corresponding path program 6 times [2018-12-31 09:52:02,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:02,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:02,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:02,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-12-31 09:52:02,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:02,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:02,796 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 09:52:02,915 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-12-31 09:52:02,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:02,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-12-31 09:52:03,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:03,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-31 09:52:03,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:52:03,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:52:03,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:52:03,005 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand 9 states. [2018-12-31 09:52:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:03,257 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2018-12-31 09:52:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:52:03,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2018-12-31 09:52:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:03,265 INFO L225 Difference]: With dead ends: 80 [2018-12-31 09:52:03,265 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 09:52:03,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:52:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 09:52:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-31 09:52:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 09:52:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2018-12-31 09:52:03,285 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 173 [2018-12-31 09:52:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:03,285 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2018-12-31 09:52:03,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:52:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2018-12-31 09:52:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-31 09:52:03,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:03,290 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:03,290 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2038132799, now seen corresponding path program 7 times [2018-12-31 09:52:03,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:03,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:03,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:03,813 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-12-31 09:52:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 809 proven. 551 refuted. 0 times theorem prover too weak. 3653 trivial. 0 not checked. [2018-12-31 09:52:03,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:03,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:03,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:04,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 208 proven. 1184 refuted. 0 times theorem prover too weak. 3621 trivial. 0 not checked. [2018-12-31 09:52:04,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:04,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2018-12-31 09:52:04,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 09:52:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 09:52:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:52:04,325 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand 19 states. [2018-12-31 09:52:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:05,561 INFO L93 Difference]: Finished difference Result 170 states and 305 transitions. [2018-12-31 09:52:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-31 09:52:05,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 295 [2018-12-31 09:52:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:05,566 INFO L225 Difference]: With dead ends: 170 [2018-12-31 09:52:05,566 INFO L226 Difference]: Without dead ends: 106 [2018-12-31 09:52:05,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=494, Invalid=1668, Unknown=0, NotChecked=0, Total=2162 [2018-12-31 09:52:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-31 09:52:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2018-12-31 09:52:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-31 09:52:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2018-12-31 09:52:05,584 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 295 [2018-12-31 09:52:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:05,584 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2018-12-31 09:52:05,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 09:52:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2018-12-31 09:52:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-12-31 09:52:05,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:05,594 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 59, 36, 36, 36, 36, 36, 36, 36, 23, 14, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:05,595 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 832744116, now seen corresponding path program 8 times [2018-12-31 09:52:05,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:05,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:06,222 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-12-31 09:52:06,493 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-12-31 09:52:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 2481 proven. 690 refuted. 0 times theorem prover too weak. 11572 trivial. 0 not checked. [2018-12-31 09:52:06,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:06,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:52:06,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:52:06,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:06,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 376 proven. 2523 refuted. 0 times theorem prover too weak. 11844 trivial. 0 not checked. [2018-12-31 09:52:07,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:07,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2018-12-31 09:52:07,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 09:52:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 09:52:07,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-12-31 09:52:07,534 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand 21 states. [2018-12-31 09:52:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:09,204 INFO L93 Difference]: Finished difference Result 224 states and 394 transitions. [2018-12-31 09:52:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-31 09:52:09,204 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 500 [2018-12-31 09:52:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:09,209 INFO L225 Difference]: With dead ends: 224 [2018-12-31 09:52:09,209 INFO L226 Difference]: Without dead ends: 135 [2018-12-31 09:52:09,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=660, Invalid=2420, Unknown=0, NotChecked=0, Total=3080 [2018-12-31 09:52:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-31 09:52:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 120. [2018-12-31 09:52:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-31 09:52:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 177 transitions. [2018-12-31 09:52:09,227 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 177 transitions. Word has length 500 [2018-12-31 09:52:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:09,228 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 177 transitions. [2018-12-31 09:52:09,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 09:52:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 177 transitions. [2018-12-31 09:52:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2018-12-31 09:52:09,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:09,262 INFO L402 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:09,262 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:09,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:09,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1068040291, now seen corresponding path program 9 times [2018-12-31 09:52:09,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:09,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:09,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3756 proven. 2149 refuted. 0 times theorem prover too weak. 45005 trivial. 0 not checked. [2018-12-31 09:52:10,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:10,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:10,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:52:10,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-31 09:52:10,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:10,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 15360 proven. 413 refuted. 0 times theorem prover too weak. 35137 trivial. 0 not checked. [2018-12-31 09:52:11,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:11,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-12-31 09:52:11,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 09:52:11,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 09:52:11,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-31 09:52:11,042 INFO L87 Difference]: Start difference. First operand 120 states and 177 transitions. Second operand 21 states. [2018-12-31 09:52:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:12,740 INFO L93 Difference]: Finished difference Result 273 states and 515 transitions. [2018-12-31 09:52:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-31 09:52:12,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 922 [2018-12-31 09:52:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:12,750 INFO L225 Difference]: With dead ends: 273 [2018-12-31 09:52:12,750 INFO L226 Difference]: Without dead ends: 138 [2018-12-31 09:52:12,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 959 GetRequests, 923 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=334, Invalid=1072, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 09:52:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-31 09:52:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 110. [2018-12-31 09:52:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-31 09:52:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2018-12-31 09:52:12,767 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 922 [2018-12-31 09:52:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:12,769 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-12-31 09:52:12,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 09:52:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2018-12-31 09:52:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-12-31 09:52:12,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:12,777 INFO L402 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:12,777 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2028492684, now seen corresponding path program 10 times [2018-12-31 09:52:12,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:12,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:12,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:12,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-12-31 09:52:14,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:14,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:14,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:52:14,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:52:14,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:14,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 0 proven. 10899 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-12-31 09:52:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:16,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2018-12-31 09:52:16,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-31 09:52:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-31 09:52:16,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 09:52:16,279 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 36 states. [2018-12-31 09:52:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:17,501 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2018-12-31 09:52:17,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 09:52:17,502 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 745 [2018-12-31 09:52:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:17,507 INFO L225 Difference]: With dead ends: 123 [2018-12-31 09:52:17,507 INFO L226 Difference]: Without dead ends: 119 [2018-12-31 09:52:17,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 876 SyntacticMatches, 55 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 09:52:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-31 09:52:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-12-31 09:52:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 09:52:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2018-12-31 09:52:17,522 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 745 [2018-12-31 09:52:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:17,522 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2018-12-31 09:52:17,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-31 09:52:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2018-12-31 09:52:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2018-12-31 09:52:17,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:17,533 INFO L402 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:17,533 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1738482173, now seen corresponding path program 11 times [2018-12-31 09:52:17,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:17,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:17,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:17,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:17,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 1193 proven. 5401 refuted. 0 times theorem prover too weak. 44316 trivial. 0 not checked. [2018-12-31 09:52:18,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:18,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:18,565 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 09:52:19,576 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 112 check-sat command(s) [2018-12-31 09:52:19,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:19,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 25806 proven. 2159 refuted. 0 times theorem prover too weak. 22945 trivial. 0 not checked. [2018-12-31 09:52:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:21,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 25 [2018-12-31 09:52:21,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 09:52:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 09:52:21,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-12-31 09:52:21,268 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand 25 states. [2018-12-31 09:52:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:22,135 INFO L93 Difference]: Finished difference Result 254 states and 351 transitions. [2018-12-31 09:52:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-31 09:52:22,136 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 922 [2018-12-31 09:52:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:22,138 INFO L225 Difference]: With dead ends: 254 [2018-12-31 09:52:22,138 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:52:22,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2018-12-31 09:52:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:52:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:52:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:52:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:52:22,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 922 [2018-12-31 09:52:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:22,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:52:22,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 09:52:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:52:22,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:52:22,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:52:22,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:52:22,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:52:22,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:52:22,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:52:22,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:52:24,648 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 105 DAG size of output: 8 [2018-12-31 09:52:26,618 WARN L181 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 145 DAG size of output: 59 [2018-12-31 09:52:26,648 INFO L448 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-12-31 09:52:26,648 INFO L451 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-12-31 09:52:26,648 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (<= 2 fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) [2018-12-31 09:52:26,649 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-31 09:52:26,649 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse2 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse1 (<= |fibonacci_#in~n| 4)) (.cse3 (<= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse0 (and (<= 4 |fibonacci_#in~n|) .cse2 (<= |fibonacci_#t~ret0| 2) .cse1 (<= 2 |fibonacci_#t~ret0|) .cse3))) (and (or (<= 10 |fibonacci_#in~n|) .cse0 (and (<= 5 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 6) (<= |fibonacci_#t~ret0| 5) (<= 6 fibonacci_~n)) (and (<= 13 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 8) (<= 8 |fibonacci_#in~n|) (<= |fibonacci_#t~ret0| 13)) (and (<= 7 |fibonacci_#in~n|) (<= |fibonacci_#t~ret0| 8) (<= 8 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 7)) (and (<= |fibonacci_#t~ret0| 21) (<= 21 |fibonacci_#t~ret0|) (<= 9 fibonacci_~n)) (and (<= 3 |fibonacci_#t~ret0|) (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) (<= 5 fibonacci_~n)) (and (<= |fibonacci_#t~ret0| 1) (<= 1 |fibonacci_#t~ret0|) .cse1)) (or .cse0 (or (< 4 |fibonacci_#in~n|) (< |fibonacci_#in~n| 4))) .cse2 (< 1 |fibonacci_#in~n|) .cse3))) [2018-12-31 09:52:26,649 INFO L448 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-12-31 09:52:26,649 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-12-31 09:52:26,649 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-31 09:52:26,652 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-12-31 09:52:26,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:52:26,653 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-31 09:52:26,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:52:26,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:52:26,654 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-12-31 09:52:26,654 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2018-12-31 09:52:26,654 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-12-31 09:52:26,654 INFO L444 ceAbstractionStarter]: At program point L25(lines 25 33) the Hoare annotation is: (<= 9 ULTIMATE.start_main_~x~0) [2018-12-31 09:52:26,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2018-12-31 09:52:26,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:52:26 BoogieIcfgContainer [2018-12-31 09:52:26,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:52:26,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:52:26,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:52:26,682 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:52:26,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:56" (3/4) ... [2018-12-31 09:52:26,690 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:52:26,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-12-31 09:52:26,707 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 09:52:26,708 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:52:26,786 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:52:26,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:52:26,788 INFO L168 Benchmark]: Toolchain (without parser) took 31286.98 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 951.4 MB in the beginning and 854.4 MB in the end (delta: 97.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-31 09:52:26,791 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:26,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.66 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:26,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.69 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:26,796 INFO L168 Benchmark]: Boogie Preprocessor took 22.03 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:26,797 INFO L168 Benchmark]: RCFGBuilder took 349.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:26,797 INFO L168 Benchmark]: TraceAbstraction took 30501.46 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 874.0 MB). Free memory was 1.1 GB in the beginning and 854.4 MB in the end (delta: 256.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-31 09:52:26,803 INFO L168 Benchmark]: Witness Printer took 105.59 ms. Allocated memory is still 2.0 GB. Free memory is still 854.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:26,812 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.66 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 37.69 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.03 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 349.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30501.46 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 874.0 MB). Free memory was 1.1 GB in the beginning and 854.4 MB in the end (delta: 256.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 105.59 ms. Allocated memory is still 2.0 GB. Free memory is still 854.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 9 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. SAFE Result, 30.3s OverallTime, 14 OverallIterations, 135 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 314 SDtfs, 911 SDslu, 1871 SDs, 0 SdLazy, 3391 SolverSat, 1173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4449 GetRequests, 4079 SyntacticMatches, 56 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 69 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 341 PreInvPairs, 565 NumberOfFragments, 158 HoareAnnotationTreeSize, 341 FomulaSimplifications, 2768 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 5570 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 7899 NumberOfCodeBlocks, 7380 NumberOfCodeBlocksAsserted, 238 NumberOfCheckSat, 7873 ConstructedInterpolants, 0 QuantifiedInterpolants, 9944723 SizeOfPredicates, 73 NumberOfNonLiveVariables, 7608 ConjunctsInSsa, 583 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 278003/316108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...