./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_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 3ce72b7e5333914b2e09c2dde7071fc003367434 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 23:24:58,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:24:58,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:24:58,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:24:58,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:24:58,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:24:58,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:24:58,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:24:58,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:24:58,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:24:58,492 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:24:58,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:24:58,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:24:58,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:24:58,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:24:58,497 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:24:58,498 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:24:58,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:24:58,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:24:58,504 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:24:58,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:24:58,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:24:58,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:24:58,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:24:58,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:24:58,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:24:58,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:24:58,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:24:58,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:24:58,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:24:58,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:24:58,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:24:58,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:24:58,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:24:58,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:24:58,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:24:58,521 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:24:58,536 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:24:58,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:24:58,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:24:58,538 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:24:58,538 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:24:58,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:24:58,538 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:24:58,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:24:58,540 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:24:58,540 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:24:58,540 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:24:58,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:24:58,540 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:24:58,540 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:24:58,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:24:58,541 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:24:58,542 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:24:58,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:24:58,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:24:58,542 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:24:58,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:24:58,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:24:58,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:24:58,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:24:58,544 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:24:58,544 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:24:58,544 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:24:58,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:24:58,545 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 -> 3ce72b7e5333914b2e09c2dde7071fc003367434 [2018-12-30 23:24:58,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:24:58,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:24:58,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:24:58,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:24:58,642 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:24:58,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_true-unreach-call.c [2018-12-30 23:24:58,708 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d246da880/9aff0386beb14c6ea04f38a0dc08e85f/FLAG1fed14d55 [2018-12-30 23:24:59,406 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:24:59,407 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_true-unreach-call.c [2018-12-30 23:24:59,434 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d246da880/9aff0386beb14c6ea04f38a0dc08e85f/FLAG1fed14d55 [2018-12-30 23:24:59,520 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d246da880/9aff0386beb14c6ea04f38a0dc08e85f [2018-12-30 23:24:59,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:24:59,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:24:59,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:24:59,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:24:59,536 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:24:59,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:24:59" (1/1) ... [2018-12-30 23:24:59,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c17b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:24:59, skipping insertion in model container [2018-12-30 23:24:59,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:24:59" (1/1) ... [2018-12-30 23:24:59,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:24:59,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:25:00,365 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:25:00,370 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:25:00,682 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:25:00,706 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:25:00,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00 WrapperNode [2018-12-30 23:25:00,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:25:00,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:25:00,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:25:00,708 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:25:00,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:00,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:25:01,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:25:01,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:25:01,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:25:01,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... [2018-12-30 23:25:01,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:25:01,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:25:01,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:25:01,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:25:01,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:25:01,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:25:01,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:25:08,096 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:25:08,097 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 23:25:08,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:25:08 BoogieIcfgContainer [2018-12-30 23:25:08,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:25:08,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:25:08,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:25:08,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:25:08,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:24:59" (1/3) ... [2018-12-30 23:25:08,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6d0073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:25:08, skipping insertion in model container [2018-12-30 23:25:08,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:00" (2/3) ... [2018-12-30 23:25:08,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6d0073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:25:08, skipping insertion in model container [2018-12-30 23:25:08,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:25:08" (3/3) ... [2018-12-30 23:25:08,109 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label24_true-unreach-call.c [2018-12-30 23:25:08,117 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:25:08,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:25:08,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:25:08,182 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:25:08,182 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:25:08,183 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:25:08,183 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:25:08,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:25:08,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:25:08,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:25:08,183 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:25:08,183 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:25:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2018-12-30 23:25:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-30 23:25:08,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:08,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:25:08,223 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:08,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:08,229 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2018-12-30 23:25:08,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:08,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:08,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:25:08,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:25:08,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:25:08,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:25:08,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:25:08,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:08,724 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2018-12-30 23:25:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:25:17,021 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2018-12-30 23:25:17,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:25:17,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-30 23:25:17,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:25:17,048 INFO L225 Difference]: With dead ends: 1466 [2018-12-30 23:25:17,048 INFO L226 Difference]: Without dead ends: 974 [2018-12-30 23:25:17,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-30 23:25:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2018-12-30 23:25:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2018-12-30 23:25:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2018-12-30 23:25:17,167 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 38 [2018-12-30 23:25:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:25:17,168 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2018-12-30 23:25:17,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:25:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2018-12-30 23:25:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-30 23:25:17,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:17,175 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, 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] [2018-12-30 23:25:17,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1506218363, now seen corresponding path program 1 times [2018-12-30 23:25:17,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:17,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:25:17,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:25:17,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:25:17,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:25:17,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:25:17,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:17,587 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2018-12-30 23:25:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:25:23,448 INFO L93 Difference]: Finished difference Result 3751 states and 5444 transitions. [2018-12-30 23:25:23,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:25:23,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-30 23:25:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:25:23,471 INFO L225 Difference]: With dead ends: 3751 [2018-12-30 23:25:23,471 INFO L226 Difference]: Without dead ends: 2781 [2018-12-30 23:25:23,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2018-12-30 23:25:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2477. [2018-12-30 23:25:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2018-12-30 23:25:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3302 transitions. [2018-12-30 23:25:23,545 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3302 transitions. Word has length 103 [2018-12-30 23:25:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:25:23,546 INFO L480 AbstractCegarLoop]: Abstraction has 2477 states and 3302 transitions. [2018-12-30 23:25:23,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:25:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3302 transitions. [2018-12-30 23:25:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-30 23:25:23,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:23,556 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:25:23,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1376091177, now seen corresponding path program 1 times [2018-12-30 23:25:23,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:23,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:23,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-30 23:25:23,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:25:23,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:25:24,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:24,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:25:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:25:24,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:25:24,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-12-30 23:25:24,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:25:24,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:25:24,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:24,332 INFO L87 Difference]: Start difference. First operand 2477 states and 3302 transitions. Second operand 4 states. [2018-12-30 23:25:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:25:29,939 INFO L93 Difference]: Finished difference Result 9147 states and 12151 transitions. [2018-12-30 23:25:29,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:25:29,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-12-30 23:25:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:25:29,982 INFO L225 Difference]: With dead ends: 9147 [2018-12-30 23:25:29,982 INFO L226 Difference]: Without dead ends: 6672 [2018-12-30 23:25:29,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2018-12-30 23:25:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 2775. [2018-12-30 23:25:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2018-12-30 23:25:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3654 transitions. [2018-12-30 23:25:30,067 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3654 transitions. Word has length 248 [2018-12-30 23:25:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:25:30,068 INFO L480 AbstractCegarLoop]: Abstraction has 2775 states and 3654 transitions. [2018-12-30 23:25:30,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:25:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3654 transitions. [2018-12-30 23:25:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-30 23:25:30,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:30,074 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:25:30,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2068910714, now seen corresponding path program 1 times [2018-12-30 23:25:30,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:30,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:30,774 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-30 23:25:31,047 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-30 23:25:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-30 23:25:31,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:25:31,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:25:31,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:25:31,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:25:31,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:25:31,237 INFO L87 Difference]: Start difference. First operand 2775 states and 3654 transitions. Second operand 5 states. [2018-12-30 23:25:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:25:35,417 INFO L93 Difference]: Finished difference Result 6746 states and 8608 transitions. [2018-12-30 23:25:35,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:25:35,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 315 [2018-12-30 23:25:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:25:35,438 INFO L225 Difference]: With dead ends: 6746 [2018-12-30 23:25:35,438 INFO L226 Difference]: Without dead ends: 3973 [2018-12-30 23:25:35,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:25:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2018-12-30 23:25:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2018-12-30 23:25:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2018-12-30 23:25:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4606 transitions. [2018-12-30 23:25:35,508 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4606 transitions. Word has length 315 [2018-12-30 23:25:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:25:35,509 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4606 transitions. [2018-12-30 23:25:35,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:25:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4606 transitions. [2018-12-30 23:25:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-12-30 23:25:35,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:35,519 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:25:35,519 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash 22793460, now seen corresponding path program 1 times [2018-12-30 23:25:35,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:35,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:35,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:35,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:35,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:36,127 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:25:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:25:36,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:25:36,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:25:36,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:36,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:25:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:25:37,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:25:37,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 23:25:37,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:25:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:25:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:25:37,038 INFO L87 Difference]: Start difference. First operand 3673 states and 4606 transitions. Second operand 9 states. [2018-12-30 23:25:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:25:47,681 INFO L93 Difference]: Finished difference Result 8892 states and 11158 transitions. [2018-12-30 23:25:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:25:47,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 389 [2018-12-30 23:25:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:25:47,706 INFO L225 Difference]: With dead ends: 8892 [2018-12-30 23:25:47,706 INFO L226 Difference]: Without dead ends: 5221 [2018-12-30 23:25:47,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 392 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:25:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2018-12-30 23:25:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4571. [2018-12-30 23:25:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2018-12-30 23:25:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 5459 transitions. [2018-12-30 23:25:47,799 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 5459 transitions. Word has length 389 [2018-12-30 23:25:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:25:47,800 INFO L480 AbstractCegarLoop]: Abstraction has 4571 states and 5459 transitions. [2018-12-30 23:25:47,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:25:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 5459 transitions. [2018-12-30 23:25:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-12-30 23:25:47,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:47,809 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, 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, 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, 1, 1, 1, 1, 1] [2018-12-30 23:25:47,809 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1836310355, now seen corresponding path program 1 times [2018-12-30 23:25:47,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:47,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-30 23:25:48,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:25:48,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:25:48,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:25:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:25:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:48,286 INFO L87 Difference]: Start difference. First operand 4571 states and 5459 transitions. Second operand 4 states. [2018-12-30 23:25:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:25:51,378 INFO L93 Difference]: Finished difference Result 10036 states and 12084 transitions. [2018-12-30 23:25:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:25:51,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2018-12-30 23:25:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:25:51,402 INFO L225 Difference]: With dead ends: 10036 [2018-12-30 23:25:51,402 INFO L226 Difference]: Without dead ends: 5467 [2018-12-30 23:25:51,408 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 [2018-12-30 23:25:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2018-12-30 23:25:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5465. [2018-12-30 23:25:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2018-12-30 23:25:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 6392 transitions. [2018-12-30 23:25:51,512 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 6392 transitions. Word has length 407 [2018-12-30 23:25:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:25:51,513 INFO L480 AbstractCegarLoop]: Abstraction has 5465 states and 6392 transitions. [2018-12-30 23:25:51,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:25:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 6392 transitions. [2018-12-30 23:25:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-12-30 23:25:51,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:51,526 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:25:51,526 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:51,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash 365821965, now seen corresponding path program 1 times [2018-12-30 23:25:51,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:51,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-30 23:25:51,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:25:51,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:25:51,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:25:51,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:25:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:25:51,964 INFO L87 Difference]: Start difference. First operand 5465 states and 6392 transitions. Second operand 3 states. [2018-12-30 23:25:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:25:54,339 INFO L93 Difference]: Finished difference Result 12721 states and 15122 transitions. [2018-12-30 23:25:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:25:54,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2018-12-30 23:25:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:25:54,389 INFO L225 Difference]: With dead ends: 12721 [2018-12-30 23:25:54,390 INFO L226 Difference]: Without dead ends: 7258 [2018-12-30 23:25:54,396 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 [2018-12-30 23:25:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2018-12-30 23:25:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 7258. [2018-12-30 23:25:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2018-12-30 23:25:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 8466 transitions. [2018-12-30 23:25:54,525 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 8466 transitions. Word has length 502 [2018-12-30 23:25:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:25:54,528 INFO L480 AbstractCegarLoop]: Abstraction has 7258 states and 8466 transitions. [2018-12-30 23:25:54,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:25:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 8466 transitions. [2018-12-30 23:25:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-12-30 23:25:54,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:54,547 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:25:54,548 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:54,548 INFO L82 PathProgramCache]: Analyzing trace with hash -765323433, now seen corresponding path program 1 times [2018-12-30 23:25:54,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:54,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:54,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:54,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:54,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:55,293 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-30 23:25:55,596 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-30 23:25:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 604 proven. 3 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-30 23:25:56,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:25:56,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:25:56,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:56,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:25:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-30 23:25:57,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:25:57,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-12-30 23:25:57,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:25:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:25:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:25:57,278 INFO L87 Difference]: Start difference. First operand 7258 states and 8466 transitions. Second operand 9 states. [2018-12-30 23:26:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:07,626 INFO L93 Difference]: Finished difference Result 19453 states and 22363 transitions. [2018-12-30 23:26:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 23:26:07,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 593 [2018-12-30 23:26:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:07,646 INFO L225 Difference]: With dead ends: 19453 [2018-12-30 23:26:07,646 INFO L226 Difference]: Without dead ends: 9051 [2018-12-30 23:26:07,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 590 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:26:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2018-12-30 23:26:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 6658. [2018-12-30 23:26:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2018-12-30 23:26:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 7070 transitions. [2018-12-30 23:26:07,761 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 7070 transitions. Word has length 593 [2018-12-30 23:26:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:07,761 INFO L480 AbstractCegarLoop]: Abstraction has 6658 states and 7070 transitions. [2018-12-30 23:26:07,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:26:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 7070 transitions. [2018-12-30 23:26:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-12-30 23:26:07,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:07,770 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:07,770 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:07,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 157467247, now seen corresponding path program 1 times [2018-12-30 23:26:07,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:07,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:07,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:07,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-12-30 23:26:08,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:08,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:08,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:26:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:26:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:26:08,273 INFO L87 Difference]: Start difference. First operand 6658 states and 7070 transitions. Second operand 3 states. [2018-12-30 23:26:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:10,081 INFO L93 Difference]: Finished difference Result 13312 states and 14136 transitions. [2018-12-30 23:26:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:26:10,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 635 [2018-12-30 23:26:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:10,094 INFO L225 Difference]: With dead ends: 13312 [2018-12-30 23:26:10,094 INFO L226 Difference]: Without dead ends: 6656 [2018-12-30 23:26:10,102 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 [2018-12-30 23:26:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2018-12-30 23:26:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6656. [2018-12-30 23:26:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2018-12-30 23:26:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 7066 transitions. [2018-12-30 23:26:10,190 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 7066 transitions. Word has length 635 [2018-12-30 23:26:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:10,191 INFO L480 AbstractCegarLoop]: Abstraction has 6656 states and 7066 transitions. [2018-12-30 23:26:10,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:26:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 7066 transitions. [2018-12-30 23:26:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2018-12-30 23:26:10,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:10,202 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:10,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1236683574, now seen corresponding path program 1 times [2018-12-30 23:26:10,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:10,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:10,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:10,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:10,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-30 23:26:11,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:11,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:26:11,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:26:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:26:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:26:11,299 INFO L87 Difference]: Start difference. First operand 6656 states and 7066 transitions. Second operand 4 states. [2018-12-30 23:26:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:14,007 INFO L93 Difference]: Finished difference Result 18401 states and 19606 transitions. [2018-12-30 23:26:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:26:14,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 670 [2018-12-30 23:26:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:14,034 INFO L225 Difference]: With dead ends: 18401 [2018-12-30 23:26:14,034 INFO L226 Difference]: Without dead ends: 11747 [2018-12-30 23:26:14,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:26:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11747 states. [2018-12-30 23:26:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11747 to 8451. [2018-12-30 23:26:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8451 states. [2018-12-30 23:26:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8451 states to 8451 states and 8974 transitions. [2018-12-30 23:26:14,173 INFO L78 Accepts]: Start accepts. Automaton has 8451 states and 8974 transitions. Word has length 670 [2018-12-30 23:26:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:14,174 INFO L480 AbstractCegarLoop]: Abstraction has 8451 states and 8974 transitions. [2018-12-30 23:26:14,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:26:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 8451 states and 8974 transitions. [2018-12-30 23:26:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2018-12-30 23:26:14,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:14,184 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, 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, 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, 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] [2018-12-30 23:26:14,184 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2142648817, now seen corresponding path program 1 times [2018-12-30 23:26:14,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:14,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:14,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:14,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-12-30 23:26:14,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:14,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:26:14,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:26:14,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:26:14,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:26:14,928 INFO L87 Difference]: Start difference. First operand 8451 states and 8974 transitions. Second operand 5 states. [2018-12-30 23:26:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:18,524 INFO L93 Difference]: Finished difference Result 21095 states and 22468 transitions. [2018-12-30 23:26:18,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:26:18,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 696 [2018-12-30 23:26:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:18,543 INFO L225 Difference]: With dead ends: 21095 [2018-12-30 23:26:18,544 INFO L226 Difference]: Without dead ends: 12048 [2018-12-30 23:26:18,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:26:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12048 states. [2018-12-30 23:26:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12048 to 9645. [2018-12-30 23:26:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9645 states. [2018-12-30 23:26:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9645 states to 9645 states and 10139 transitions. [2018-12-30 23:26:18,686 INFO L78 Accepts]: Start accepts. Automaton has 9645 states and 10139 transitions. Word has length 696 [2018-12-30 23:26:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:18,687 INFO L480 AbstractCegarLoop]: Abstraction has 9645 states and 10139 transitions. [2018-12-30 23:26:18,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:26:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 9645 states and 10139 transitions. [2018-12-30 23:26:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2018-12-30 23:26:18,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:18,701 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:18,701 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1681321076, now seen corresponding path program 1 times [2018-12-30 23:26:18,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:18,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:18,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:18,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:18,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-12-30 23:26:19,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:19,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:26:19,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:26:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:26:19,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:26:19,225 INFO L87 Difference]: Start difference. First operand 9645 states and 10139 transitions. Second operand 5 states. [2018-12-30 23:26:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:21,868 INFO L93 Difference]: Finished difference Result 22584 states and 23736 transitions. [2018-12-30 23:26:21,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:26:21,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 707 [2018-12-30 23:26:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:21,885 INFO L225 Difference]: With dead ends: 22584 [2018-12-30 23:26:21,885 INFO L226 Difference]: Without dead ends: 12941 [2018-12-30 23:26:21,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:26:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12941 states. [2018-12-30 23:26:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12941 to 8748. [2018-12-30 23:26:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8748 states. [2018-12-30 23:26:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8748 states to 8748 states and 9158 transitions. [2018-12-30 23:26:22,174 INFO L78 Accepts]: Start accepts. Automaton has 8748 states and 9158 transitions. Word has length 707 [2018-12-30 23:26:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:22,175 INFO L480 AbstractCegarLoop]: Abstraction has 8748 states and 9158 transitions. [2018-12-30 23:26:22,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:26:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 8748 states and 9158 transitions. [2018-12-30 23:26:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2018-12-30 23:26:22,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:22,189 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:22,189 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:22,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1870325008, now seen corresponding path program 1 times [2018-12-30 23:26:22,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:22,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:22,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:22,837 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:26:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 36 proven. 537 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2018-12-30 23:26:23,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:26:23,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:26:23,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:23,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:26:24,237 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 19 [2018-12-30 23:26:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2018-12-30 23:26:24,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:26:24,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 23:26:24,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:26:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:26:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:26:24,787 INFO L87 Difference]: Start difference. First operand 8748 states and 9158 transitions. Second operand 7 states. [2018-12-30 23:26:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:53,420 INFO L93 Difference]: Finished difference Result 31298 states and 32661 transitions. [2018-12-30 23:26:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:26:53,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 760 [2018-12-30 23:26:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:53,442 INFO L225 Difference]: With dead ends: 31298 [2018-12-30 23:26:53,442 INFO L226 Difference]: Without dead ends: 22253 [2018-12-30 23:26:53,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:26:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22253 states. [2018-12-30 23:26:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22253 to 14145. [2018-12-30 23:26:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14145 states. [2018-12-30 23:26:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 14741 transitions. [2018-12-30 23:26:53,724 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 14741 transitions. Word has length 760 [2018-12-30 23:26:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:53,725 INFO L480 AbstractCegarLoop]: Abstraction has 14145 states and 14741 transitions. [2018-12-30 23:26:53,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:26:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 14741 transitions. [2018-12-30 23:26:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2018-12-30 23:26:53,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:53,748 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:53,749 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1517974008, now seen corresponding path program 1 times [2018-12-30 23:26:53,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:53,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:53,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:53,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:53,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2018-12-30 23:26:54,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:54,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:54,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:26:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:26:54,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:26:54,379 INFO L87 Difference]: Start difference. First operand 14145 states and 14741 transitions. Second operand 3 states. [2018-12-30 23:26:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:55,584 INFO L93 Difference]: Finished difference Result 24358 states and 25350 transitions. [2018-12-30 23:26:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:26:55,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 767 [2018-12-30 23:26:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:55,602 INFO L225 Difference]: With dead ends: 24358 [2018-12-30 23:26:55,602 INFO L226 Difference]: Without dead ends: 10215 [2018-12-30 23:26:55,609 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 [2018-12-30 23:26:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2018-12-30 23:26:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 8717. [2018-12-30 23:26:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8717 states. [2018-12-30 23:26:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8717 states to 8717 states and 9002 transitions. [2018-12-30 23:26:55,710 INFO L78 Accepts]: Start accepts. Automaton has 8717 states and 9002 transitions. Word has length 767 [2018-12-30 23:26:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:55,711 INFO L480 AbstractCegarLoop]: Abstraction has 8717 states and 9002 transitions. [2018-12-30 23:26:55,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:26:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 8717 states and 9002 transitions. [2018-12-30 23:26:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2018-12-30 23:26:55,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:55,726 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:55,726 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1315496286, now seen corresponding path program 1 times [2018-12-30 23:26:55,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:55,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:55,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2018-12-30 23:26:56,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:56,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:56,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:26:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:26:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:26:56,454 INFO L87 Difference]: Start difference. First operand 8717 states and 9002 transitions. Second operand 3 states. [2018-12-30 23:26:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:57,645 INFO L93 Difference]: Finished difference Result 19533 states and 20175 transitions. [2018-12-30 23:26:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:26:57,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 862 [2018-12-30 23:26:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:57,654 INFO L225 Difference]: With dead ends: 19533 [2018-12-30 23:26:57,655 INFO L226 Difference]: Without dead ends: 10818 [2018-12-30 23:26:57,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:26:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2018-12-30 23:26:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 10216. [2018-12-30 23:26:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10216 states. [2018-12-30 23:26:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10216 states to 10216 states and 10524 transitions. [2018-12-30 23:26:57,755 INFO L78 Accepts]: Start accepts. Automaton has 10216 states and 10524 transitions. Word has length 862 [2018-12-30 23:26:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:57,756 INFO L480 AbstractCegarLoop]: Abstraction has 10216 states and 10524 transitions. [2018-12-30 23:26:57,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:26:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 10216 states and 10524 transitions. [2018-12-30 23:26:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2018-12-30 23:26:57,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:57,772 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:57,773 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2086699886, now seen corresponding path program 1 times [2018-12-30 23:26:57,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:57,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:57,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:57,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:57,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 697 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-12-30 23:26:58,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:58,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:58,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:26:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:26:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:26:58,605 INFO L87 Difference]: Start difference. First operand 10216 states and 10524 transitions. Second operand 3 states. [2018-12-30 23:27:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:00,395 INFO L93 Difference]: Finished difference Result 19227 states and 19796 transitions. [2018-12-30 23:27:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:27:00,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 910 [2018-12-30 23:27:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:00,406 INFO L225 Difference]: With dead ends: 19227 [2018-12-30 23:27:00,406 INFO L226 Difference]: Without dead ends: 9312 [2018-12-30 23:27:00,413 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 [2018-12-30 23:27:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9312 states. [2018-12-30 23:27:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9312 to 9013. [2018-12-30 23:27:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9013 states. [2018-12-30 23:27:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9013 states to 9013 states and 9268 transitions. [2018-12-30 23:27:00,522 INFO L78 Accepts]: Start accepts. Automaton has 9013 states and 9268 transitions. Word has length 910 [2018-12-30 23:27:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:00,523 INFO L480 AbstractCegarLoop]: Abstraction has 9013 states and 9268 transitions. [2018-12-30 23:27:00,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:27:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9013 states and 9268 transitions. [2018-12-30 23:27:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2018-12-30 23:27:00,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:00,539 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:27:00,539 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:00,540 INFO L82 PathProgramCache]: Analyzing trace with hash -321067316, now seen corresponding path program 1 times [2018-12-30 23:27:00,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:00,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:00,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:00,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2018-12-30 23:27:02,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:27:02,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:27:02,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:27:02,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:27:02,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:27:02,035 INFO L87 Difference]: Start difference. First operand 9013 states and 9268 transitions. Second operand 3 states. [2018-12-30 23:27:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:03,605 INFO L93 Difference]: Finished difference Result 18925 states and 19464 transitions. [2018-12-30 23:27:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:27:03,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2018-12-30 23:27:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:03,607 INFO L225 Difference]: With dead ends: 18925 [2018-12-30 23:27:03,607 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:27:03,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:27:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:27:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:27:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:27:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:27:03,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2018-12-30 23:27:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:03,616 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:27:03,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:27:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:27:03,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:27:03,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:27:03,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:03,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:03,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:03,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:03,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:03,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:03,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:03,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,153 WARN L181 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 315 [2018-12-30 23:27:04,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,566 WARN L181 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 315 [2018-12-30 23:27:04,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:27:04,880 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 280 [2018-12-30 23:27:08,164 WARN L181 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 300 DAG size of output: 105 [2018-12-30 23:27:11,930 WARN L181 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 300 DAG size of output: 105 [2018-12-30 23:27:13,460 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 268 DAG size of output: 103 [2018-12-30 23:27:13,464 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,464 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,464 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,464 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,464 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,465 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,466 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,467 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,468 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,469 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:27:13,470 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,471 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,472 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-12-30 23:27:13,473 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,474 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,475 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,476 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,477 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:27:13,478 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,479 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:27:13,480 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:27:13,481 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:27:13,482 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,482 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,482 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,482 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,482 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse20 (+ ~a0~0 98))) (let ((.cse3 (+ ~a29~0 144)) (.cse15 (<= (+ ~a4~0 89) 0)) (.cse14 (= ~a2~0 2)) (.cse4 (<= (+ ~a0~0 61) 0)) (.cse6 (not (= 2 ~a2~0))) (.cse5 (< 0 .cse20)) (.cse21 (+ ~a0~0 147)) (.cse23 (+ ~a4~0 86))) (let ((.cse1 (= ~a2~0 1)) (.cse2 (<= ~a29~0 43)) (.cse8 (<= 0 (+ ~a0~0 599999))) (.cse13 (< 0 .cse23)) (.cse7 (<= .cse21 0)) (.cse17 (let ((.cse22 (<= .cse23 0))) (or (<= 0 (+ ~a0~0 44)) (and .cse22 .cse6) (and .cse22 .cse5)))) (.cse16 (<= 0 (+ ~a29~0 15))) (.cse18 (and .cse15 .cse14 (< 0 .cse21) .cse4)) (.cse9 (<= .cse20 0)) (.cse19 (<= .cse3 0)) (.cse0 (<= (+ ~a4~0 42) 0))) (or (and .cse0 .cse1 .cse2 (< 0 .cse3) .cse4 .cse5) (and (and .cse0 .cse6 .cse7) .cse8) (and .cse9 (exists ((v_prenex_6 Int)) (let ((.cse11 (* 9 v_prenex_6))) (let ((.cse12 (div .cse11 10))) (let ((.cse10 (mod .cse12 29))) (and (<= .cse10 (+ ~a29~0 15)) (not (= 0 .cse10)) (= 0 (mod .cse11 10)) (< .cse12 0)))))) (and .cse0 .cse13 .cse14)) (and .cse15 .cse7) (and (and .cse0 .cse6 (not (= 4 ~a2~0))) .cse9 .cse8) (and .cse0 (and .cse1 .cse2) .cse16 .cse8) (and .cse0 .cse7 (= ~a2~0 3)) (and (not (= 5 ~a2~0)) .cse0 .cse17) (or (and .cse14 (<= (+ ~a0~0 386992) 0)) (and .cse0 .cse13 .cse14 .cse7)) (and .cse17 .cse4) (and (and .cse0 .cse17) .cse16) (and .cse16 .cse18) (and .cse18 .cse19) (and .cse9 (<= 0 (+ ~a0~0 140)) .cse19 (and .cse0 .cse6)))))) [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,483 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:27:13,484 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,485 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse24 (+ ~a4~0 86))) (let ((.cse4 (+ ~a29~0 144)) (.cse22 (+ ~a0~0 98)) (.cse11 (<= (+ ~a4~0 89) 0)) (.cse13 (= ~a2~0 2)) (.cse20 (<= 0 (+ ~a0~0 44))) (.cse21 (<= .cse24 0)) (.cse9 (not (= 2 ~a2~0))) (.cse23 (+ ~a0~0 147))) (let ((.cse1 (<= .cse23 0)) (.cse8 (or .cse20 (and .cse21 .cse9))) (.cse5 (<= (+ ~a0~0 61) 0)) (.cse14 (< 0 .cse24)) (.cse2 (= ~a2~0 1)) (.cse3 (<= ~a29~0 43)) (.cse10 (<= 0 (+ ~a0~0 599999))) (.cse7 (<= 0 (+ ~a29~0 15))) (.cse18 (and .cse11 .cse13 (< 0 .cse23))) (.cse6 (< 0 .cse22)) (.cse12 (<= .cse22 0)) (.cse19 (<= .cse4 0)) (.cse0 (<= (+ ~a4~0 42) 0))) (or (and .cse0 (= ~a2~0 3) .cse1) (and .cse0 .cse2 .cse3 (< 0 .cse4) .cse5 .cse6) (and .cse7 (and .cse0 .cse8)) (and (and .cse0 .cse9 .cse1) .cse10) (and .cse11 .cse1) (and (and .cse0 .cse9 (not (= 4 ~a2~0))) .cse12 .cse10) (or (and .cse13 (<= (+ ~a0~0 386992) 0)) (and .cse0 .cse14 .cse13 .cse1)) (and .cse8 .cse5) (and .cse12 (exists ((v_prenex_6 Int)) (let ((.cse16 (* 9 v_prenex_6))) (let ((.cse17 (div .cse16 10))) (let ((.cse15 (mod .cse17 29))) (and (<= .cse15 (+ ~a29~0 15)) (not (= 0 .cse15)) (= 0 (mod .cse16 10)) (< .cse17 0)))))) (and .cse0 .cse14 .cse13)) (and (and .cse2 .cse3) .cse0 .cse7 .cse10) (and .cse18 .cse19) (and .cse7 .cse18) (and .cse0 (and (not (= 5 ~a2~0)) (or .cse20 (and .cse21 .cse6)))) (and .cse12 (<= 0 (+ ~a0~0 140)) .cse19 (and .cse0 .cse9)))))) [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:27:13,486 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:27:13,487 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,488 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,489 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:27:13,490 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,491 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse24 (+ ~a4~0 86))) (let ((.cse4 (+ ~a29~0 144)) (.cse22 (+ ~a0~0 98)) (.cse11 (<= (+ ~a4~0 89) 0)) (.cse13 (= ~a2~0 2)) (.cse20 (<= 0 (+ ~a0~0 44))) (.cse21 (<= .cse24 0)) (.cse9 (not (= 2 ~a2~0))) (.cse23 (+ ~a0~0 147))) (let ((.cse1 (<= .cse23 0)) (.cse8 (or .cse20 (and .cse21 .cse9))) (.cse5 (<= (+ ~a0~0 61) 0)) (.cse14 (< 0 .cse24)) (.cse2 (= ~a2~0 1)) (.cse3 (<= ~a29~0 43)) (.cse10 (<= 0 (+ ~a0~0 599999))) (.cse7 (<= 0 (+ ~a29~0 15))) (.cse18 (and .cse11 .cse13 (< 0 .cse23))) (.cse6 (< 0 .cse22)) (.cse12 (<= .cse22 0)) (.cse19 (<= .cse4 0)) (.cse0 (<= (+ ~a4~0 42) 0))) (or (and .cse0 (= ~a2~0 3) .cse1) (and .cse0 .cse2 .cse3 (< 0 .cse4) .cse5 .cse6) (and .cse7 (and .cse0 .cse8)) (and (and .cse0 .cse9 .cse1) .cse10) (and .cse11 .cse1) (and (and .cse0 .cse9 (not (= 4 ~a2~0))) .cse12 .cse10) (or (and .cse13 (<= (+ ~a0~0 386992) 0)) (and .cse0 .cse14 .cse13 .cse1)) (and .cse8 .cse5) (and .cse12 (exists ((v_prenex_6 Int)) (let ((.cse16 (* 9 v_prenex_6))) (let ((.cse17 (div .cse16 10))) (let ((.cse15 (mod .cse17 29))) (and (<= .cse15 (+ ~a29~0 15)) (not (= 0 .cse15)) (= 0 (mod .cse16 10)) (< .cse17 0)))))) (and .cse0 .cse14 .cse13)) (and (and .cse2 .cse3) .cse0 .cse7 .cse10) (and .cse18 .cse19) (and .cse7 .cse18) (and .cse0 (and (not (= 5 ~a2~0)) (or .cse20 (and .cse21 .cse6)))) (and .cse12 (<= 0 (+ ~a0~0 140)) .cse19 (and .cse0 .cse9)))))) [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,492 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,493 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,494 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,495 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,496 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:27:13,497 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,498 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,499 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:27:13,500 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:27:13,500 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-12-30 23:27:13,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:27:13 BoogieIcfgContainer [2018-12-30 23:27:13,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:27:13,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:27:13,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:27:13,576 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:27:13,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:25:08" (3/4) ... [2018-12-30 23:27:13,581 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:27:13,655 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-30 23:27:13,659 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:27:13,696 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || (0 <= a29 + 15 && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || ((((a2 == 1 && a29 <= 43) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || (((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a29 + 144 <= 0)) || (0 <= a29 + 15 && (a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147)) || (a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((a0 + 98 <= 0 && 0 <= a0 + 140) && a29 + 144 <= 0) && a4 + 42 <= 0 && !(2 == a2)) [2018-12-30 23:27:13,700 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || (0 <= a29 + 15 && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || ((((a2 == 1 && a29 <= 43) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || (((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a29 + 144 <= 0)) || (0 <= a29 + 15 && (a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147)) || (a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((a0 + 98 <= 0 && 0 <= a0 + 140) && a29 + 144 <= 0) && a4 + 42 <= 0 && !(2 == a2)) [2018-12-30 23:27:13,723 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (((a4 + 42 <= 0 && a2 == 1 && a29 <= 43) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && a2 == 3)) || ((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 <= a29 + 15)) || (0 <= a29 + 15 && ((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0) && a29 + 144 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 140) && a29 + 144 <= 0) && a4 + 42 <= 0 && !(2 == a2)) [2018-12-30 23:27:13,938 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:27:13,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:27:13,941 INFO L168 Benchmark]: Toolchain (without parser) took 134415.20 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 947.3 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 668.5 MB. Max. memory is 11.5 GB. [2018-12-30 23:27:13,942 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:27:13,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1179.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 850.3 MB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. [2018-12-30 23:27:13,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 350.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 850.3 MB in the beginning and 1.1 GB in the end (delta: -249.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2018-12-30 23:27:13,944 INFO L168 Benchmark]: Boogie Preprocessor took 222.62 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-30 23:27:13,945 INFO L168 Benchmark]: RCFGBuilder took 6815.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.3 MB). Peak memory consumption was 300.1 MB. Max. memory is 11.5 GB. [2018-12-30 23:27:13,945 INFO L168 Benchmark]: TraceAbstraction took 125472.45 ms. Allocated memory was 1.3 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-30 23:27:13,945 INFO L168 Benchmark]: Witness Printer took 363.28 ms. Allocated memory is still 3.2 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 95.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:27:13,951 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.20 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 1179.61 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 850.3 MB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 350.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 850.3 MB in the beginning and 1.1 GB in the end (delta: -249.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 222.62 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6815.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.3 MB). Peak memory consumption was 300.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125472.45 ms. Allocated memory was 1.3 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 363.28 ms. Allocated memory is still 3.2 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 95.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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: 1766]: Loop Invariant [2018-12-30 23:27:13,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: ((((((((((((((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || (0 <= a29 + 15 && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || ((((a2 == 1 && a29 <= 43) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || (((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a29 + 144 <= 0)) || (0 <= a29 + 15 && (a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147)) || (a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((a0 + 98 <= 0 && 0 <= a0 + 140) && a29 + 144 <= 0) && a4 + 42 <= 0 && !(2 == a2)) - InvariantResult [Line: 23]: Loop Invariant [2018-12-30 23:27:13,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: ((((((((((((((a4 + 42 <= 0 && a2 == 3) && a0 + 147 <= 0) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || (0 <= a29 + 15 && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || ((((a2 == 1 && a29 <= 43) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || (((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a29 + 144 <= 0)) || (0 <= a29 + 15 && (a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147)) || (a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((a0 + 98 <= 0 && 0 <= a0 + 140) && a29 + 144 <= 0) && a4 + 42 <= 0 && !(2 == a2)) - InvariantResult [Line: 1658]: Loop Invariant [2018-12-30 23:27:13,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:27:13,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98) || (((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (((a4 + 42 <= 0 && a2 == 1 && a29 <= 43) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && a2 == 3)) || ((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && 0 <= a29 + 15)) || (0 <= a29 + 15 && ((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0) && a29 + 144 <= 0)) || (((a0 + 98 <= 0 && 0 <= a0 + 140) && a29 + 144 <= 0) && a4 + 42 <= 0 && !(2 == a2)) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 125.3s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 96.0s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 3999 SDtfs, 13990 SDslu, 1434 SDs, 0 SdLazy, 37122 SolverSat, 5047 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 84.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2088 GetRequests, 2017 SyntacticMatches, 15 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14145occurred in iteration=13, 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.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 27947 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 157 NumberOfFragments, 1098 HoareAnnotationTreeSize, 4 FomulaSimplifications, 100951 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 72102 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 11702 NumberOfCodeBlocks, 11702 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11681 ConstructedInterpolants, 36 QuantifiedInterpolants, 20916995 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2409 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 12360/13012 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...