./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label27_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_label27_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 14831cf592bc13b54caac21143b5bc01f6bc3848 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:25:47,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:25:47,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:25:47,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:25:47,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:25:47,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:25:47,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:25:47,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:25:47,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:25:47,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:25:47,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:25:47,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:25:47,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:25:47,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:25:47,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:25:47,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:25:47,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:25:47,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:25:47,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:25:47,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:25:47,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:25:47,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:25:47,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:25:47,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:25:47,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:25:47,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:25:47,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:25:47,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:25:47,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:25:47,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:25:47,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:25:47,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:25:47,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:25:47,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:25:47,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:25:47,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:25:47,438 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:25:47,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:25:47,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:25:47,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:25:47,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:25:47,463 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:25:47,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:25:47,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:25:47,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:25:47,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:25:47,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:25:47,465 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:25:47,465 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:25:47,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:25:47,465 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:25:47,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:25:47,465 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:25:47,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:25:47,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:25:47,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:25:47,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:25:47,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:25:47,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:25:47,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:25:47,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:25:47,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:25:47,469 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:25:47,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:25:47,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:25:47,470 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 -> 14831cf592bc13b54caac21143b5bc01f6bc3848 [2018-12-30 23:25:47,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:25:47,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:25:47,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:25:47,542 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:25:47,543 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:25:47,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label27_true-unreach-call.c [2018-12-30 23:25:47,609 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae4873e1/39bded5ce2b64a6aba2cfdc09ce76313/FLAGee0e3ee37 [2018-12-30 23:25:48,301 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:25:48,302 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label27_true-unreach-call.c [2018-12-30 23:25:48,320 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae4873e1/39bded5ce2b64a6aba2cfdc09ce76313/FLAGee0e3ee37 [2018-12-30 23:25:48,463 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae4873e1/39bded5ce2b64a6aba2cfdc09ce76313 [2018-12-30 23:25:48,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:25:48,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:25:48,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:25:48,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:25:48,476 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:25:48,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:25:48" (1/1) ... [2018-12-30 23:25:48,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ccf8dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:48, skipping insertion in model container [2018-12-30 23:25:48,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:25:48" (1/1) ... [2018-12-30 23:25:48,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:25:48,577 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:25:49,351 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:25:49,357 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:25:49,668 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:25:49,689 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:25:49,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:49 WrapperNode [2018-12-30 23:25:49,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:25:49,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:25:49,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:25:49,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:25:49,830 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:49" (1/1) ... [2018-12-30 23:25:49,870 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:49" (1/1) ... [2018-12-30 23:25:50,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:25:50,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:25:50,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:25:50,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:25:50,072 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:49" (1/1) ... [2018-12-30 23:25:50,072 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:49" (1/1) ... [2018-12-30 23:25:50,092 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:49" (1/1) ... [2018-12-30 23:25:50,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:49" (1/1) ... [2018-12-30 23:25:50,153 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:49" (1/1) ... [2018-12-30 23:25:50,171 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:49" (1/1) ... [2018-12-30 23:25:50,202 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:49" (1/1) ... [2018-12-30 23:25:50,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:25:50,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:25:50,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:25:50,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:25:50,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:49" (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:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:25:50,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:25:57,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:25:57,267 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 23:25:57,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:25:57 BoogieIcfgContainer [2018-12-30 23:25:57,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:25:57,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:25:57,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:25:57,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:25:57,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:25:48" (1/3) ... [2018-12-30 23:25:57,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7de31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:25:57, skipping insertion in model container [2018-12-30 23:25:57,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:25:49" (2/3) ... [2018-12-30 23:25:57,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7de31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:25:57, skipping insertion in model container [2018-12-30 23:25:57,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:25:57" (3/3) ... [2018-12-30 23:25:57,275 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label27_true-unreach-call.c [2018-12-30 23:25:57,287 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:25:57,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:25:57,318 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:25:57,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:25:57,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:25:57,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:25:57,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:25:57,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:25:57,359 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:25:57,359 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:25:57,359 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:25:57,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:25:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2018-12-30 23:25:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 23:25:57,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:25:57,397 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] [2018-12-30 23:25:57,400 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:25:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:25:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2018-12-30 23:25:57,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:25:57,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:25:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:57,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:25:57,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:25:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:25:57,899 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:57,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:25:57,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:25:57,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:25:57,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:25:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:25:57,931 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2018-12-30 23:26:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:04,228 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2018-12-30 23:26:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:26:04,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-30 23:26:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:04,259 INFO L225 Difference]: With dead ends: 1514 [2018-12-30 23:26:04,259 INFO L226 Difference]: Without dead ends: 1008 [2018-12-30 23:26:04,266 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:26:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2018-12-30 23:26:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2018-12-30 23:26:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-12-30 23:26:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2018-12-30 23:26:04,355 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 37 [2018-12-30 23:26:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:04,355 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2018-12-30 23:26:04,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:26:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2018-12-30 23:26:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-30 23:26:04,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:04,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,360 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1560092623, now seen corresponding path program 1 times [2018-12-30 23:26:04,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:04,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:26:04,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:04,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:26:04,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:26:04,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:26:04,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:26:04,791 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 4 states. [2018-12-30 23:26:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:11,379 INFO L93 Difference]: Finished difference Result 2561 states and 4453 transitions. [2018-12-30 23:26:11,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:26:11,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-30 23:26:11,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:11,394 INFO L225 Difference]: With dead ends: 2561 [2018-12-30 23:26:11,394 INFO L226 Difference]: Without dead ends: 1886 [2018-12-30 23:26:11,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:26:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-12-30 23:26:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1881. [2018-12-30 23:26:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2018-12-30 23:26:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2859 transitions. [2018-12-30 23:26:11,462 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2859 transitions. Word has length 102 [2018-12-30 23:26:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:11,463 INFO L480 AbstractCegarLoop]: Abstraction has 1881 states and 2859 transitions. [2018-12-30 23:26:11,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:26:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2859 transitions. [2018-12-30 23:26:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-30 23:26:11,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:11,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,474 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -600642833, now seen corresponding path program 1 times [2018-12-30 23:26:11,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:11,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:26:11,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:11,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:11,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:26:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:26:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:26:11,998 INFO L87 Difference]: Start difference. First operand 1881 states and 2859 transitions. Second operand 4 states. [2018-12-30 23:26:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:18,186 INFO L93 Difference]: Finished difference Result 7055 states and 10676 transitions. [2018-12-30 23:26:18,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:26:18,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-30 23:26:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:18,215 INFO L225 Difference]: With dead ends: 7055 [2018-12-30 23:26:18,215 INFO L226 Difference]: Without dead ends: 5176 [2018-12-30 23:26:18,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:26:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2018-12-30 23:26:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 3376. [2018-12-30 23:26:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2018-12-30 23:26:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4559 transitions. [2018-12-30 23:26:18,301 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4559 transitions. Word has length 156 [2018-12-30 23:26:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:18,302 INFO L480 AbstractCegarLoop]: Abstraction has 3376 states and 4559 transitions. [2018-12-30 23:26:18,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:26:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4559 transitions. [2018-12-30 23:26:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-12-30 23:26:18,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:18,312 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,312 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1266153403, now seen corresponding path program 1 times [2018-12-30 23:26:18,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:18,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:18,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:18,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-30 23:26:19,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:19,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:26:19,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:26:19,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:26:19,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:26:19,220 INFO L87 Difference]: Start difference. First operand 3376 states and 4559 transitions. Second operand 5 states. [2018-12-30 23:26:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:23,414 INFO L93 Difference]: Finished difference Result 7649 states and 10094 transitions. [2018-12-30 23:26:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:26:23,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 393 [2018-12-30 23:26:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:23,435 INFO L225 Difference]: With dead ends: 7649 [2018-12-30 23:26:23,435 INFO L226 Difference]: Without dead ends: 4275 [2018-12-30 23:26:23,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2018-12-30 23:26:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3974. [2018-12-30 23:26:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2018-12-30 23:26:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5199 transitions. [2018-12-30 23:26:23,515 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5199 transitions. Word has length 393 [2018-12-30 23:26:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:23,516 INFO L480 AbstractCegarLoop]: Abstraction has 3974 states and 5199 transitions. [2018-12-30 23:26:23,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:26:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5199 transitions. [2018-12-30 23:26:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-12-30 23:26:23,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:23,525 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:26:23,526 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:23,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1517405968, now seen corresponding path program 1 times [2018-12-30 23:26:23,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:24,162 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:26:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-30 23:26:24,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:26:24,433 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:26:24,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:24,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:26:25,328 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 21 [2018-12-30 23:26:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 140 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:26:25,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:26:25,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-12-30 23:26:25,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:26:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:26:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:26:25,924 INFO L87 Difference]: Start difference. First operand 3974 states and 5199 transitions. Second operand 8 states. [2018-12-30 23:26:26,391 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-12-30 23:26:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:41,049 INFO L93 Difference]: Finished difference Result 19398 states and 26036 transitions. [2018-12-30 23:26:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-30 23:26:41,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 414 [2018-12-30 23:26:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:41,121 INFO L225 Difference]: With dead ends: 19398 [2018-12-30 23:26:41,122 INFO L226 Difference]: Without dead ends: 15426 [2018-12-30 23:26:41,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-30 23:26:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15426 states. [2018-12-30 23:26:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15426 to 10259. [2018-12-30 23:26:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10259 states. [2018-12-30 23:26:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 12731 transitions. [2018-12-30 23:26:41,366 INFO L78 Accepts]: Start accepts. Automaton has 10259 states and 12731 transitions. Word has length 414 [2018-12-30 23:26:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:41,367 INFO L480 AbstractCegarLoop]: Abstraction has 10259 states and 12731 transitions. [2018-12-30 23:26:41,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:26:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 10259 states and 12731 transitions. [2018-12-30 23:26:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-12-30 23:26:41,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:41,389 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash -520409033, now seen corresponding path program 1 times [2018-12-30 23:26:41,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:41,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:41,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:42,045 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-30 23:26:42,483 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2018-12-30 23:26:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 533 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-30 23:26:43,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:26:43,161 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:26:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:43,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:26:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-30 23:26:43,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:26:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-12-30 23:26:43,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:26:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:26:43,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:26:43,480 INFO L87 Difference]: Start difference. First operand 10259 states and 12731 transitions. Second operand 8 states. [2018-12-30 23:26:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:50,584 INFO L93 Difference]: Finished difference Result 23466 states and 28512 transitions. [2018-12-30 23:26:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:26:50,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 538 [2018-12-30 23:26:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:50,607 INFO L225 Difference]: With dead ends: 23466 [2018-12-30 23:26:50,607 INFO L226 Difference]: Without dead ends: 10557 [2018-12-30 23:26:50,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 541 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:26:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10557 states. [2018-12-30 23:26:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10557 to 10258. [2018-12-30 23:26:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10258 states. [2018-12-30 23:26:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 11761 transitions. [2018-12-30 23:26:50,800 INFO L78 Accepts]: Start accepts. Automaton has 10258 states and 11761 transitions. Word has length 538 [2018-12-30 23:26:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:50,800 INFO L480 AbstractCegarLoop]: Abstraction has 10258 states and 11761 transitions. [2018-12-30 23:26:50,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:26:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10258 states and 11761 transitions. [2018-12-30 23:26:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-12-30 23:26:50,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:50,820 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,821 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:50,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2934659, now seen corresponding path program 1 times [2018-12-30 23:26:50,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:51,585 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-12-30 23:26:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-30 23:26:51,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:51,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:26:51,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:26:51,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:26:51,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:26:51,863 INFO L87 Difference]: Start difference. First operand 10258 states and 11761 transitions. Second operand 5 states. [2018-12-30 23:26:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:57,316 INFO L93 Difference]: Finished difference Result 27090 states and 31533 transitions. [2018-12-30 23:26:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:26:57,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 566 [2018-12-30 23:26:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:57,354 INFO L225 Difference]: With dead ends: 27090 [2018-12-30 23:26:57,354 INFO L226 Difference]: Without dead ends: 18630 [2018-12-30 23:26:57,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:26:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18630 states. [2018-12-30 23:26:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18630 to 13547. [2018-12-30 23:26:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13547 states. [2018-12-30 23:26:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13547 states to 13547 states and 15716 transitions. [2018-12-30 23:26:57,597 INFO L78 Accepts]: Start accepts. Automaton has 13547 states and 15716 transitions. Word has length 566 [2018-12-30 23:26:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:57,598 INFO L480 AbstractCegarLoop]: Abstraction has 13547 states and 15716 transitions. [2018-12-30 23:26:57,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:26:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13547 states and 15716 transitions. [2018-12-30 23:26:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-12-30 23:26:57,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:57,623 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,624 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1711740941, now seen corresponding path program 1 times [2018-12-30 23:26:57,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:57,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:57,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:57,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:57,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-30 23:26:58,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:58,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:58,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:26:58,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:26:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:26:58,085 INFO L87 Difference]: Start difference. First operand 13547 states and 15716 transitions. Second operand 3 states. [2018-12-30 23:27:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:00,266 INFO L93 Difference]: Finished difference Result 25593 states and 29880 transitions. [2018-12-30 23:27:00,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:27:00,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 676 [2018-12-30 23:27:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:00,305 INFO L225 Difference]: With dead ends: 25593 [2018-12-30 23:27:00,305 INFO L226 Difference]: Without dead ends: 13545 [2018-12-30 23:27:00,318 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,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13545 states. [2018-12-30 23:27:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13545 to 13545. [2018-12-30 23:27:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13545 states. [2018-12-30 23:27:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13545 states to 13545 states and 15712 transitions. [2018-12-30 23:27:00,502 INFO L78 Accepts]: Start accepts. Automaton has 13545 states and 15712 transitions. Word has length 676 [2018-12-30 23:27:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:00,503 INFO L480 AbstractCegarLoop]: Abstraction has 13545 states and 15712 transitions. [2018-12-30 23:27:00,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:27:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 13545 states and 15712 transitions. [2018-12-30 23:27:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-12-30 23:27:00,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:00,528 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:27:00,529 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:00,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1832391907, now seen corresponding path program 1 times [2018-12-30 23:27:00,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:00,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:00,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:00,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:01,231 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 5 [2018-12-30 23:27:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-30 23:27:01,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:27:01,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:27:01,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:27:01,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:27:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:27:01,535 INFO L87 Difference]: Start difference. First operand 13545 states and 15712 transitions. Second operand 4 states. [2018-12-30 23:27:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:04,816 INFO L93 Difference]: Finished difference Result 36373 states and 41923 transitions. [2018-12-30 23:27:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:27:04,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 710 [2018-12-30 23:27:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:04,854 INFO L225 Difference]: With dead ends: 36373 [2018-12-30 23:27:04,854 INFO L226 Difference]: Without dead ends: 22830 [2018-12-30 23:27:04,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:27:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22830 states. [2018-12-30 23:27:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22830 to 21916. [2018-12-30 23:27:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21916 states. [2018-12-30 23:27:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21916 states to 21916 states and 24736 transitions. [2018-12-30 23:27:05,163 INFO L78 Accepts]: Start accepts. Automaton has 21916 states and 24736 transitions. Word has length 710 [2018-12-30 23:27:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:05,164 INFO L480 AbstractCegarLoop]: Abstraction has 21916 states and 24736 transitions. [2018-12-30 23:27:05,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:27:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 21916 states and 24736 transitions. [2018-12-30 23:27:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2018-12-30 23:27:05,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:05,187 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:27:05,190 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1105529793, now seen corresponding path program 1 times [2018-12-30 23:27:05,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:05,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:05,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:05,880 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:27:06,207 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-12-30 23:27:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 542 proven. 67 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 23:27:06,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:27:06,926 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:27:06,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:07,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:27:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 23:27:07,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:27:07,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 23:27:07,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:27:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:27:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:27:07,731 INFO L87 Difference]: Start difference. First operand 21916 states and 24736 transitions. Second operand 9 states. [2018-12-30 23:27:10,919 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 8 [2018-12-30 23:27:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:15,251 INFO L93 Difference]: Finished difference Result 44332 states and 49929 transitions. [2018-12-30 23:27:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:27:15,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 720 [2018-12-30 23:27:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:15,288 INFO L225 Difference]: With dead ends: 44332 [2018-12-30 23:27:15,288 INFO L226 Difference]: Without dead ends: 22418 [2018-12-30 23:27:15,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 722 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:27:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22418 states. [2018-12-30 23:27:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22418 to 20714. [2018-12-30 23:27:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20714 states. [2018-12-30 23:27:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20714 states to 20714 states and 22957 transitions. [2018-12-30 23:27:15,600 INFO L78 Accepts]: Start accepts. Automaton has 20714 states and 22957 transitions. Word has length 720 [2018-12-30 23:27:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:15,601 INFO L480 AbstractCegarLoop]: Abstraction has 20714 states and 22957 transitions. [2018-12-30 23:27:15,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:27:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 20714 states and 22957 transitions. [2018-12-30 23:27:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-12-30 23:27:15,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:15,623 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-12-30 23:27:15,623 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1478502531, now seen corresponding path program 1 times [2018-12-30 23:27:15,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:15,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:15,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:15,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:15,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 657 proven. 136 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-30 23:27:17,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:27:17,051 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:27:17,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:17,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:27:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-12-30 23:27:18,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:27:18,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 23:27:18,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:27:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:27:18,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:27:18,212 INFO L87 Difference]: Start difference. First operand 20714 states and 22957 transitions. Second operand 5 states. [2018-12-30 23:27:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:23,553 INFO L93 Difference]: Finished difference Result 47074 states and 51838 transitions. [2018-12-30 23:27:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:27:23,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 722 [2018-12-30 23:27:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:23,579 INFO L225 Difference]: With dead ends: 47074 [2018-12-30 23:27:23,579 INFO L226 Difference]: Without dead ends: 19186 [2018-12-30 23:27:23,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 722 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:27:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19186 states. [2018-12-30 23:27:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19186 to 14096. [2018-12-30 23:27:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14096 states. [2018-12-30 23:27:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14096 states to 14096 states and 14767 transitions. [2018-12-30 23:27:23,807 INFO L78 Accepts]: Start accepts. Automaton has 14096 states and 14767 transitions. Word has length 722 [2018-12-30 23:27:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:23,808 INFO L480 AbstractCegarLoop]: Abstraction has 14096 states and 14767 transitions. [2018-12-30 23:27:23,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:27:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 14096 states and 14767 transitions. [2018-12-30 23:27:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-12-30 23:27:23,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:23,822 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:27:23,822 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1158651664, now seen corresponding path program 1 times [2018-12-30 23:27:23,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:23,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:23,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:23,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:23,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:24,323 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-12-30 23:27:24,485 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-30 23:27:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-30 23:27:25,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:27:25,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:27:25,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:27:25,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:27:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:27:25,090 INFO L87 Difference]: Start difference. First operand 14096 states and 14767 transitions. Second operand 6 states. [2018-12-30 23:27:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:27,555 INFO L93 Difference]: Finished difference Result 29109 states and 30514 transitions. [2018-12-30 23:27:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:27:27,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 724 [2018-12-30 23:27:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:27,569 INFO L225 Difference]: With dead ends: 29109 [2018-12-30 23:27:27,569 INFO L226 Difference]: Without dead ends: 15015 [2018-12-30 23:27:27,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:27:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2018-12-30 23:27:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 14994. [2018-12-30 23:27:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14994 states. [2018-12-30 23:27:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14994 states to 14994 states and 15678 transitions. [2018-12-30 23:27:27,766 INFO L78 Accepts]: Start accepts. Automaton has 14994 states and 15678 transitions. Word has length 724 [2018-12-30 23:27:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:27,767 INFO L480 AbstractCegarLoop]: Abstraction has 14994 states and 15678 transitions. [2018-12-30 23:27:27,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:27:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 14994 states and 15678 transitions. [2018-12-30 23:27:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-12-30 23:27:27,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:27,780 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,780 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:27,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1417323524, now seen corresponding path program 1 times [2018-12-30 23:27:27,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:27,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:27,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 35 proven. 487 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-12-30 23:27:29,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:27:29,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:27:29,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:29,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:27:29,583 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2018-12-30 23:27:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-12-30 23:27:30,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:27:30,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 23:27:30,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:27:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:27:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:27:30,638 INFO L87 Difference]: Start difference. First operand 14994 states and 15678 transitions. Second operand 7 states. [2018-12-30 23:27:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:38,300 INFO L93 Difference]: Finished difference Result 39281 states and 40936 transitions. [2018-12-30 23:27:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:27:38,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 730 [2018-12-30 23:27:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:38,324 INFO L225 Difference]: With dead ends: 39281 [2018-12-30 23:27:38,324 INFO L226 Difference]: Without dead ends: 24289 [2018-12-30 23:27:38,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:27:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24289 states. [2018-12-30 23:27:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24289 to 17687. [2018-12-30 23:27:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17687 states. [2018-12-30 23:27:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17687 states to 17687 states and 18435 transitions. [2018-12-30 23:27:38,597 INFO L78 Accepts]: Start accepts. Automaton has 17687 states and 18435 transitions. Word has length 730 [2018-12-30 23:27:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:38,598 INFO L480 AbstractCegarLoop]: Abstraction has 17687 states and 18435 transitions. [2018-12-30 23:27:38,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:27:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 17687 states and 18435 transitions. [2018-12-30 23:27:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2018-12-30 23:27:38,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:38,620 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:27:38,620 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:38,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1210135993, now seen corresponding path program 1 times [2018-12-30 23:27:38,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:38,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:38,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:38,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:38,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2018-12-30 23:27:39,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:27:39,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:27:39,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:27:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:27:39,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:27:39,544 INFO L87 Difference]: Start difference. First operand 17687 states and 18435 transitions. Second operand 3 states. [2018-12-30 23:27:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:40,896 INFO L93 Difference]: Finished difference Result 33276 states and 34703 transitions. [2018-12-30 23:27:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:27:40,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 983 [2018-12-30 23:27:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:40,913 INFO L225 Difference]: With dead ends: 33276 [2018-12-30 23:27:40,913 INFO L226 Difference]: Without dead ends: 17686 [2018-12-30 23:27:40,922 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:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17686 states. [2018-12-30 23:27:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17686 to 17387. [2018-12-30 23:27:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17387 states. [2018-12-30 23:27:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17387 states to 17387 states and 18115 transitions. [2018-12-30 23:27:41,127 INFO L78 Accepts]: Start accepts. Automaton has 17387 states and 18115 transitions. Word has length 983 [2018-12-30 23:27:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:41,128 INFO L480 AbstractCegarLoop]: Abstraction has 17387 states and 18115 transitions. [2018-12-30 23:27:41,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:27:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 17387 states and 18115 transitions. [2018-12-30 23:27:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2018-12-30 23:27:41,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:41,153 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,154 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:41,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:41,154 INFO L82 PathProgramCache]: Analyzing trace with hash -357221268, now seen corresponding path program 1 times [2018-12-30 23:27:41,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:41,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:41,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:41,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:41,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 1474 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-12-30 23:27:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:27:42,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:27:42,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:27:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:27:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:27:42,695 INFO L87 Difference]: Start difference. First operand 17387 states and 18115 transitions. Second operand 4 states. [2018-12-30 23:27:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:44,784 INFO L93 Difference]: Finished difference Result 32976 states and 34392 transitions. [2018-12-30 23:27:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:27:44,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1074 [2018-12-30 23:27:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:44,804 INFO L225 Difference]: With dead ends: 32976 [2018-12-30 23:27:44,804 INFO L226 Difference]: Without dead ends: 17686 [2018-12-30 23:27:44,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 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:27:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17686 states. [2018-12-30 23:27:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17686 to 17686. [2018-12-30 23:27:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17686 states. [2018-12-30 23:27:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17686 states to 17686 states and 18343 transitions. [2018-12-30 23:27:45,004 INFO L78 Accepts]: Start accepts. Automaton has 17686 states and 18343 transitions. Word has length 1074 [2018-12-30 23:27:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:45,005 INFO L480 AbstractCegarLoop]: Abstraction has 17686 states and 18343 transitions. [2018-12-30 23:27:45,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:27:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17686 states and 18343 transitions. [2018-12-30 23:27:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2018-12-30 23:27:45,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:45,025 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 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] [2018-12-30 23:27:45,025 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:45,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1324101687, now seen corresponding path program 1 times [2018-12-30 23:27:45,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:45,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:45,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:45,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:46,368 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-12-30 23:27:46,866 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-12-30 23:27:47,103 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-12-30 23:27:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2174 proven. 398 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-12-30 23:27:49,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:27:49,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:27:49,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:49,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:27:50,014 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 27 [2018-12-30 23:27:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2056 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-12-30 23:27:52,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:27:52,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2018-12-30 23:27:52,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 23:27:52,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 23:27:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:27:52,137 INFO L87 Difference]: Start difference. First operand 17686 states and 18343 transitions. Second operand 14 states. [2018-12-30 23:28:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:12,143 INFO L93 Difference]: Finished difference Result 37661 states and 39071 transitions. [2018-12-30 23:28:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-30 23:28:12,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1204 [2018-12-30 23:28:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:12,174 INFO L225 Difference]: With dead ends: 37661 [2018-12-30 23:28:12,174 INFO L226 Difference]: Without dead ends: 20568 [2018-12-30 23:28:12,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1230 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=434, Invalid=1546, Unknown=0, NotChecked=0, Total=1980 [2018-12-30 23:28:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20568 states. [2018-12-30 23:28:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20568 to 17987. [2018-12-30 23:28:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17987 states. [2018-12-30 23:28:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17987 states to 17987 states and 18590 transitions. [2018-12-30 23:28:12,393 INFO L78 Accepts]: Start accepts. Automaton has 17987 states and 18590 transitions. Word has length 1204 [2018-12-30 23:28:12,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:12,394 INFO L480 AbstractCegarLoop]: Abstraction has 17987 states and 18590 transitions. [2018-12-30 23:28:12,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 23:28:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 17987 states and 18590 transitions. [2018-12-30 23:28:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2018-12-30 23:28:12,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:12,416 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:28:12,416 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash -121694548, now seen corresponding path program 1 times [2018-12-30 23:28:12,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:12,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:12,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:12,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:12,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 1575 proven. 0 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-12-30 23:28:14,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:28:14,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:28:14,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:28:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:28:14,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:28:14,066 INFO L87 Difference]: Start difference. First operand 17987 states and 18590 transitions. Second operand 4 states. [2018-12-30 23:28:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:16,380 INFO L93 Difference]: Finished difference Result 39884 states and 41239 transitions. [2018-12-30 23:28:16,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:28:16,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1209 [2018-12-30 23:28:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:16,400 INFO L225 Difference]: With dead ends: 39884 [2018-12-30 23:28:16,400 INFO L226 Difference]: Without dead ends: 22198 [2018-12-30 23:28:16,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:28:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2018-12-30 23:28:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 18285. [2018-12-30 23:28:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18285 states. [2018-12-30 23:28:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18285 states to 18285 states and 18884 transitions. [2018-12-30 23:28:16,612 INFO L78 Accepts]: Start accepts. Automaton has 18285 states and 18884 transitions. Word has length 1209 [2018-12-30 23:28:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:16,613 INFO L480 AbstractCegarLoop]: Abstraction has 18285 states and 18884 transitions. [2018-12-30 23:28:16,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:28:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 18285 states and 18884 transitions. [2018-12-30 23:28:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1437 [2018-12-30 23:28:16,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:16,645 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 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, 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] [2018-12-30 23:28:16,645 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1064392768, now seen corresponding path program 1 times [2018-12-30 23:28:16,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:16,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:16,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:16,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:16,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:17,506 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:28:17,744 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-12-30 23:28:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 2403 proven. 343 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2018-12-30 23:28:19,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:28:19,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:28:19,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:20,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:28:20,581 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2018-12-30 23:28:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 2746 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2018-12-30 23:28:22,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:28:22,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-12-30 23:28:22,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:28:22,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:28:22,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:28:22,326 INFO L87 Difference]: Start difference. First operand 18285 states and 18884 transitions. Second operand 6 states. [2018-12-30 23:28:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:27,713 INFO L93 Difference]: Finished difference Result 41674 states and 43139 transitions. [2018-12-30 23:28:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:28:27,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1436 [2018-12-30 23:28:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:27,737 INFO L225 Difference]: With dead ends: 41674 [2018-12-30 23:28:27,737 INFO L226 Difference]: Without dead ends: 23391 [2018-12-30 23:28:27,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1445 GetRequests, 1438 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:28:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23391 states. [2018-12-30 23:28:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23391 to 14687. [2018-12-30 23:28:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14687 states. [2018-12-30 23:28:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14687 states to 14687 states and 14991 transitions. [2018-12-30 23:28:27,945 INFO L78 Accepts]: Start accepts. Automaton has 14687 states and 14991 transitions. Word has length 1436 [2018-12-30 23:28:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:27,946 INFO L480 AbstractCegarLoop]: Abstraction has 14687 states and 14991 transitions. [2018-12-30 23:28:27,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:28:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 14687 states and 14991 transitions. [2018-12-30 23:28:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2018-12-30 23:28:27,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:27,968 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 23:28:27,969 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1533655480, now seen corresponding path program 1 times [2018-12-30 23:28:27,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:27,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:27,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:27,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:27,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 2560 proven. 561 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-12-30 23:28:31,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:28:31,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:28:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:31,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:28:31,761 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 19 [2018-12-30 23:28:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 2560 proven. 561 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-12-30 23:28:37,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:28:37,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-12-30 23:28:37,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:28:37,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:28:37,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:28:37,295 INFO L87 Difference]: Start difference. First operand 14687 states and 14991 transitions. Second operand 7 states. [2018-12-30 23:28:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:42,183 INFO L93 Difference]: Finished difference Result 22777 states and 23231 transitions. [2018-12-30 23:28:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:28:42,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1468 [2018-12-30 23:28:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:42,206 INFO L225 Difference]: With dead ends: 22777 [2018-12-30 23:28:42,206 INFO L226 Difference]: Without dead ends: 22775 [2018-12-30 23:28:42,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1473 GetRequests, 1467 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:28:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22775 states. [2018-12-30 23:28:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22775 to 15885. [2018-12-30 23:28:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15885 states. [2018-12-30 23:28:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15885 states to 15885 states and 16219 transitions. [2018-12-30 23:28:42,412 INFO L78 Accepts]: Start accepts. Automaton has 15885 states and 16219 transitions. Word has length 1468 [2018-12-30 23:28:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:42,414 INFO L480 AbstractCegarLoop]: Abstraction has 15885 states and 16219 transitions. [2018-12-30 23:28:42,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:28:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 15885 states and 16219 transitions. [2018-12-30 23:28:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2018-12-30 23:28:42,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:42,435 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:42,435 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1729617442, now seen corresponding path program 1 times [2018-12-30 23:28:42,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:43,272 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:28:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 35 proven. 3578 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2018-12-30 23:28:46,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:28:46,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:28:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:46,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:28:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 2622 proven. 561 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2018-12-30 23:28:49,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:28:49,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-12-30 23:28:49,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 23:28:49,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 23:28:49,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:28:49,498 INFO L87 Difference]: Start difference. First operand 15885 states and 16219 transitions. Second operand 11 states. [2018-12-30 23:28:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:58,192 INFO L93 Difference]: Finished difference Result 37465 states and 38250 transitions. [2018-12-30 23:28:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-30 23:28:58,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1485 [2018-12-30 23:28:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:58,226 INFO L225 Difference]: With dead ends: 37465 [2018-12-30 23:28:58,226 INFO L226 Difference]: Without dead ends: 37463 [2018-12-30 23:28:58,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1501 GetRequests, 1487 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-30 23:28:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37463 states. [2018-12-30 23:28:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37463 to 15885. [2018-12-30 23:28:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15885 states. [2018-12-30 23:28:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15885 states to 15885 states and 16219 transitions. [2018-12-30 23:28:58,517 INFO L78 Accepts]: Start accepts. Automaton has 15885 states and 16219 transitions. Word has length 1485 [2018-12-30 23:28:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:58,518 INFO L480 AbstractCegarLoop]: Abstraction has 15885 states and 16219 transitions. [2018-12-30 23:28:58,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 23:28:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 15885 states and 16219 transitions. [2018-12-30 23:28:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2018-12-30 23:28:58,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:58,543 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:28:58,543 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:58,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:58,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1882290462, now seen corresponding path program 1 times [2018-12-30 23:28:58,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:58,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:58,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:58,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5374 backedges. 3666 proven. 0 refuted. 0 times theorem prover too weak. 1708 trivial. 0 not checked. [2018-12-30 23:29:00,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:29:00,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:29:00,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:29:00,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:29:00,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:29:00,809 INFO L87 Difference]: Start difference. First operand 15885 states and 16219 transitions. Second operand 3 states. [2018-12-30 23:29:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:02,147 INFO L93 Difference]: Finished difference Result 31476 states and 32145 transitions. [2018-12-30 23:29:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:29:02,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1695 [2018-12-30 23:29:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:02,164 INFO L225 Difference]: With dead ends: 31476 [2018-12-30 23:29:02,164 INFO L226 Difference]: Without dead ends: 17688 [2018-12-30 23:29:02,173 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:29:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17688 states. [2018-12-30 23:29:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17688 to 16184. [2018-12-30 23:29:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16184 states. [2018-12-30 23:29:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16184 states to 16184 states and 16509 transitions. [2018-12-30 23:29:02,386 INFO L78 Accepts]: Start accepts. Automaton has 16184 states and 16509 transitions. Word has length 1695 [2018-12-30 23:29:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:02,387 INFO L480 AbstractCegarLoop]: Abstraction has 16184 states and 16509 transitions. [2018-12-30 23:29:02,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:29:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16184 states and 16509 transitions. [2018-12-30 23:29:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1792 [2018-12-30 23:29:02,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:02,415 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:29:02,416 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:02,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2019664079, now seen corresponding path program 1 times [2018-12-30 23:29:02,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:02,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:02,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:02,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:02,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 3074 proven. 561 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2018-12-30 23:29:04,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:29:04,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:29:04,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:05,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:29:05,455 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 18 [2018-12-30 23:29:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 3074 proven. 561 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2018-12-30 23:29:08,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:29:08,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-30 23:29:08,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:29:08,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:29:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:29:08,240 INFO L87 Difference]: Start difference. First operand 16184 states and 16509 transitions. Second operand 8 states. [2018-12-30 23:29:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:12,858 INFO L93 Difference]: Finished difference Result 26670 states and 27196 transitions. [2018-12-30 23:29:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:29:12,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1791 [2018-12-30 23:29:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:12,882 INFO L225 Difference]: With dead ends: 26670 [2018-12-30 23:29:12,882 INFO L226 Difference]: Without dead ends: 26668 [2018-12-30 23:29:12,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1802 GetRequests, 1793 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:29:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26668 states. [2018-12-30 23:29:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26668 to 16184. [2018-12-30 23:29:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16184 states. [2018-12-30 23:29:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16184 states to 16184 states and 16509 transitions. [2018-12-30 23:29:13,107 INFO L78 Accepts]: Start accepts. Automaton has 16184 states and 16509 transitions. Word has length 1791 [2018-12-30 23:29:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:13,109 INFO L480 AbstractCegarLoop]: Abstraction has 16184 states and 16509 transitions. [2018-12-30 23:29:13,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:29:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 16184 states and 16509 transitions. [2018-12-30 23:29:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1800 [2018-12-30 23:29:13,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:13,132 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:13,133 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 346048769, now seen corresponding path program 1 times [2018-12-30 23:29:13,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:13,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6406 backedges. 3589 proven. 1322 refuted. 0 times theorem prover too weak. 1495 trivial. 0 not checked. [2018-12-30 23:29:15,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:29:15,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:29:15,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:15,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:29:16,644 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 498 DAG size of output: 21 [2018-12-30 23:29:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6406 backedges. 3589 proven. 1322 refuted. 0 times theorem prover too weak. 1495 trivial. 0 not checked. [2018-12-30 23:29:19,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:29:19,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-30 23:29:19,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:29:19,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:29:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:29:19,958 INFO L87 Difference]: Start difference. First operand 16184 states and 16509 transitions. Second operand 9 states. [2018-12-30 23:29:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:25,164 INFO L93 Difference]: Finished difference Result 37159 states and 37912 transitions. [2018-12-30 23:29:25,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:29:25,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1799 [2018-12-30 23:29:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:25,166 INFO L225 Difference]: With dead ends: 37159 [2018-12-30 23:29:25,166 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:29:25,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1814 GetRequests, 1803 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-30 23:29:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:29:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:29:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:29:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:29:25,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1799 [2018-12-30 23:29:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:25,179 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:29:25,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:29:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:29:25,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:29:25,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:29:25,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:25,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:27,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:28,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:28,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:28,871 WARN L181 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 1242 DAG size of output: 1171 [2018-12-30 23:29:29,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:29,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:30,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:31,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:31,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:31,798 WARN L181 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 1239 DAG size of output: 1168 [2018-12-30 23:29:32,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:32,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:33,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:29:33,350 WARN L181 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 962 DAG size of output: 917 [2018-12-30 23:29:59,340 WARN L181 SmtUtils]: Spent 25.98 s on a formula simplification. DAG size of input: 1151 DAG size of output: 223 [2018-12-30 23:30:28,991 WARN L181 SmtUtils]: Spent 29.64 s on a formula simplification. DAG size of input: 1148 DAG size of output: 211 [2018-12-30 23:30:44,397 WARN L181 SmtUtils]: Spent 15.40 s on a formula simplification. DAG size of input: 906 DAG size of output: 219 [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,402 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,403 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,404 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:30:44,405 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,406 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:30:44,407 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,408 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:30:44,409 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,410 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,411 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,412 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:30:44,413 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,420 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,421 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,422 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,423 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:30:44,424 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:30:44,425 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:30:44,426 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,427 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,427 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,427 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse48 (+ ~a0~0 98)) (.cse50 (+ ~a4~0 86))) (let ((.cse31 (< 0 .cse50)) (.cse23 (<= (+ ~a0~0 147) 0)) (.cse14 (< 0 .cse48)) (.cse30 (= ~a2~0 1)) (.cse49 (+ ~a29~0 144)) (.cse46 (<= .cse50 0)) (.cse44 (not (= 3 ~a2~0)))) (let ((.cse6 (<= 2 ~a2~0)) (.cse8 (and .cse46 .cse44)) (.cse37 (<= ~a2~0 3)) (.cse45 (+ ~a29~0 16)) (.cse41 (= ~a2~0 3)) (.cse40 (<= .cse49 0)) (.cse42 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse26 (<= (+ ~a0~0 61) 0)) (.cse25 (and .cse46 .cse30)) (.cse22 (or .cse31 .cse23 .cse14)) (.cse43 (< 0 .cse49))) (let ((.cse11 (and .cse30 .cse31 .cse43)) (.cse24 (<= 0 (+ ~a0~0 599998))) (.cse16 (<= (+ ~a0~0 300073) 0)) (.cse32 (<= 0 (+ ~a0~0 385322))) (.cse0 (<= 44 ~a29~0)) (.cse19 (<= .cse48 0)) (.cse15 (<= ~a29~0 36)) (.cse4 (<= 3 ~a2~0)) (.cse36 (exists ((v_prenex_36 Int)) (let ((.cse47 (mod (+ v_prenex_36 11) 29))) (and (<= .cse47 (+ ~a29~0 14)) (not (= .cse47 0)) (< (+ v_prenex_36 371124) 0))))) (.cse9 (and (and .cse25 (<= ~a29~0 43) .cse43) .cse22)) (.cse10 (or (and .cse41 .cse40 .cse42) .cse31 .cse26)) (.cse17 (< 0 .cse45)) (.cse18 (and (and .cse46 .cse43) .cse37)) (.cse5 (exists ((v_prenex_6 Int)) (and (<= (+ v_prenex_6 98) 0) (<= ~a0~0 (div (+ (* 10 v_prenex_6) (- 3298780)) 9)) (= (mod (+ v_prenex_6 8) 9) 0)))) (.cse33 (and .cse46 .cse43 .cse44)) (.cse27 (= ~a2~0 4)) (.cse28 (and .cse6 .cse8 .cse14)) (.cse34 (<= ~a0~0 599999)) (.cse20 (= ~a2~0 2)) (.cse21 (<= (+ ~a4~0 89) 0)) (.cse12 (<= ~a0~0 599946)) (.cse13 (<= .cse45 0)) (.cse35 (and .cse43 .cse31 .cse44)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse29 (<= 0 (+ ~a0~0 146))) (.cse7 (<= (+ ~a0~0 99) 0))) (or (and .cse0 .cse1 (exists ((v_prenex_125 Int)) (let ((.cse3 (* 10 (div v_prenex_125 5)))) (let ((.cse2 (+ .cse3 3459790))) (and (<= (div .cse2 (- 9)) ~a0~0) (<= 0 v_prenex_125) (<= 0 .cse2) (<= v_prenex_125 599999) (<= 0 (+ .cse3 3459800)))))) .cse4 .cse5) (and .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse1 .cse11 .cse12 .cse13 .cse14) (and .cse11 (<= 0 (+ ~a0~0 451092)) .cse15 .cse1 .cse16) (and .cse6 .cse17 .cse7 .cse18) (and (and .cse19 .cse1 .cse17 .cse20) .cse15) (and .cse6 .cse21 .cse22 .cse7) (and .cse23 (and .cse24 .cse1 .cse17 .cse11 (exists ((v_~a29~0_895 Int)) (and (<= ~a29~0 (+ (mod (+ v_~a29~0_895 11) 29) 15)) (<= 0 (+ v_~a29~0_895 371124)))))) (and .cse7 .cse25) (and .cse26 .cse27 .cse28) (and .cse19 .cse0 .cse1 .cse20) (and .cse19 .cse1 .cse29 (and .cse30 .cse31)) (and .cse32 (and .cse1 .cse27) .cse23 .cse13) (and (and .cse6 .cse17 .cse33) .cse34) (and .cse32 (and .cse0 .cse1 .cse30) .cse23) (and (and .cse24 .cse6 .cse35 .cse1) .cse23 .cse36) (and .cse24 .cse6 .cse35 .cse1 .cse16) (and .cse32 (and .cse37 .cse1 .cse7 .cse4 .cse36)) (and (or (and .cse19 (and .cse35 .cse0 .cse1) .cse4) (and .cse19 (and .cse35 .cse1) .cse15 .cse4 .cse36)) (exists ((v_prenex_100 Int)) (let ((.cse38 (+ (* 10 (div v_prenex_100 5)) 3459790))) (and (<= 0 .cse38) (<= v_prenex_100 599970) (<= 0 v_prenex_100) (<= (div .cse38 (- 9)) ~a0~0))))) (let ((.cse39 (+ ~a0~0 44))) (and .cse9 (<= 0 .cse39) .cse13 (<= .cse39 0))) (and .cse6 .cse10 .cse18 .cse14) (and .cse34 (and .cse6 .cse17 .cse18 .cse14)) (and .cse1 .cse20 .cse5) (and .cse25 .cse40 .cse26) (and (and .cse33 .cse27) .cse34) (and (<= 214745 ~a0~0) .cse27 .cse12 .cse28) (and .cse6 .cse37 .cse1 .cse31 .cse29 .cse7) (and .cse34 (and .cse8 .cse20)) (and (and (and .cse21 .cse14) (and .cse41 .cse40) (or .cse42 .cse26)) .cse12) (and (and .cse6 .cse1 .cse31 .cse23 .cse37) .cse13) (and .cse6 .cse13 .cse35 .cse1 .cse29 .cse7)))))) [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,428 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,429 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,430 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,431 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,433 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse52 (+ ~a29~0 144)) (.cse53 (+ ~a4~0 86))) (let ((.cse49 (<= .cse53 0)) (.cse48 (+ ~a0~0 98)) (.cse47 (< 0 .cse52)) (.cse4 (< 0 .cse53)) (.cse50 (not (= 3 ~a2~0)))) (let ((.cse46 (<= ~a29~0 43)) (.cse34 (<= ~a2~0 3)) (.cse45 (+ ~a29~0 16)) (.cse8 (and .cse47 .cse4 .cse50)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse13 (<= (+ ~a0~0 147) 0)) (.cse24 (< 0 .cse48)) (.cse3 (= ~a2~0 1)) (.cse7 (<= 2 ~a2~0)) (.cse33 (and .cse49 .cse50))) (let ((.cse32 (and .cse7 .cse33)) (.cse14 (and .cse49 .cse3)) (.cse44 (or .cse4 .cse13 .cse24)) (.cse39 (<= 0 (+ ~a0~0 599998))) (.cse26 (and .cse7 .cse8 .cse1)) (.cse15 (<= .cse52 0)) (.cse43 (<= (+ ~a0~0 61) 0)) (.cse20 (< 0 .cse45)) (.cse41 (and (and .cse49 .cse47) .cse34)) (.cse40 (and .cse3 .cse4 .cse46 .cse47))) (let ((.cse30 (and .cse1 .cse40)) (.cse19 (<= 3 ~a2~0)) (.cse27 (exists ((v_prenex_36 Int)) (let ((.cse51 (mod (+ v_prenex_36 11) 29))) (and (<= .cse51 (+ ~a29~0 14)) (not (= .cse51 0)) (< (+ v_prenex_36 371124) 0))))) (.cse22 (<= ~a0~0 599999)) (.cse21 (and .cse49 .cse47 .cse50)) (.cse11 (<= ~a0~0 599946)) (.cse12 (<= 0 (+ ~a0~0 385322))) (.cse16 (<= 44 ~a29~0)) (.cse23 (and .cse7 .cse20 .cse41)) (.cse0 (<= .cse48 0)) (.cse25 (<= ~a29~0 36)) (.cse37 (or (and (= ~a2~0 3) .cse15 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse4 .cse43)) (.cse31 (<= (+ ~a0~0 300073) 0)) (.cse35 (and .cse39 .cse26)) (.cse2 (<= 0 (+ ~a0~0 146))) (.cse38 (and (and .cse14 .cse46 .cse47) .cse44)) (.cse9 (= ~a2~0 4)) (.cse10 (and .cse32 .cse24)) (.cse5 (<= .cse45 0)) (.cse36 (and .cse7 (<= (+ ~a4~0 89) 0) .cse44 .cse34)) (.cse6 (<= (+ ~a0~0 99) 0)) (.cse29 (= ~a2~0 2))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4))) (and .cse5 (and .cse6 (and .cse7 .cse8 .cse1 .cse2))) (and (and .cse9 .cse10) (<= 214745 ~a0~0) .cse11) (and .cse12 .cse13 (and .cse9 .cse1) .cse5) (and .cse14 .cse15) (and (and .cse16 .cse1) (exists ((v_prenex_125 Int)) (let ((.cse18 (* 10 (div v_prenex_125 5)))) (let ((.cse17 (+ .cse18 3459790))) (and (<= (div .cse17 (- 9)) ~a0~0) (<= 0 v_prenex_125) (<= 0 .cse17) (<= v_prenex_125 599999) (<= 0 (+ .cse18 3459800)))))) .cse19 (exists ((v_prenex_6 Int)) (and (<= (+ v_prenex_6 98) 0) (<= ~a0~0 (div (+ (* 10 v_prenex_6) (- 3298780)) 9)) (= (mod (+ v_prenex_6 8) 9) 0)))) (and (and .cse7 .cse20 .cse21) .cse22) (and .cse22 (and .cse23 .cse24)) (and (or (and .cse25 (and .cse0 .cse26) .cse27) (and .cse0 (and .cse8 .cse16 .cse1) .cse19)) (exists ((v_prenex_100 Int)) (let ((.cse28 (+ (* 10 (div v_prenex_100 5)) 3459790))) (and (<= 0 .cse28) (<= v_prenex_100 599970) (<= 0 v_prenex_100) (<= (div .cse28 (- 9)) ~a0~0))))) (and .cse0 (and .cse16 .cse1 .cse29)) (and (<= 0 (+ ~a0~0 451092)) .cse30 .cse31) (and .cse30 .cse11 .cse5 .cse24) (and .cse6 .cse32) (and .cse22 (and .cse33 .cse29)) (and .cse12 (and (and .cse1 .cse6 .cse34) .cse19 .cse27)) (and .cse13 .cse35 .cse27) (and .cse22 (and .cse9 .cse21)) (and (and .cse15 .cse36) .cse11) (and .cse12 (and .cse16 .cse1 .cse3) .cse13) (and .cse37 .cse38) (and (and .cse39 .cse1 .cse20 .cse40) .cse13) (and .cse23 .cse6) (and (and (and .cse1 .cse20 .cse29) .cse0) .cse25) (and (and .cse37 (and .cse7 .cse41)) .cse24) (and .cse31 .cse35) (and .cse7 .cse34 .cse1 .cse4 .cse2 .cse6) (let ((.cse42 (+ ~a0~0 44))) (and .cse38 (<= 0 .cse42) .cse5 (<= .cse42 0))) (and .cse43 .cse9 .cse10) (and .cse6 .cse14) (and .cse5 (and (and .cse7 .cse1 .cse4 .cse34) .cse13)) (and .cse36 .cse6) (and (and .cse1 .cse29) .cse13))))))) [2018-12-30 23:30:44,433 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,433 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:30:44,433 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:30:44,433 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,433 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,433 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,433 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,434 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:30:44,435 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,438 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,439 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,440 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,441 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,441 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,441 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,441 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse53 (+ ~a29~0 144)) (.cse54 (+ ~a4~0 86))) (let ((.cse50 (<= .cse54 0)) (.cse49 (< 0 .cse53)) (.cse4 (< 0 .cse54)) (.cse51 (not (= 3 ~a2~0))) (.cse47 (+ ~a0~0 98))) (let ((.cse48 (<= ~a29~0 43)) (.cse15 (<= (+ ~a0~0 147) 0)) (.cse28 (< 0 .cse47)) (.cse3 (= ~a2~0 1)) (.cse37 (<= ~a2~0 3)) (.cse46 (+ ~a29~0 16)) (.cse10 (and .cse49 .cse4 .cse51)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse9 (<= 2 ~a2~0)) (.cse36 (and .cse50 .cse51))) (let ((.cse35 (and .cse9 .cse36)) (.cse41 (<= 0 (+ ~a0~0 599998))) (.cse30 (and .cse9 .cse10 .cse1)) (.cse17 (<= .cse53 0)) (.cse44 (<= (+ ~a0~0 61) 0)) (.cse24 (< 0 .cse46)) (.cse43 (and (and .cse50 .cse49) .cse37)) (.cse16 (and .cse50 .cse3)) (.cse45 (or .cse4 .cse15 .cse28)) (.cse42 (and .cse3 .cse4 .cse48 .cse49))) (let ((.cse6 (exists ((v_prenex_6 Int)) (and (<= (+ v_prenex_6 98) 0) (<= ~a0~0 (div (+ (* 10 v_prenex_6) (- 3298780)) 9)) (= (mod (+ v_prenex_6 8) 9) 0)))) (.cse32 (<= 0 (+ ~a0~0 451092))) (.cse33 (and .cse1 .cse42)) (.cse21 (<= 3 ~a2~0)) (.cse31 (exists ((v_prenex_36 Int)) (let ((.cse52 (mod (+ v_prenex_36 11) 29))) (and (<= .cse52 (+ ~a29~0 14)) (not (= .cse52 0)) (< (+ v_prenex_36 371124) 0))))) (.cse26 (<= ~a0~0 599999)) (.cse25 (and .cse50 .cse49 .cse51)) (.cse13 (<= ~a0~0 599946)) (.cse14 (<= 0 (+ ~a0~0 385322))) (.cse18 (<= 44 ~a29~0)) (.cse22 (and (and .cse16 .cse48 .cse49) .cse45)) (.cse27 (and .cse9 .cse24 .cse43)) (.cse5 (= ~a2~0 2)) (.cse0 (<= .cse47 0)) (.cse29 (<= ~a29~0 36)) (.cse40 (or (and (= ~a2~0 3) .cse17 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse4 .cse44)) (.cse34 (<= (+ ~a0~0 300073) 0)) (.cse38 (and .cse41 .cse30)) (.cse2 (<= 0 (+ ~a0~0 146))) (.cse11 (= ~a2~0 4)) (.cse12 (and .cse35 .cse28)) (.cse7 (<= .cse46 0)) (.cse39 (and .cse9 (<= (+ ~a4~0 89) 0) .cse45 .cse37)) (.cse8 (<= (+ ~a0~0 99) 0))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4))) (and (and .cse1 .cse5) .cse6) (and .cse7 (and .cse8 (and .cse9 .cse10 .cse1 .cse2))) (and (and .cse11 .cse12) (<= 214745 ~a0~0) .cse13) (and .cse14 .cse15 (and .cse11 .cse1) .cse7) (and .cse16 .cse17) (and (and .cse18 .cse1) (exists ((v_prenex_125 Int)) (let ((.cse20 (* 10 (div v_prenex_125 5)))) (let ((.cse19 (+ .cse20 3459790))) (and (<= (div .cse19 (- 9)) ~a0~0) (<= 0 v_prenex_125) (<= 0 .cse19) (<= v_prenex_125 599999) (<= 0 (+ .cse20 3459800)))))) .cse21 .cse6) (let ((.cse23 (+ ~a0~0 44))) (and .cse22 (<= 0 .cse23) .cse7 (<= .cse23 0))) (and (and .cse9 .cse24 .cse25) .cse26) (and .cse26 (and .cse27 .cse28)) (and (or (and .cse29 (and .cse0 .cse30) .cse31) (and .cse0 (and .cse10 .cse18 .cse1) .cse21)) .cse32) (and .cse0 (and .cse18 .cse1 .cse5)) (and .cse32 .cse33 .cse34) (and .cse33 .cse13 .cse7 .cse28) (and .cse8 .cse35) (and .cse26 (and .cse36 .cse5)) (and .cse14 (and (and .cse1 .cse8 .cse37) .cse21 .cse31)) (and .cse15 .cse38 .cse31) (and .cse26 (and .cse11 .cse25)) (and (and .cse17 .cse39) .cse13) (and .cse14 (and .cse18 .cse1 .cse3) .cse15) (and .cse40 .cse22) (and (and .cse41 .cse1 .cse24 .cse42) .cse15) (and .cse27 .cse8) (and (and (and .cse1 .cse24 .cse5) .cse0) .cse29) (and (and .cse40 (and .cse9 .cse43)) .cse28) (and .cse34 .cse38) (and .cse9 .cse37 .cse1 .cse4 .cse2 .cse8) (and .cse44 .cse11 .cse12) (and .cse8 .cse16) (and .cse7 (and (and .cse9 .cse1 .cse4 .cse37) .cse15)) (and .cse39 .cse8))))))) [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-30 23:30:44,442 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,443 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,444 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,445 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,446 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,447 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:30:44,448 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:30:44,450 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,451 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,451 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:30:44,451 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:30:44,451 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-12-30 23:30:44,483 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,578 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,593 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,593 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,599 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,599 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:44,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:44,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,630 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,630 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:44,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:44,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:44,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:44,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:44,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:44,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:30:44 BoogieIcfgContainer [2018-12-30 23:30:44,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:30:44,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:30:44,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:30:44,651 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:30:44,656 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:57" (3/4) ... [2018-12-30 23:30:44,666 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:30:44,720 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-30 23:30:44,724 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:30:44,768 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0) [2018-12-30 23:30:44,776 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && 0 <= a0 + 451092)) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0) [2018-12-30 23:30:44,792 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0)) || ((2 <= a2 && a0 + 99 <= 0) && a4 + 86 <= 0 && !(3 == a2))) || (((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0))) || ((((a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || ((((((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 451092) && a29 <= 36) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && a0 + 99 <= 0) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && a2 == 2) && a29 <= 36)) || (((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a0 + 99 <= 0)) || (a0 + 147 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && (\exists v_~a29~0_895 : int :: a29 <= (v_~a29~0_895 + 11) % 29 + 15 && 0 <= v_~a29~0_895 + 371124))) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 44 <= a29) && a4 + 42 <= 0) && a2 == 2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86)) || (((0 <= a0 + 385322 && a4 + 42 <= 0 && a2 == 4) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 147 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (0 <= a0 + 385322 && (((a2 <= 3 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2) || ((((a0 + 98 <= 0 && ((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a29 <= 36) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0)) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a2 == 4) && a0 <= 599999)) || (((214745 <= a0 && a2 == 4) && a0 <= 599946) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || ((((a4 + 89 <= 0 && 0 < a0 + 98) && a2 == 3 && a29 + 144 <= 0) && (!(1 == input) || a0 + 61 <= 0)) && a0 <= 599946)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a0 + 147 <= 0) && a2 <= 3) && a29 + 16 <= 0)) || (((((2 <= a2 && a29 + 16 <= 0) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 99 <= 0) [2018-12-30 23:30:45,014 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:30:45,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:30:45,016 INFO L168 Benchmark]: Toolchain (without parser) took 296548.42 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 943.2 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-30 23:30:45,018 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:30:45,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1220.98 ms. Allocated memory is still 1.0 GB. Free memory was 943.2 MB in the beginning and 845.2 MB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. [2018-12-30 23:30:45,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 367.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 845.2 MB in the beginning and 1.1 GB in the end (delta: -258.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-12-30 23:30:45,019 INFO L168 Benchmark]: Boogie Preprocessor took 164.69 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: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-12-30 23:30:45,019 INFO L168 Benchmark]: RCFGBuilder took 7043.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.2 MB). Peak memory consumption was 303.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:30:45,022 INFO L168 Benchmark]: TraceAbstraction took 287382.43 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-30 23:30:45,022 INFO L168 Benchmark]: Witness Printer took 363.96 ms. Allocated memory is still 5.0 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:30:45,027 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1220.98 ms. Allocated memory is still 1.0 GB. Free memory was 943.2 MB in the beginning and 845.2 MB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 367.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 845.2 MB in the beginning and 1.1 GB in the end (delta: -258.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 164.69 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: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7043.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.2 MB). Peak memory consumption was 303.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 287382.43 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 363.96 ms. Allocated memory is still 5.0 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,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_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,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_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,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_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,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_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,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_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,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_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,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_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,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_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,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_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,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: 118]: 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:30:45,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,060 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,066 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,070 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2018-12-30 23:30:45,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,079 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,080 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,090 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && 0 <= a0 + 451092)) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2018-12-30 23:30:45,108 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,108 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,108 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:45,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:45,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2018-12-30 23:30:45,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:45,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2018-12-30 23:30:45,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,138 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2018-12-30 23:30:45,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2018-12-30 23:30:45,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-12-30 23:30:45,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0)) || ((2 <= a2 && a0 + 99 <= 0) && a4 + 86 <= 0 && !(3 == a2))) || (((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0))) || ((((a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || ((((((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 451092) && a29 <= 36) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && a0 + 99 <= 0) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && a2 == 2) && a29 <= 36)) || (((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a0 + 99 <= 0)) || (a0 + 147 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && (\exists v_~a29~0_895 : int :: a29 <= (v_~a29~0_895 + 11) % 29 + 15 && 0 <= v_~a29~0_895 + 371124))) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 44 <= a29) && a4 + 42 <= 0) && a2 == 2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86)) || (((0 <= a0 + 385322 && a4 + 42 <= 0 && a2 == 4) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 147 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (0 <= a0 + 385322 && (((a2 <= 3 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2) || ((((a0 + 98 <= 0 && ((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a29 <= 36) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0)) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a2 == 4) && a0 <= 599999)) || (((214745 <= a0 && a2 == 4) && a0 <= 599946) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || ((((a4 + 89 <= 0 && 0 < a0 + 98) && a2 == 3 && a29 + 144 <= 0) && (!(1 == input) || a0 + 61 <= 0)) && a0 <= 599946)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a0 + 147 <= 0) && a2 <= 3) && a29 + 16 <= 0)) || (((((2 <= a2 && a29 + 16 <= 0) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 99 <= 0) - 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, 287.1s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 136.1s AutomataDifference, 0.0s DeadEndRemovalTime, 79.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 3533 SDtfs, 33656 SDslu, 2073 SDs, 0 SdLazy, 72347 SolverSat, 8012 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12559 GetRequests, 12378 SyntacticMatches, 21 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21916occurred in iteration=9, 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: 4.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 83270 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 368 NumberOfFragments, 3458 HoareAnnotationTreeSize, 4 FomulaSimplifications, 31437115 FormulaSimplificationTreeSizeReduction, 8.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 386801164 FormulaSimplificationTreeSizeReductionInter, 71.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 32939 NumberOfCodeBlocks, 32939 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 32905 ConstructedInterpolants, 1733 QuantifiedInterpolants, 181914472 SizeOfPredicates, 10 NumberOfNonLiveVariables, 14195 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 34 InterpolantComputations, 18 PerfectInterpolantSequences, 67263/77828 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...