./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label44_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/eca-rers2012/Problem11_label44_true-unreach-call.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 06d11383001c52cfbf19a51eafe2dc3d238c9679 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:41:22,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:41:22,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:41:22,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:41:22,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:41:22,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:41:22,282 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:41:22,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:41:22,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:41:22,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:41:22,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:41:22,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:41:22,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:41:22,295 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:41:22,296 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:41:22,296 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:41:22,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:41:22,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:41:22,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:41:22,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:41:22,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:41:22,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:41:22,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:41:22,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:41:22,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:41:22,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:41:22,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:41:22,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:41:22,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:41:22,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:41:22,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:41:22,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:41:22,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:41:22,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:41:22,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:41:22,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:41:22,315 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:41:22,330 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:41:22,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:41:22,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:41:22,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:41:22,333 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:41:22,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:41:22,333 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:41:22,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:41:22,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:41:22,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:41:22,334 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:41:22,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:41:22,334 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:41:22,334 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:41:22,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:41:22,335 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:41:22,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:41:22,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:41:22,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:41:22,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:41:22,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:41:22,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:41:22,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:41:22,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:41:22,339 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:41:22,339 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:41:22,339 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:41:22,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:41:22,339 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 -> 06d11383001c52cfbf19a51eafe2dc3d238c9679 [2019-01-12 03:41:22,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:41:22,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:41:22,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:41:22,402 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:41:22,404 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:41:22,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label44_true-unreach-call.c [2019-01-12 03:41:22,475 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c061b33f/6332ca1bcd574c0bb2a3ed952d532dd6/FLAGeb59c331f [2019-01-12 03:41:23,055 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:41:23,056 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label44_true-unreach-call.c [2019-01-12 03:41:23,073 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c061b33f/6332ca1bcd574c0bb2a3ed952d532dd6/FLAGeb59c331f [2019-01-12 03:41:23,287 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c061b33f/6332ca1bcd574c0bb2a3ed952d532dd6 [2019-01-12 03:41:23,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:41:23,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:41:23,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:41:23,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:41:23,297 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:41:23,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:41:23" (1/1) ... [2019-01-12 03:41:23,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69bd0b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:23, skipping insertion in model container [2019-01-12 03:41:23,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:41:23" (1/1) ... [2019-01-12 03:41:23,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:41:23,384 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:41:23,911 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:41:23,917 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:41:24,201 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:41:24,224 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:41:24,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24 WrapperNode [2019-01-12 03:41:24,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:41:24,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:41:24,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:41:24,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:41:24,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:41:24,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:41:24,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:41:24,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:41:24,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... [2019-01-12 03:41:24,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:41:24,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:41:24,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:41:24,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:41:24,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:41:24,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:41:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:41:29,466 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:41:29,466 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:41:29,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:41:29 BoogieIcfgContainer [2019-01-12 03:41:29,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:41:29,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:41:29,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:41:29,472 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:41:29,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:41:23" (1/3) ... [2019-01-12 03:41:29,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5f47de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:41:29, skipping insertion in model container [2019-01-12 03:41:29,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:41:24" (2/3) ... [2019-01-12 03:41:29,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5f47de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:41:29, skipping insertion in model container [2019-01-12 03:41:29,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:41:29" (3/3) ... [2019-01-12 03:41:29,478 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44_true-unreach-call.c [2019-01-12 03:41:29,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:41:29,505 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:41:29,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:41:29,561 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:41:29,562 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:41:29,562 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:41:29,562 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:41:29,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:41:29,563 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:41:29,563 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:41:29,564 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:41:29,564 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:41:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:41:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 03:41:29,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:29,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:29,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2019-01-12 03:41:29,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:30,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:30,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:41:30,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:30,066 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:41:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:33,854 INFO L93 Difference]: Finished difference Result 968 states and 1740 transitions. [2019-01-12 03:41:33,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:33,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-12 03:41:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:33,881 INFO L225 Difference]: With dead ends: 968 [2019-01-12 03:41:33,881 INFO L226 Difference]: Without dead ends: 602 [2019-01-12 03:41:33,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-01-12 03:41:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 407. [2019-01-12 03:41:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-12 03:41:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 590 transitions. [2019-01-12 03:41:33,968 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 590 transitions. Word has length 26 [2019-01-12 03:41:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:33,970 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 590 transitions. [2019-01-12 03:41:33,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 590 transitions. [2019-01-12 03:41:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 03:41:33,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:33,976 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:33,977 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash -308519566, now seen corresponding path program 1 times [2019-01-12 03:41:33,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:33,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:33,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:33,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:33,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:34,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:34,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:41:34,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:34,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:34,248 INFO L87 Difference]: Start difference. First operand 407 states and 590 transitions. Second operand 4 states. [2019-01-12 03:41:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:37,186 INFO L93 Difference]: Finished difference Result 1567 states and 2285 transitions. [2019-01-12 03:41:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:37,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 03:41:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:37,195 INFO L225 Difference]: With dead ends: 1567 [2019-01-12 03:41:37,195 INFO L226 Difference]: Without dead ends: 1162 [2019-01-12 03:41:37,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-01-12 03:41:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1148. [2019-01-12 03:41:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-01-12 03:41:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1566 transitions. [2019-01-12 03:41:37,252 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1566 transitions. Word has length 94 [2019-01-12 03:41:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:37,253 INFO L480 AbstractCegarLoop]: Abstraction has 1148 states and 1566 transitions. [2019-01-12 03:41:37,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1566 transitions. [2019-01-12 03:41:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 03:41:37,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:37,257 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:37,258 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1249111919, now seen corresponding path program 1 times [2019-01-12 03:41:37,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:37,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:37,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:37,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:37,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:37,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:41:37,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:37,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:37,437 INFO L87 Difference]: Start difference. First operand 1148 states and 1566 transitions. Second operand 4 states. [2019-01-12 03:41:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:40,859 INFO L93 Difference]: Finished difference Result 4144 states and 5719 transitions. [2019-01-12 03:41:40,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:40,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-12 03:41:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:40,875 INFO L225 Difference]: With dead ends: 4144 [2019-01-12 03:41:40,875 INFO L226 Difference]: Without dead ends: 2998 [2019-01-12 03:41:40,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-01-12 03:41:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2019-01-12 03:41:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-01-12 03:41:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3666 transitions. [2019-01-12 03:41:40,937 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3666 transitions. Word has length 97 [2019-01-12 03:41:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:40,938 INFO L480 AbstractCegarLoop]: Abstraction has 2998 states and 3666 transitions. [2019-01-12 03:41:40,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3666 transitions. [2019-01-12 03:41:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-12 03:41:40,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:40,945 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:40,946 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash -101534449, now seen corresponding path program 1 times [2019-01-12 03:41:40,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:40,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:40,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:41,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:41,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:41,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:41:41,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:41:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:41,237 INFO L87 Difference]: Start difference. First operand 2998 states and 3666 transitions. Second operand 5 states. [2019-01-12 03:41:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:45,622 INFO L93 Difference]: Finished difference Result 9336 states and 11717 transitions. [2019-01-12 03:41:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:41:45,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-01-12 03:41:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:45,654 INFO L225 Difference]: With dead ends: 9336 [2019-01-12 03:41:45,654 INFO L226 Difference]: Without dead ends: 6524 [2019-01-12 03:41:45,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2019-01-12 03:41:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 6523. [2019-01-12 03:41:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6523 states. [2019-01-12 03:41:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 7930 transitions. [2019-01-12 03:41:45,785 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 7930 transitions. Word has length 153 [2019-01-12 03:41:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:45,786 INFO L480 AbstractCegarLoop]: Abstraction has 6523 states and 7930 transitions. [2019-01-12 03:41:45,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:41:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 7930 transitions. [2019-01-12 03:41:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-12 03:41:45,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:45,792 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:45,792 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash -801477748, now seen corresponding path program 1 times [2019-01-12 03:41:45,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:45,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:45,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:41:46,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:46,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:46,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:46,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:46,231 INFO L87 Difference]: Start difference. First operand 6523 states and 7930 transitions. Second operand 4 states. [2019-01-12 03:41:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:48,333 INFO L93 Difference]: Finished difference Result 14541 states and 17831 transitions. [2019-01-12 03:41:48,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:48,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-01-12 03:41:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:48,367 INFO L225 Difference]: With dead ends: 14541 [2019-01-12 03:41:48,368 INFO L226 Difference]: Without dead ends: 8204 [2019-01-12 03:41:48,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2019-01-12 03:41:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 7442. [2019-01-12 03:41:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7442 states. [2019-01-12 03:41:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7442 states to 7442 states and 8862 transitions. [2019-01-12 03:41:48,497 INFO L78 Accepts]: Start accepts. Automaton has 7442 states and 8862 transitions. Word has length 219 [2019-01-12 03:41:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:48,499 INFO L480 AbstractCegarLoop]: Abstraction has 7442 states and 8862 transitions. [2019-01-12 03:41:48,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7442 states and 8862 transitions. [2019-01-12 03:41:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-12 03:41:48,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:48,504 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:48,504 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1442400907, now seen corresponding path program 1 times [2019-01-12 03:41:48,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:48,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:48,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:48,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:48,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:48,820 INFO L87 Difference]: Start difference. First operand 7442 states and 8862 transitions. Second operand 4 states. [2019-01-12 03:41:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:50,598 INFO L93 Difference]: Finished difference Result 17112 states and 20555 transitions. [2019-01-12 03:41:50,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:50,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-01-12 03:41:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:50,639 INFO L225 Difference]: With dead ends: 17112 [2019-01-12 03:41:50,639 INFO L226 Difference]: Without dead ends: 9856 [2019-01-12 03:41:50,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9856 states. [2019-01-12 03:41:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9856 to 9466. [2019-01-12 03:41:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9466 states. [2019-01-12 03:41:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9466 states to 9466 states and 11150 transitions. [2019-01-12 03:41:50,789 INFO L78 Accepts]: Start accepts. Automaton has 9466 states and 11150 transitions. Word has length 230 [2019-01-12 03:41:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:50,789 INFO L480 AbstractCegarLoop]: Abstraction has 9466 states and 11150 transitions. [2019-01-12 03:41:50,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 9466 states and 11150 transitions. [2019-01-12 03:41:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-12 03:41:50,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:50,797 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:50,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:50,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1616620059, now seen corresponding path program 1 times [2019-01-12 03:41:50,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:50,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:51,357 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 03:41:51,677 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-12 03:41:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:51,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:51,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:41:51,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:41:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:41:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:51,854 INFO L87 Difference]: Start difference. First operand 9466 states and 11150 transitions. Second operand 5 states. [2019-01-12 03:41:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:54,155 INFO L93 Difference]: Finished difference Result 20253 states and 23894 transitions. [2019-01-12 03:41:54,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:41:54,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 258 [2019-01-12 03:41:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:54,179 INFO L225 Difference]: With dead ends: 20253 [2019-01-12 03:41:54,181 INFO L226 Difference]: Without dead ends: 12083 [2019-01-12 03:41:54,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12083 states. [2019-01-12 03:41:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12083 to 10953. [2019-01-12 03:41:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10953 states. [2019-01-12 03:41:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10953 states to 10953 states and 12810 transitions. [2019-01-12 03:41:54,329 INFO L78 Accepts]: Start accepts. Automaton has 10953 states and 12810 transitions. Word has length 258 [2019-01-12 03:41:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:54,330 INFO L480 AbstractCegarLoop]: Abstraction has 10953 states and 12810 transitions. [2019-01-12 03:41:54,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:41:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 10953 states and 12810 transitions. [2019-01-12 03:41:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-12 03:41:54,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:54,337 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:54,337 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash 292208959, now seen corresponding path program 1 times [2019-01-12 03:41:54,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:54,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:54,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 03:41:54,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:54,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:54,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:41:54,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:41:54,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:54,621 INFO L87 Difference]: Start difference. First operand 10953 states and 12810 transitions. Second operand 5 states. [2019-01-12 03:41:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:57,838 INFO L93 Difference]: Finished difference Result 34618 states and 40717 transitions. [2019-01-12 03:41:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:41:57,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-01-12 03:41:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:57,889 INFO L225 Difference]: With dead ends: 34618 [2019-01-12 03:41:57,889 INFO L226 Difference]: Without dead ends: 23851 [2019-01-12 03:41:57,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23851 states. [2019-01-12 03:41:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23851 to 17579. [2019-01-12 03:41:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-01-12 03:41:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 20174 transitions. [2019-01-12 03:41:58,180 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 20174 transitions. Word has length 261 [2019-01-12 03:41:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:58,181 INFO L480 AbstractCegarLoop]: Abstraction has 17579 states and 20174 transitions. [2019-01-12 03:41:58,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:41:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 20174 transitions. [2019-01-12 03:41:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-12 03:41:58,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:58,196 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:58,196 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1313485887, now seen corresponding path program 1 times [2019-01-12 03:41:58,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:58,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:58,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-01-12 03:41:58,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:58,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:41:58,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:41:58,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:41:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:41:58,567 INFO L87 Difference]: Start difference. First operand 17579 states and 20174 transitions. Second operand 3 states. [2019-01-12 03:42:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:42:00,048 INFO L93 Difference]: Finished difference Result 33484 states and 38341 transitions. [2019-01-12 03:42:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:42:00,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-01-12 03:42:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:42:00,070 INFO L225 Difference]: With dead ends: 33484 [2019-01-12 03:42:00,070 INFO L226 Difference]: Without dead ends: 16649 [2019-01-12 03:42:00,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:42:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16649 states. [2019-01-12 03:42:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16649 to 16645. [2019-01-12 03:42:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2019-01-12 03:42:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 18992 transitions. [2019-01-12 03:42:00,334 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 18992 transitions. Word has length 308 [2019-01-12 03:42:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:42:00,335 INFO L480 AbstractCegarLoop]: Abstraction has 16645 states and 18992 transitions. [2019-01-12 03:42:00,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:42:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 18992 transitions. [2019-01-12 03:42:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-01-12 03:42:00,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:42:00,378 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:42:00,379 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:42:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:42:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash -306541705, now seen corresponding path program 1 times [2019-01-12 03:42:00,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:42:00,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:42:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:00,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:42:00,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:42:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-01-12 03:42:01,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:42:01,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:42:01,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:42:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:42:01,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:42:01,026 INFO L87 Difference]: Start difference. First operand 16645 states and 18992 transitions. Second operand 4 states. [2019-01-12 03:42:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:42:03,567 INFO L93 Difference]: Finished difference Result 33131 states and 37836 transitions. [2019-01-12 03:42:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:42:03,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2019-01-12 03:42:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:42:03,594 INFO L225 Difference]: With dead ends: 33131 [2019-01-12 03:42:03,594 INFO L226 Difference]: Without dead ends: 16672 [2019-01-12 03:42:03,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:42:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-01-12 03:42:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16645. [2019-01-12 03:42:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2019-01-12 03:42:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 18734 transitions. [2019-01-12 03:42:03,970 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 18734 transitions. Word has length 426 [2019-01-12 03:42:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:42:03,971 INFO L480 AbstractCegarLoop]: Abstraction has 16645 states and 18734 transitions. [2019-01-12 03:42:03,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:42:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 18734 transitions. [2019-01-12 03:42:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-01-12 03:42:03,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:42:04,000 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:42:04,001 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:42:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:42:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash -758299991, now seen corresponding path program 1 times [2019-01-12 03:42:04,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:42:04,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:42:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:42:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:42:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-01-12 03:42:04,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:42:04,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:42:04,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:42:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:42:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:42:04,319 INFO L87 Difference]: Start difference. First operand 16645 states and 18734 transitions. Second operand 3 states. [2019-01-12 03:42:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:42:05,269 INFO L93 Difference]: Finished difference Result 32536 states and 36592 transitions. [2019-01-12 03:42:05,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:42:05,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-01-12 03:42:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:42:05,289 INFO L225 Difference]: With dead ends: 32536 [2019-01-12 03:42:05,289 INFO L226 Difference]: Without dead ends: 15157 [2019-01-12 03:42:05,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:42:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15157 states. [2019-01-12 03:42:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15157 to 11657. [2019-01-12 03:42:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11657 states. [2019-01-12 03:42:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 12837 transitions. [2019-01-12 03:42:05,446 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 12837 transitions. Word has length 441 [2019-01-12 03:42:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:42:05,446 INFO L480 AbstractCegarLoop]: Abstraction has 11657 states and 12837 transitions. [2019-01-12 03:42:05,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:42:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 12837 transitions. [2019-01-12 03:42:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-01-12 03:42:05,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:42:05,465 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:42:05,465 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:42:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:42:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1640817050, now seen corresponding path program 1 times [2019-01-12 03:42:05,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:42:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:42:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:42:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:42:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-01-12 03:42:06,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:42:06,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:42:06,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:42:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:42:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:42:06,073 INFO L87 Difference]: Start difference. First operand 11657 states and 12837 transitions. Second operand 3 states. [2019-01-12 03:42:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:42:06,716 INFO L93 Difference]: Finished difference Result 22569 states and 24860 transitions. [2019-01-12 03:42:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:42:06,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-01-12 03:42:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:42:06,718 INFO L225 Difference]: With dead ends: 22569 [2019-01-12 03:42:06,718 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:42:06,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:42:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:42:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:42:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:42:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:42:06,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 496 [2019-01-12 03:42:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:42:06,728 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:42:06,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:42:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:42:06,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:42:06,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:42:06,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,917 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 117 [2019-01-12 03:42:06,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:06,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:42:07,065 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 117 [2019-01-12 03:42:07,853 WARN L181 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 54 [2019-01-12 03:42:08,604 WARN L181 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 54 [2019-01-12 03:42:08,608 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:42:08,608 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:42:08,608 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:42:08,608 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:42:08,608 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,608 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,608 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,608 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,609 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:42:08,610 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,616 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse11 (= ~a25~0 9))) (let ((.cse8 (< 245 ~a29~0)) (.cse2 (= ~a25~0 10)) (.cse4 (not .cse11)) (.cse6 (<= 130 ~a29~0)) (.cse9 (<= 312 ~a23~0)) (.cse10 (= ~a25~0 12)) (.cse7 (<= ~a23~0 138)) (.cse0 (<= ~a29~0 140)) (.cse1 (= ~a8~0 15)) (.cse5 (= ~a4~0 1)) (.cse3 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse3) (and (and .cse7 .cse8) .cse1 .cse3) (and .cse4 (not (= ~a25~0 11)) .cse1 .cse5 .cse9 .cse3) (and .cse1 .cse5 .cse8 .cse3) (and .cse1 (and .cse10 (<= ~a4~0 0)) .cse3) (and .cse1 .cse5 .cse7 .cse2) (and .cse0 .cse11 .cse1 .cse7 .cse3) (and .cse4 .cse1 .cse7 (not .cse5) .cse3) (and .cse1 .cse5 .cse6 .cse9 .cse3) (and (or (and .cse10 .cse1 .cse7) (and .cse11 .cse1 .cse5 .cse7) (and .cse0 (<= ~a23~0 312) .cse1 .cse5 (< 138 ~a23~0))) .cse3)))) [2019-01-12 03:42:08,616 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,616 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,616 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:42:08,617 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:42:08,618 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:42:08,618 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,621 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:42:08,622 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,623 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,624 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,627 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:42:08,628 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:42:08,629 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,630 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,635 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,636 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:42:08,637 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:42:08,638 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,639 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,640 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:42:08,640 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,645 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,646 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,647 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,648 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,648 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,651 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,652 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,653 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,654 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,654 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,656 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:42:08,657 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,658 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,658 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,661 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse11 (= ~a25~0 9))) (let ((.cse8 (< 245 ~a29~0)) (.cse2 (= ~a25~0 10)) (.cse4 (not .cse11)) (.cse6 (<= 130 ~a29~0)) (.cse9 (<= 312 ~a23~0)) (.cse10 (= ~a25~0 12)) (.cse7 (<= ~a23~0 138)) (.cse0 (<= ~a29~0 140)) (.cse1 (= ~a8~0 15)) (.cse5 (= ~a4~0 1)) (.cse3 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse6 .cse3) (and (and .cse7 .cse8) .cse1 .cse3) (and .cse4 (not (= ~a25~0 11)) .cse1 .cse5 .cse9 .cse3) (and .cse1 .cse5 .cse8 .cse3) (and .cse1 (and .cse10 (<= ~a4~0 0)) .cse3) (and .cse1 .cse5 .cse7 .cse2) (and .cse0 .cse11 .cse1 .cse7 .cse3) (and .cse4 .cse1 .cse7 (not .cse5) .cse3) (and .cse1 .cse5 .cse6 .cse9 .cse3) (and (or (and .cse10 .cse1 .cse7) (and .cse11 .cse1 .cse5 .cse7) (and .cse0 (<= ~a23~0 312) .cse1 .cse5 (< 138 ~a23~0))) .cse3)))) [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,662 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,663 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:42:08,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:42:08 BoogieIcfgContainer [2019-01-12 03:42:08,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:42:08,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:42:08,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:42:08,719 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:42:08,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:41:29" (3/4) ... [2019-01-12 03:42:08,725 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:42:08,755 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:42:08,757 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:42:09,004 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:42:09,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:42:09,006 INFO L168 Benchmark]: Toolchain (without parser) took 45713.63 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 729.3 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -88.4 MB). Peak memory consumption was 640.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:42:09,006 INFO L168 Benchmark]: CDTParser took 0.22 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. [2019-01-12 03:42:09,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 932.98 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 892.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:42:09,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 242.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -233.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:42:09,007 INFO L168 Benchmark]: Boogie Preprocessor took 142.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:42:09,009 INFO L168 Benchmark]: RCFGBuilder took 4855.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 934.9 MB in the end (delta: 177.6 MB). Peak memory consumption was 177.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:42:09,010 INFO L168 Benchmark]: TraceAbstraction took 39247.67 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 575.1 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -128.3 MB). Peak memory consumption was 446.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:42:09,011 INFO L168 Benchmark]: Witness Printer took 285.21 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:42:09,014 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.22 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 932.98 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 892.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 242.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -233.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 142.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4855.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 934.9 MB in the end (delta: 177.6 MB). Peak memory consumption was 177.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39247.67 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 575.1 MB). Free memory was 934.9 MB in the beginning and 1.1 GB in the end (delta: -128.3 MB). Peak memory consumption was 446.8 MB. Max. memory is 11.5 GB. * Witness Printer took 285.21 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 84]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((a29 <= 140 && a8 == 15) && a25 == 10) && a3 == 1) || ((((!(a25 == 9) && a8 == 15) && a4 == 1) && 130 <= a29) && a3 == 1)) || (((a23 <= 138 && 245 < a29) && a8 == 15) && a3 == 1)) || (((((!(a25 == 9) && !(a25 == 11)) && a8 == 15) && a4 == 1) && 312 <= a23) && a3 == 1)) || (((a8 == 15 && a4 == 1) && 245 < a29) && a3 == 1)) || ((a8 == 15 && a25 == 12 && a4 <= 0) && a3 == 1)) || (((a8 == 15 && a4 == 1) && a23 <= 138) && a25 == 10)) || ((((a29 <= 140 && a25 == 9) && a8 == 15) && a23 <= 138) && a3 == 1)) || ((((!(a25 == 9) && a8 == 15) && a23 <= 138) && !(a4 == 1)) && a3 == 1)) || ((((a8 == 15 && a4 == 1) && 130 <= a29) && 312 <= a23) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a23 <= 138) || (((a25 == 9 && a8 == 15) && a4 == 1) && a23 <= 138)) || ((((a29 <= 140 && a23 <= 312) && a8 == 15) && a4 == 1) && 138 < a23)) && a3 == 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((((a29 <= 140 && a8 == 15) && a25 == 10) && a3 == 1) || ((((!(a25 == 9) && a8 == 15) && a4 == 1) && 130 <= a29) && a3 == 1)) || (((a23 <= 138 && 245 < a29) && a8 == 15) && a3 == 1)) || (((((!(a25 == 9) && !(a25 == 11)) && a8 == 15) && a4 == 1) && 312 <= a23) && a3 == 1)) || (((a8 == 15 && a4 == 1) && 245 < a29) && a3 == 1)) || ((a8 == 15 && a25 == 12 && a4 <= 0) && a3 == 1)) || (((a8 == 15 && a4 == 1) && a23 <= 138) && a25 == 10)) || ((((a29 <= 140 && a25 == 9) && a8 == 15) && a23 <= 138) && a3 == 1)) || ((((!(a25 == 9) && a8 == 15) && a23 <= 138) && !(a4 == 1)) && a3 == 1)) || ((((a8 == 15 && a4 == 1) && 130 <= a29) && 312 <= a23) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && a23 <= 138) || (((a25 == 9 && a8 == 15) && a4 == 1) && a23 <= 138)) || ((((a29 <= 140 && a23 <= 312) && a8 == 15) && a4 == 1) && 138 < a23)) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 39.1s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1520 SDtfs, 4314 SDslu, 466 SDs, 0 SdLazy, 12149 SolverSat, 2313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17579occurred in iteration=8, 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: 1.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 12295 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 136 NumberOfFragments, 401 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5346 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1708 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3009 NumberOfCodeBlocks, 3009 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2296024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 2465/2465 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...