./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i --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/loop-invgen/nested9_true-unreach-call_true-termination.i -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 041ac1710be6e1a9f4a6c44510c9851574d3d115 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 06:09:16,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 06:09:16,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 06:09:16,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 06:09:16,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 06:09:16,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 06:09:16,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 06:09:16,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 06:09:16,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 06:09:16,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 06:09:16,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 06:09:16,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 06:09:16,412 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 06:09:16,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 06:09:16,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 06:09:16,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 06:09:16,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 06:09:16,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 06:09:16,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 06:09:16,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 06:09:16,423 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 06:09:16,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 06:09:16,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 06:09:16,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 06:09:16,428 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 06:09:16,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 06:09:16,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 06:09:16,431 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 06:09:16,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 06:09:16,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 06:09:16,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 06:09:16,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 06:09:16,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 06:09:16,438 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 06:09:16,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 06:09:16,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 06:09:16,440 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 06:09:16,470 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 06:09:16,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 06:09:16,472 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 06:09:16,475 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 06:09:16,475 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 06:09:16,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 06:09:16,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 06:09:16,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 06:09:16,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 06:09:16,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 06:09:16,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 06:09:16,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 06:09:16,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 06:09:16,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 06:09:16,478 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 06:09:16,478 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 06:09:16,479 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 06:09:16,479 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 06:09:16,479 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 06:09:16,479 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 06:09:16,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 06:09:16,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 06:09:16,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 06:09:16,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 06:09:16,482 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 06:09:16,482 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 06:09:16,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 06:09:16,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 06:09:16,483 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 -> 041ac1710be6e1a9f4a6c44510c9851574d3d115 [2018-12-31 06:09:16,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 06:09:16,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 06:09:16,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 06:09:16,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 06:09:16,548 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 06:09:16,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-12-31 06:09:16,604 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b4992f2/3036c283577e4610b88bd77a0fabf956/FLAGd5fd5e0ea [2018-12-31 06:09:16,985 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 06:09:16,986 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-12-31 06:09:16,992 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b4992f2/3036c283577e4610b88bd77a0fabf956/FLAGd5fd5e0ea [2018-12-31 06:09:17,363 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b4992f2/3036c283577e4610b88bd77a0fabf956 [2018-12-31 06:09:17,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 06:09:17,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 06:09:17,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 06:09:17,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 06:09:17,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 06:09:17,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c564361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17, skipping insertion in model container [2018-12-31 06:09:17,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 06:09:17,408 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 06:09:17,570 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:09:17,578 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 06:09:17,607 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:09:17,623 INFO L195 MainTranslator]: Completed translation [2018-12-31 06:09:17,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17 WrapperNode [2018-12-31 06:09:17,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 06:09:17,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 06:09:17,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 06:09:17,626 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 06:09:17,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 06:09:17,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 06:09:17,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 06:09:17,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 06:09:17,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (1/1) ... [2018-12-31 06:09:17,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 06:09:17,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 06:09:17,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 06:09:17,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 06:09:17,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (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 06:09:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 06:09:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 06:09:18,252 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 06:09:18,252 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-31 06:09:18,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:09:18 BoogieIcfgContainer [2018-12-31 06:09:18,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 06:09:18,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 06:09:18,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 06:09:18,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 06:09:18,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:09:17" (1/3) ... [2018-12-31 06:09:18,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93d52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:09:18, skipping insertion in model container [2018-12-31 06:09:18,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:09:17" (2/3) ... [2018-12-31 06:09:18,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93d52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:09:18, skipping insertion in model container [2018-12-31 06:09:18,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:09:18" (3/3) ... [2018-12-31 06:09:18,261 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-12-31 06:09:18,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 06:09:18,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 06:09:18,292 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 06:09:18,327 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 06:09:18,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 06:09:18,328 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 06:09:18,328 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 06:09:18,328 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 06:09:18,328 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 06:09:18,328 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 06:09:18,328 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 06:09:18,329 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 06:09:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-31 06:09:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 06:09:18,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:09:18,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:09:18,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:09:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:09:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash -331449283, now seen corresponding path program 1 times [2018-12-31 06:09:18,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:09:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:09:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:18,576 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 06:09:18,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:09:18,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 06:09:18,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 06:09:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 06:09:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 06:09:18,598 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-12-31 06:09:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:09:18,737 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-12-31 06:09:18,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 06:09:18,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 06:09:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:09:18,751 INFO L225 Difference]: With dead ends: 40 [2018-12-31 06:09:18,751 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 06:09:18,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:09:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 06:09:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-31 06:09:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 06:09:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-31 06:09:18,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2018-12-31 06:09:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:09:18,787 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-31 06:09:18,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 06:09:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-31 06:09:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 06:09:18,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:09:18,788 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:09:18,788 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:09:18,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:09:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1296087111, now seen corresponding path program 1 times [2018-12-31 06:09:18,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:09:18,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:09:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:18,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:18,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:09:18,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:09:18,947 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 06:09:18,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:19,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:09:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:09:19,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 06:09:19,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-12-31 06:09:19,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 06:09:19,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 06:09:19,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:09:19,385 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2018-12-31 06:09:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:09:19,951 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-12-31 06:09:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 06:09:19,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-31 06:09:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:09:19,954 INFO L225 Difference]: With dead ends: 43 [2018-12-31 06:09:19,954 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 06:09:19,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2018-12-31 06:09:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 06:09:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 20. [2018-12-31 06:09:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 06:09:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-31 06:09:19,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2018-12-31 06:09:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:09:19,965 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-31 06:09:19,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 06:09:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-31 06:09:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 06:09:19,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:09:19,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:09:19,966 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:09:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:09:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash 29741143, now seen corresponding path program 1 times [2018-12-31 06:09:19,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:09:19,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:09:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:09:20,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:09:20,067 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 06:09:20,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:20,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:09:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:09:20,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:09:20,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-31 06:09:20,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 06:09:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 06:09:20,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-31 06:09:20,499 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 10 states. [2018-12-31 06:09:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:09:21,020 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-12-31 06:09:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 06:09:21,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-31 06:09:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:09:21,022 INFO L225 Difference]: With dead ends: 45 [2018-12-31 06:09:21,024 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 06:09:21,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-31 06:09:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 06:09:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-12-31 06:09:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 06:09:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-12-31 06:09:21,033 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2018-12-31 06:09:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:09:21,034 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-31 06:09:21,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 06:09:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-12-31 06:09:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 06:09:21,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:09:21,035 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:09:21,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:09:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:09:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash 48602575, now seen corresponding path program 1 times [2018-12-31 06:09:21,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:09:21,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:09:21,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:21,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:21,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 06:09:21,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:09:21,137 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 06:09:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:21,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:09:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 06:09:21,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 06:09:21,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-31 06:09:21,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 06:09:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 06:09:21,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:09:21,261 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 9 states. [2018-12-31 06:09:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:09:21,472 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-12-31 06:09:21,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 06:09:21,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-31 06:09:21,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:09:21,477 INFO L225 Difference]: With dead ends: 51 [2018-12-31 06:09:21,477 INFO L226 Difference]: Without dead ends: 31 [2018-12-31 06:09:21,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-31 06:09:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-31 06:09:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-31 06:09:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 06:09:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-31 06:09:21,491 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2018-12-31 06:09:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:09:21,492 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-31 06:09:21,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 06:09:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-31 06:09:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 06:09:21,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:09:21,494 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:09:21,494 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:09:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:09:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 67888881, now seen corresponding path program 2 times [2018-12-31 06:09:21,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:09:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:09:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:21,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:09:21,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:09:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:09:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 06:09:21,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:09:21,817 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 06:09:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 06:09:21,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-31 06:09:21,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 06:09:21,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:09:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 06:09:21,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:09:21,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-12-31 06:09:21,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 06:09:21,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 06:09:21,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-31 06:09:21,937 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2018-12-31 06:09:22,726 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-12-31 06:09:23,107 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-12-31 06:09:23,451 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-12-31 06:09:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:09:23,485 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-12-31 06:09:23,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 06:09:23,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-12-31 06:09:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:09:23,487 INFO L225 Difference]: With dead ends: 42 [2018-12-31 06:09:23,488 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 06:09:23,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2018-12-31 06:09:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 06:09:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 06:09:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 06:09:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 06:09:23,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-12-31 06:09:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:09:23,490 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 06:09:23,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 06:09:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 06:09:23,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 06:09:23,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 06:09:23,783 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-12-31 06:09:23,960 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-12-31 06:09:24,366 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-31 06:09:24,369 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-12-31 06:09:24,370 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-12-31 06:09:24,370 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 06:09:24,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 06:09:24,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 06:09:24,370 INFO L451 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2018-12-31 06:09:24,370 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2018-12-31 06:09:24,371 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0))) (and (<= ULTIMATE.start_main_~i~0 0) (<= 0 ULTIMATE.start_main_~i~0)) (and (<= 2 ULTIMATE.start_main_~i~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) [2018-12-31 06:09:24,371 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-12-31 06:09:24,371 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-31 06:09:24,371 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-31 06:09:24,371 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 1 26) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= .cse4 ULTIMATE.start_main_~j~0)) (.cse3 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))) (or (let ((.cse1 (* 3 ULTIMATE.start_main_~i~0))) (and (<= 2 ULTIMATE.start_main_~i~0) .cse0 (and (<= (+ ULTIMATE.start_main_~k~0 2) .cse1) .cse2) (< ULTIMATE.start_main_~j~0 .cse1) .cse3)) (and (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~i~0) (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0))) .cse0 .cse2 .cse3 (<= ULTIMATE.start_main_~j~0 .cse4))))) [2018-12-31 06:09:24,371 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 06:09:24,372 INFO L451 ceAbstractionStarter]: At program point L25(lines 11 26) the Hoare annotation is: true [2018-12-31 06:09:24,372 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2018-12-31 06:09:24,372 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= .cse4 ULTIMATE.start_main_~j~0)) (.cse0 (* 3 ULTIMATE.start_main_~i~0)) (.cse2 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))) (or (and (<= ULTIMATE.start_main_~i~0 1) (< ULTIMATE.start_main_~j~0 .cse0) .cse1 .cse2) (and (<= 2 ULTIMATE.start_main_~i~0) .cse3 .cse1 .cse2) (and (<= 1 ULTIMATE.start_main_~i~0) .cse3 (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~k~0 1)) .cse1 .cse2) (and (<= .cse0 ULTIMATE.start_main_~j~0) .cse2 (<= ULTIMATE.start_main_~j~0 .cse4) (<= 0 ULTIMATE.start_main_~i~0))))) [2018-12-31 06:09:24,372 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-12-31 06:09:24,372 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-31 06:09:24,373 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 23) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (< ULTIMATE.start_main_~j~0 (* 3 ULTIMATE.start_main_~i~0))) (.cse1 (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0)) (.cse2 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))) (or (and (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~i~0) .cse0 .cse1 .cse2) (and .cse3 (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))) .cse0 .cse1 .cse2) (and (<= 2 ULTIMATE.start_main_~i~0) .cse3 .cse0 .cse1 .cse2))) [2018-12-31 06:09:24,373 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-12-31 06:09:24,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:09:24 BoogieIcfgContainer [2018-12-31 06:09:24,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 06:09:24,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 06:09:24,427 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 06:09:24,427 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 06:09:24,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:09:18" (3/4) ... [2018-12-31 06:09:24,440 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 06:09:24,451 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 06:09:24,452 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 06:09:24,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && k <= i) && j < 3 * i) && 2 * i <= j) && i < n) || ((((1 == cond && (\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 + 1 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0)) && j < 3 * i) && 2 * i <= j) && i < n)) || ((((2 <= i && 1 == cond) && j < 3 * i) && 2 * i <= j) && i < n) [2018-12-31 06:09:24,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= i && 1 == cond) && k + 2 <= 3 * i && 2 * i <= j) && j < 3 * i) && i < n) || ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && (\exists ULTIMATE.start_main_~i~0 : int :: (1 <= ULTIMATE.start_main_~i~0 && k <= ULTIMATE.start_main_~i~0) && 2 * ULTIMATE.start_main_~i~0 <= j)) && 1 == cond) && 2 * i <= j) && i < n) && j <= 2 * i) [2018-12-31 06:09:24,508 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 06:09:24,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 06:09:24,509 INFO L168 Benchmark]: Toolchain (without parser) took 7141.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -231.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:09:24,510 INFO L168 Benchmark]: CDTParser took 0.15 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 06:09:24,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.04 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 06:09:24,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.20 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 06:09:24,512 INFO L168 Benchmark]: Boogie Preprocessor took 38.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 06:09:24,512 INFO L168 Benchmark]: RCFGBuilder took 543.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-31 06:09:24,513 INFO L168 Benchmark]: TraceAbstraction took 6172.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.9 MB). Peak memory consumption was 306.7 MB. Max. memory is 11.5 GB. [2018-12-31 06:09:24,515 INFO L168 Benchmark]: Witness Printer took 80.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:09:24,519 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.15 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 256.04 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 45.20 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 38.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 543.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6172.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.9 MB). Peak memory consumption was 306.7 MB. Max. memory is 11.5 GB. * Witness Printer took 80.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant Derived loop invariant: (((1 <= i && i <= 1) && j <= 2 * i) || (i <= 0 && 0 <= i)) || (2 <= i && 1 == cond) - InvariantResult [Line: 1]: Loop Invariant [2018-12-31 06:09:24,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] Derived loop invariant: ((((2 <= i && 1 == cond) && k + 2 <= 3 * i && 2 * i <= j) && j < 3 * i) && i < n) || ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && (\exists ULTIMATE.start_main_~i~0 : int :: (1 <= ULTIMATE.start_main_~i~0 && k <= ULTIMATE.start_main_~i~0) && 2 * ULTIMATE.start_main_~i~0 <= j)) && 1 == cond) && 2 * i <= j) && i < n) && j <= 2 * i) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((i <= 1 && j < 3 * i) && 2 * i <= j) && i < n) || (((2 <= i && 1 == cond) && 2 * i <= j) && i < n)) || ((((1 <= i && 1 == cond) && j <= k + 1) && 2 * i <= j) && i < n)) || (((3 * i <= j && i < n) && j <= 2 * i) && 0 <= i) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-12-31 06:09:24,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2018-12-31 06:09:24,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] Derived loop invariant: ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && k <= i) && j < 3 * i) && 2 * i <= j) && i < n) || ((((1 == cond && (\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 + 1 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0)) && j < 3 * i) && 2 * i <= j) && i < n)) || ((((2 <= i && 1 == cond) && j < 3 * i) && 2 * i <= j) && i < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 6.0s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 67 SDtfs, 168 SDslu, 187 SDs, 0 SdLazy, 371 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 32 NumberOfFragments, 254 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1713 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 298 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 180 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 171 ConstructedInterpolants, 5 QuantifiedInterpolants, 9831 SizeOfPredicates, 17 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 60/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...