./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label32_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_label32_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 a7f583c5696f770774eed073d41307374ee0c036 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:26:38,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:26:38,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:26:38,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:26:38,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:26:38,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:26:38,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:26:38,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:26:38,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:26:38,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:26:38,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:26:38,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:26:38,433 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:26:38,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:26:38,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:26:38,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:26:38,448 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:26:38,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:26:38,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:26:38,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:26:38,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:26:38,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:26:38,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:26:38,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:26:38,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:26:38,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:26:38,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:26:38,470 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:26:38,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:26:38,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:26:38,475 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:26:38,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:26:38,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:26:38,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:26:38,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:26:38,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:26:38,481 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:26:38,509 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:26:38,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:26:38,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:26:38,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:26:38,513 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:26:38,513 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:26:38,513 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:26:38,513 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:26:38,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:26:38,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:26:38,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:26:38,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:26:38,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:26:38,516 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:26:38,516 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:26:38,516 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:26:38,516 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:26:38,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:26:38,516 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:26:38,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:26:38,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:26:38,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:26:38,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:26:38,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:26:38,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:26:38,518 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:26:38,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:26:38,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:26:38,518 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 -> a7f583c5696f770774eed073d41307374ee0c036 [2018-12-30 23:26:38,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:26:38,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:26:38,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:26:38,589 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:26:38,590 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:26:38,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label32_true-unreach-call.c [2018-12-30 23:26:38,651 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141a1a225/4c9880eca5d1451ab21fde0ae128290e/FLAGd97378785 [2018-12-30 23:26:39,291 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:26:39,292 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label32_true-unreach-call.c [2018-12-30 23:26:39,313 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141a1a225/4c9880eca5d1451ab21fde0ae128290e/FLAGd97378785 [2018-12-30 23:26:39,456 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141a1a225/4c9880eca5d1451ab21fde0ae128290e [2018-12-30 23:26:39,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:26:39,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:26:39,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:26:39,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:26:39,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:26:39,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:26:39" (1/1) ... [2018-12-30 23:26:39,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dac439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:39, skipping insertion in model container [2018-12-30 23:26:39,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:26:39" (1/1) ... [2018-12-30 23:26:39,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:26:39,567 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:26:40,410 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:26:40,417 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:26:40,781 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:26:40,805 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:26:40,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40 WrapperNode [2018-12-30 23:26:40,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:26:40,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:26:40,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:26:40,807 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:26:40,986 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:26:40" (1/1) ... [2018-12-30 23:26:41,041 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:26:40" (1/1) ... [2018-12-30 23:26:41,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:26:41,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:26:41,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:26:41,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:26:41,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (1/1) ... [2018-12-30 23:26:41,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (1/1) ... [2018-12-30 23:26:41,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (1/1) ... [2018-12-30 23:26:41,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (1/1) ... [2018-12-30 23:26:41,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (1/1) ... [2018-12-30 23:26:41,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (1/1) ... [2018-12-30 23:26:41,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (1/1) ... [2018-12-30 23:26:41,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:26:41,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:26:41,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:26:41,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:26:41,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (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:26:41,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:26:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:26:51,022 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:26:51,022 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 23:26:51,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:26:51 BoogieIcfgContainer [2018-12-30 23:26:51,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:26:51,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:26:51,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:26:51,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:26:51,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:26:39" (1/3) ... [2018-12-30 23:26:51,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5640d53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:26:51, skipping insertion in model container [2018-12-30 23:26:51,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:26:40" (2/3) ... [2018-12-30 23:26:51,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5640d53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:26:51, skipping insertion in model container [2018-12-30 23:26:51,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:26:51" (3/3) ... [2018-12-30 23:26:51,033 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label32_true-unreach-call.c [2018-12-30 23:26:51,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:26:51,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:26:51,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:26:51,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:26:51,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:26:51,109 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:26:51,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:26:51,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:26:51,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:26:51,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:26:51,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:26:51,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:26:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2018-12-30 23:26:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-30 23:26:51,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:51,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:26:51,152 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2018-12-30 23:26:51,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:51,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:51,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:51,594 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:26:51,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:51,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:51,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:26:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:26:51,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:26:51,623 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2018-12-30 23:26:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:26:57,958 INFO L93 Difference]: Finished difference Result 1466 states and 2714 transitions. [2018-12-30 23:26:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:26:57,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-30 23:26:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:26:58,006 INFO L225 Difference]: With dead ends: 1466 [2018-12-30 23:26:58,007 INFO L226 Difference]: Without dead ends: 975 [2018-12-30 23:26:58,016 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:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-30 23:26:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 973. [2018-12-30 23:26:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-12-30 23:26:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1485 transitions. [2018-12-30 23:26:58,153 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1485 transitions. Word has length 49 [2018-12-30 23:26:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:26:58,154 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1485 transitions. [2018-12-30 23:26:58,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:26:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1485 transitions. [2018-12-30 23:26:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-30 23:26:58,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:26:58,165 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:26:58,166 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:26:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:26:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash -602741442, now seen corresponding path program 1 times [2018-12-30 23:26:58,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:26:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:26:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:26:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:26:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:26:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:26:58,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:26:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:26:58,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:26:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:26:58,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:26:58,529 INFO L87 Difference]: Start difference. First operand 973 states and 1485 transitions. Second operand 4 states. [2018-12-30 23:27:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:03,968 INFO L93 Difference]: Finished difference Result 3745 states and 5745 transitions. [2018-12-30 23:27:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:27:03,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-30 23:27:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:03,985 INFO L225 Difference]: With dead ends: 3745 [2018-12-30 23:27:03,986 INFO L226 Difference]: Without dead ends: 2774 [2018-12-30 23:27:03,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:27:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2018-12-30 23:27:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1871. [2018-12-30 23:27:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2018-12-30 23:27:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2498 transitions. [2018-12-30 23:27:04,044 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2498 transitions. Word has length 161 [2018-12-30 23:27:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:04,045 INFO L480 AbstractCegarLoop]: Abstraction has 1871 states and 2498 transitions. [2018-12-30 23:27:04,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:27:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2498 transitions. [2018-12-30 23:27:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-12-30 23:27:04,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:04,063 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,063 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 172169868, now seen corresponding path program 1 times [2018-12-30 23:27:04,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:04,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:04,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:04,698 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-30 23:27:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-30 23:27:04,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:27:04,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:27:04,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:27:04,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:27:04,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:27:04,934 INFO L87 Difference]: Start difference. First operand 1871 states and 2498 transitions. Second operand 5 states. [2018-12-30 23:27:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:12,060 INFO L93 Difference]: Finished difference Result 4639 states and 5973 transitions. [2018-12-30 23:27:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:27:12,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 321 [2018-12-30 23:27:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:12,076 INFO L225 Difference]: With dead ends: 4639 [2018-12-30 23:27:12,076 INFO L226 Difference]: Without dead ends: 2770 [2018-12-30 23:27:12,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:27:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2018-12-30 23:27:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2470. [2018-12-30 23:27:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2018-12-30 23:27:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3139 transitions. [2018-12-30 23:27:12,124 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3139 transitions. Word has length 321 [2018-12-30 23:27:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:12,125 INFO L480 AbstractCegarLoop]: Abstraction has 2470 states and 3139 transitions. [2018-12-30 23:27:12,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:27:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3139 transitions. [2018-12-30 23:27:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-12-30 23:27:12,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:12,134 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,134 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash 591064250, now seen corresponding path program 1 times [2018-12-30 23:27:12,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:12,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:12,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:12,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:12,779 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:27:13,090 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-12-30 23:27:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 86 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:27:13,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:27:13,692 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:27:13,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:13,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:27:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:27:14,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:27:14,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2018-12-30 23:27:14,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 23:27:14,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 23:27:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:27:14,172 INFO L87 Difference]: Start difference. First operand 2470 states and 3139 transitions. Second operand 11 states. [2018-12-30 23:27:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:35,231 INFO L93 Difference]: Finished difference Result 8967 states and 11637 transitions. [2018-12-30 23:27:35,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-30 23:27:35,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 395 [2018-12-30 23:27:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:35,260 INFO L225 Difference]: With dead ends: 8967 [2018-12-30 23:27:35,260 INFO L226 Difference]: Without dead ends: 6499 [2018-12-30 23:27:35,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 406 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-12-30 23:27:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2018-12-30 23:27:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 4273. [2018-12-30 23:27:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4273 states. [2018-12-30 23:27:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5252 transitions. [2018-12-30 23:27:35,445 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5252 transitions. Word has length 395 [2018-12-30 23:27:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:35,446 INFO L480 AbstractCegarLoop]: Abstraction has 4273 states and 5252 transitions. [2018-12-30 23:27:35,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 23:27:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5252 transitions. [2018-12-30 23:27:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-12-30 23:27:35,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:35,462 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-12-30 23:27:35,462 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:35,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1542699677, now seen corresponding path program 1 times [2018-12-30 23:27:35,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:35,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:35,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:35,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:36,118 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:27:36,695 WARN L181 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-12-30 23:27:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 297 proven. 134 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-30 23:27:37,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:27:37,380 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:27:37,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:37,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:27:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-30 23:27:37,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:27:37,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 23:27:37,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:27:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:27:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:27:37,892 INFO L87 Difference]: Start difference. First operand 4273 states and 5252 transitions. Second operand 9 states. [2018-12-30 23:27:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:45,243 INFO L93 Difference]: Finished difference Result 9186 states and 11159 transitions. [2018-12-30 23:27:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 23:27:45,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 546 [2018-12-30 23:27:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:45,265 INFO L225 Difference]: With dead ends: 9186 [2018-12-30 23:27:45,265 INFO L226 Difference]: Without dead ends: 4915 [2018-12-30 23:27:45,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 550 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:27:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2018-12-30 23:27:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4270. [2018-12-30 23:27:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2018-12-30 23:27:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 4941 transitions. [2018-12-30 23:27:45,352 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 4941 transitions. Word has length 546 [2018-12-30 23:27:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:45,353 INFO L480 AbstractCegarLoop]: Abstraction has 4270 states and 4941 transitions. [2018-12-30 23:27:45,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:27:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 4941 transitions. [2018-12-30 23:27:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-12-30 23:27:45,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:45,374 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:27:45,374 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:45,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash 766630606, now seen corresponding path program 1 times [2018-12-30 23:27:45,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:45,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:45,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:45,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:45,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-30 23:27:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:27:46,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:27:46,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:27:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:27:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:27:46,077 INFO L87 Difference]: Start difference. First operand 4270 states and 4941 transitions. Second operand 3 states. [2018-12-30 23:27:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:27:50,181 INFO L93 Difference]: Finished difference Result 12125 states and 13929 transitions. [2018-12-30 23:27:50,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:27:50,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2018-12-30 23:27:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:27:50,209 INFO L225 Difference]: With dead ends: 12125 [2018-12-30 23:27:50,210 INFO L226 Difference]: Without dead ends: 7857 [2018-12-30 23:27:50,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:27:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7857 states. [2018-12-30 23:27:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7857 to 6063. [2018-12-30 23:27:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6063 states. [2018-12-30 23:27:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6063 states to 6063 states and 6978 transitions. [2018-12-30 23:27:50,342 INFO L78 Accepts]: Start accepts. Automaton has 6063 states and 6978 transitions. Word has length 576 [2018-12-30 23:27:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:27:50,343 INFO L480 AbstractCegarLoop]: Abstraction has 6063 states and 6978 transitions. [2018-12-30 23:27:50,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:27:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6063 states and 6978 transitions. [2018-12-30 23:27:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-12-30 23:27:50,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:27:50,354 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,354 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:27:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:27:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1723557820, now seen corresponding path program 1 times [2018-12-30 23:27:50,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:27:50,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:27:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:50,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:50,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:27:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:51,099 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-30 23:27:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 722 proven. 3 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-12-30 23:27:51,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:27:51,864 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:51,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:27:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:27:52,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:27:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2018-12-30 23:27:52,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:27:52,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-12-30 23:27:52,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:27:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:27:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:27:52,316 INFO L87 Difference]: Start difference. First operand 6063 states and 6978 transitions. Second operand 8 states. [2018-12-30 23:28:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:00,710 INFO L93 Difference]: Finished difference Result 17371 states and 19730 transitions. [2018-12-30 23:28:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 23:28:00,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 628 [2018-12-30 23:28:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:00,739 INFO L225 Difference]: With dead ends: 17371 [2018-12-30 23:28:00,739 INFO L226 Difference]: Without dead ends: 9949 [2018-12-30 23:28:00,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 633 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:28:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9949 states. [2018-12-30 23:28:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9949 to 8155. [2018-12-30 23:28:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8155 states. [2018-12-30 23:28:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8155 states to 8155 states and 8998 transitions. [2018-12-30 23:28:00,894 INFO L78 Accepts]: Start accepts. Automaton has 8155 states and 8998 transitions. Word has length 628 [2018-12-30 23:28:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:00,895 INFO L480 AbstractCegarLoop]: Abstraction has 8155 states and 8998 transitions. [2018-12-30 23:28:00,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:28:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8155 states and 8998 transitions. [2018-12-30 23:28:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2018-12-30 23:28:00,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:00,908 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,908 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -595355950, now seen corresponding path program 1 times [2018-12-30 23:28:00,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:00,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-12-30 23:28:01,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:28:01,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:28:01,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:28:01,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:28:01,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:28:01,511 INFO L87 Difference]: Start difference. First operand 8155 states and 8998 transitions. Second operand 5 states. [2018-12-30 23:28:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:04,736 INFO L93 Difference]: Finished difference Result 19862 states and 21642 transitions. [2018-12-30 23:28:04,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:28:04,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 670 [2018-12-30 23:28:04,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:04,749 INFO L225 Difference]: With dead ends: 19862 [2018-12-30 23:28:04,749 INFO L226 Difference]: Without dead ends: 7523 [2018-12-30 23:28:04,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:28:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7523 states. [2018-12-30 23:28:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7523 to 6020. [2018-12-30 23:28:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6020 states. [2018-12-30 23:28:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6020 states to 6020 states and 6215 transitions. [2018-12-30 23:28:04,840 INFO L78 Accepts]: Start accepts. Automaton has 6020 states and 6215 transitions. Word has length 670 [2018-12-30 23:28:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:04,841 INFO L480 AbstractCegarLoop]: Abstraction has 6020 states and 6215 transitions. [2018-12-30 23:28:04,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:28:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6020 states and 6215 transitions. [2018-12-30 23:28:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2018-12-30 23:28:04,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:04,853 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,853 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:04,854 INFO L82 PathProgramCache]: Analyzing trace with hash 314643271, now seen corresponding path program 1 times [2018-12-30 23:28:04,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:04,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:04,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:05,612 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:28:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 47 proven. 519 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-12-30 23:28:06,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:28:06,477 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:28:06,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:06,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:28:07,816 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (and (<= (mod v_prenex_1 299926) (+ c_~a0~0 300072)) (<= (+ v_prenex_1 44) 0) (<= 0 v_prenex_1))) (exists ((v_~a0~0_825 Int)) (let ((.cse0 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= .cse0 (+ c_~a0~0 300072)) (= .cse0 0)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (<= (+ v_prenex_2 44) 0) (< v_prenex_2 0) (<= .cse1 (+ c_~a0~0 599998)) (not (= .cse1 0)))))) is different from true [2018-12-30 23:28:10,620 WARN L181 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-12-30 23:28:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 347 trivial. 426 not checked. [2018-12-30 23:28:12,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:28:12,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-30 23:28:12,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:28:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:28:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-12-30 23:28:12,600 INFO L87 Difference]: Start difference. First operand 6020 states and 6215 transitions. Second operand 9 states. [2018-12-30 23:28:46,310 WARN L181 SmtUtils]: Spent 4.98 s on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-12-30 23:28:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:46,617 INFO L93 Difference]: Finished difference Result 14573 states and 15049 transitions. [2018-12-30 23:28:46,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:28:46,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 740 [2018-12-30 23:28:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:46,642 INFO L225 Difference]: With dead ends: 14573 [2018-12-30 23:28:46,643 INFO L226 Difference]: Without dead ends: 14571 [2018-12-30 23:28:46,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 737 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=42, Invalid=70, Unknown=2, NotChecked=18, Total=132 [2018-12-30 23:28:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14571 states. [2018-12-30 23:28:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14571 to 11871. [2018-12-30 23:28:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11871 states. [2018-12-30 23:28:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11871 states to 11871 states and 12263 transitions. [2018-12-30 23:28:46,817 INFO L78 Accepts]: Start accepts. Automaton has 11871 states and 12263 transitions. Word has length 740 [2018-12-30 23:28:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:46,820 INFO L480 AbstractCegarLoop]: Abstraction has 11871 states and 12263 transitions. [2018-12-30 23:28:46,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:28:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 11871 states and 12263 transitions. [2018-12-30 23:28:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2018-12-30 23:28:46,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:46,843 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,843 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1378656748, now seen corresponding path program 1 times [2018-12-30 23:28:46,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:46,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:47,377 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-12-30 23:28:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2018-12-30 23:28:47,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:28:47,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:28:47,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:28:47,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:28:47,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:28:47,674 INFO L87 Difference]: Start difference. First operand 11871 states and 12263 transitions. Second operand 3 states. [2018-12-30 23:28:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:48,894 INFO L93 Difference]: Finished difference Result 30622 states and 31642 transitions. [2018-12-30 23:28:48,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:28:48,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 798 [2018-12-30 23:28:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:48,927 INFO L225 Difference]: With dead ends: 30622 [2018-12-30 23:28:48,928 INFO L226 Difference]: Without dead ends: 19052 [2018-12-30 23:28:48,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:28:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19052 states. [2018-12-30 23:28:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19052 to 17548. [2018-12-30 23:28:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17548 states. [2018-12-30 23:28:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17548 states to 17548 states and 18064 transitions. [2018-12-30 23:28:49,168 INFO L78 Accepts]: Start accepts. Automaton has 17548 states and 18064 transitions. Word has length 798 [2018-12-30 23:28:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:49,170 INFO L480 AbstractCegarLoop]: Abstraction has 17548 states and 18064 transitions. [2018-12-30 23:28:49,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:28:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 17548 states and 18064 transitions. [2018-12-30 23:28:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2018-12-30 23:28:49,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:49,191 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:28:49,191 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1871532666, now seen corresponding path program 1 times [2018-12-30 23:28:49,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:49,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:49,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 877 proven. 24 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-12-30 23:28:50,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:28:50,203 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:28:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:28:50,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:28:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 964 proven. 76 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-30 23:28:51,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:28:51,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-12-30 23:28:51,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:28:51,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:28:51,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:28:51,307 INFO L87 Difference]: Start difference. First operand 17548 states and 18064 transitions. Second operand 9 states. [2018-12-30 23:28:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:28:58,967 INFO L93 Difference]: Finished difference Result 39893 states and 41094 transitions. [2018-12-30 23:28:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 23:28:58,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 818 [2018-12-30 23:28:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:28:58,996 INFO L225 Difference]: With dead ends: 39893 [2018-12-30 23:28:58,996 INFO L226 Difference]: Without dead ends: 22646 [2018-12-30 23:28:59,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 821 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:28:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22646 states. [2018-12-30 23:28:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22646 to 18743. [2018-12-30 23:28:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18743 states. [2018-12-30 23:28:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18743 states to 18743 states and 19221 transitions. [2018-12-30 23:28:59,285 INFO L78 Accepts]: Start accepts. Automaton has 18743 states and 19221 transitions. Word has length 818 [2018-12-30 23:28:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:28:59,285 INFO L480 AbstractCegarLoop]: Abstraction has 18743 states and 19221 transitions. [2018-12-30 23:28:59,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:28:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 18743 states and 19221 transitions. [2018-12-30 23:28:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2018-12-30 23:28:59,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:28:59,304 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,310 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:28:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:28:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash 123722054, now seen corresponding path program 1 times [2018-12-30 23:28:59,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:28:59,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:28:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:59,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:28:59,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:28:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-12-30 23:29:00,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:29:00,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:29:00,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:29:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:29:00,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:29:00,159 INFO L87 Difference]: Start difference. First operand 18743 states and 19221 transitions. Second operand 3 states. [2018-12-30 23:29:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:02,030 INFO L93 Difference]: Finished difference Result 32839 states and 33699 transitions. [2018-12-30 23:29:02,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:29:02,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 825 [2018-12-30 23:29:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:02,051 INFO L225 Difference]: With dead ends: 32839 [2018-12-30 23:29:02,051 INFO L226 Difference]: Without dead ends: 18440 [2018-12-30 23:29:02,062 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:29:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18440 states. [2018-12-30 23:29:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18440 to 17543. [2018-12-30 23:29:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17543 states. [2018-12-30 23:29:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17543 states to 17543 states and 17900 transitions. [2018-12-30 23:29:02,280 INFO L78 Accepts]: Start accepts. Automaton has 17543 states and 17900 transitions. Word has length 825 [2018-12-30 23:29:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:02,281 INFO L480 AbstractCegarLoop]: Abstraction has 17543 states and 17900 transitions. [2018-12-30 23:29:02,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:29:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17543 states and 17900 transitions. [2018-12-30 23:29:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2018-12-30 23:29:02,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:02,301 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:02,302 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash -129772563, now seen corresponding path program 1 times [2018-12-30 23:29:02,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:02,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-12-30 23:29:03,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:29:03,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:29:03,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:29:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:29:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:29:03,056 INFO L87 Difference]: Start difference. First operand 17543 states and 17900 transitions. Second operand 4 states. [2018-12-30 23:29:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:29:04,783 INFO L93 Difference]: Finished difference Result 34790 states and 35503 transitions. [2018-12-30 23:29:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:29:04,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 829 [2018-12-30 23:29:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:29:04,800 INFO L225 Difference]: With dead ends: 34790 [2018-12-30 23:29:04,801 INFO L226 Difference]: Without dead ends: 17548 [2018-12-30 23:29:04,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:29:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17548 states. [2018-12-30 23:29:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17548 to 17244. [2018-12-30 23:29:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17244 states. [2018-12-30 23:29:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17244 states to 17244 states and 17546 transitions. [2018-12-30 23:29:04,997 INFO L78 Accepts]: Start accepts. Automaton has 17244 states and 17546 transitions. Word has length 829 [2018-12-30 23:29:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:29:04,998 INFO L480 AbstractCegarLoop]: Abstraction has 17244 states and 17546 transitions. [2018-12-30 23:29:04,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:29:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17244 states and 17546 transitions. [2018-12-30 23:29:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-12-30 23:29:05,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:29:05,011 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2018-12-30 23:29:05,012 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:29:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:29:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1335154196, now seen corresponding path program 1 times [2018-12-30 23:29:05,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:29:05,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:29:05,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:05,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:05,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:29:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:05,975 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-12-30 23:29:06,458 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2018-12-30 23:29:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 792 proven. 106 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-12-30 23:29:07,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:29:07,915 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:29:07,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:29:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:29:08,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:29:08,463 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2018-12-30 23:29:08,931 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 [2018-12-30 23:29:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-12-30 23:29:11,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:29:11,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-12-30 23:29:11,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 23:29:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 23:29:11,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:29:11,202 INFO L87 Difference]: Start difference. First operand 17244 states and 17546 transitions. Second operand 12 states. [2018-12-30 23:34:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:34:46,518 INFO L93 Difference]: Finished difference Result 44975 states and 45772 transitions. [2018-12-30 23:34:46,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:34:46,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 830 [2018-12-30 23:34:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:34:46,543 INFO L225 Difference]: With dead ends: 44975 [2018-12-30 23:34:46,543 INFO L226 Difference]: Without dead ends: 28032 [2018-12-30 23:34:46,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 833 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-12-30 23:34:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28032 states. [2018-12-30 23:34:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28032 to 17843. [2018-12-30 23:34:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17843 states. [2018-12-30 23:34:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17843 states to 17843 states and 18145 transitions. [2018-12-30 23:34:46,782 INFO L78 Accepts]: Start accepts. Automaton has 17843 states and 18145 transitions. Word has length 830 [2018-12-30 23:34:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:34:46,783 INFO L480 AbstractCegarLoop]: Abstraction has 17843 states and 18145 transitions. [2018-12-30 23:34:46,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 23:34:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17843 states and 18145 transitions. [2018-12-30 23:34:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2018-12-30 23:34:46,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:34:46,799 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:34:46,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:34:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:34:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash 674248504, now seen corresponding path program 1 times [2018-12-30 23:34:46,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:34:46,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:34:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:34:46,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:34:46,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:34:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:34:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 1148 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-30 23:34:47,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:34:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:34:47,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:34:47,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:34:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:34:47,670 INFO L87 Difference]: Start difference. First operand 17843 states and 18145 transitions. Second operand 4 states. [2018-12-30 23:34:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:34:49,555 INFO L93 Difference]: Finished difference Result 38390 states and 39042 transitions. [2018-12-30 23:34:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:34:49,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 906 [2018-12-30 23:34:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:34:49,578 INFO L225 Difference]: With dead ends: 38390 [2018-12-30 23:34:49,578 INFO L226 Difference]: Without dead ends: 21147 [2018-12-30 23:34:49,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:34:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21147 states. [2018-12-30 23:34:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21147 to 16938. [2018-12-30 23:34:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2018-12-30 23:34:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 17196 transitions. [2018-12-30 23:34:49,785 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 17196 transitions. Word has length 906 [2018-12-30 23:34:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:34:49,786 INFO L480 AbstractCegarLoop]: Abstraction has 16938 states and 17196 transitions. [2018-12-30 23:34:49,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:34:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 17196 transitions. [2018-12-30 23:34:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2018-12-30 23:34:49,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:34:49,799 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:49,799 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:34:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:34:49,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1708390119, now seen corresponding path program 1 times [2018-12-30 23:34:49,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:34:49,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:34:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:34:49,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:34:49,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:34:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:34:50,580 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:34:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 94 proven. 909 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2018-12-30 23:34:52,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:34:52,610 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:34:52,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:34:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:34:52,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:34:54,099 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_25 Int)) (let ((.cse0 (mod v_prenex_25 299926))) (and (not (= 0 .cse0)) (< v_prenex_25 0) (<= .cse0 (+ c_~a0~0 600001)) (<= (+ v_prenex_25 44) 0)))) (exists ((v_prenex_26 Int)) (let ((.cse1 (mod v_prenex_26 299926))) (and (<= (+ v_prenex_26 44) 0) (<= .cse1 (+ c_~a0~0 300075)) (= 0 .cse1)))) (exists ((v_~a0~0_829 Int)) (and (<= (mod v_~a0~0_829 299926) (+ c_~a0~0 300075)) (<= 0 v_~a0~0_829) (<= (+ v_~a0~0_829 44) 0)))) is different from true [2018-12-30 23:34:55,351 WARN L181 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-12-30 23:34:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 602 trivial. 863 not checked. [2018-12-30 23:34:59,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:34:59,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-30 23:34:59,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:34:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:34:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-12-30 23:34:59,222 INFO L87 Difference]: Start difference. First operand 16938 states and 17196 transitions. Second operand 9 states. [2018-12-30 23:35:27,051 WARN L181 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2018-12-30 23:35:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:27,350 INFO L93 Difference]: Finished difference Result 29535 states and 29987 transitions. [2018-12-30 23:35:27,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:35:27,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 957 [2018-12-30 23:35:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:27,374 INFO L225 Difference]: With dead ends: 29535 [2018-12-30 23:35:27,374 INFO L226 Difference]: Without dead ends: 29533 [2018-12-30 23:35:27,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 954 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=42, Invalid=70, Unknown=2, NotChecked=18, Total=132 [2018-12-30 23:35:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29533 states. [2018-12-30 23:35:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29533 to 17059. [2018-12-30 23:35:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17059 states. [2018-12-30 23:35:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17059 states to 17059 states and 17318 transitions. [2018-12-30 23:35:27,594 INFO L78 Accepts]: Start accepts. Automaton has 17059 states and 17318 transitions. Word has length 957 [2018-12-30 23:35:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:27,595 INFO L480 AbstractCegarLoop]: Abstraction has 17059 states and 17318 transitions. [2018-12-30 23:35:27,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:35:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17059 states and 17318 transitions. [2018-12-30 23:35:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2018-12-30 23:35:27,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:27,612 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:27,612 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash -690998195, now seen corresponding path program 1 times [2018-12-30 23:35:27,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:28,527 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:35:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 94 proven. 1121 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2018-12-30 23:35:30,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:35:30,771 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:35:30,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:31,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:35:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 730 proven. 569 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2018-12-30 23:35:33,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:35:33,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-30 23:35:33,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:35:33,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:35:33,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:35:33,362 INFO L87 Difference]: Start difference. First operand 17059 states and 17318 transitions. Second operand 8 states. [2018-12-30 23:35:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:38,565 INFO L93 Difference]: Finished difference Result 37150 states and 37713 transitions. [2018-12-30 23:35:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:35:38,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1127 [2018-12-30 23:35:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:38,586 INFO L225 Difference]: With dead ends: 37150 [2018-12-30 23:35:38,586 INFO L226 Difference]: Without dead ends: 24253 [2018-12-30 23:35:38,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1133 GetRequests, 1123 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:35:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24253 states. [2018-12-30 23:35:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24253 to 12596. [2018-12-30 23:35:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12596 states. [2018-12-30 23:35:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12596 states to 12596 states and 12792 transitions. [2018-12-30 23:35:38,780 INFO L78 Accepts]: Start accepts. Automaton has 12596 states and 12792 transitions. Word has length 1127 [2018-12-30 23:35:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:38,781 INFO L480 AbstractCegarLoop]: Abstraction has 12596 states and 12792 transitions. [2018-12-30 23:35:38,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:35:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 12596 states and 12792 transitions. [2018-12-30 23:35:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1170 [2018-12-30 23:35:38,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:38,797 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:35:38,797 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1077296659, now seen corresponding path program 1 times [2018-12-30 23:35:38,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:38,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:38,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:39,646 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2018-12-30 23:35:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 786 proven. 629 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2018-12-30 23:35:41,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:35:41,946 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:35:41,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:42,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:35:42,583 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 14 [2018-12-30 23:35:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 833 proven. 0 refuted. 0 times theorem prover too weak. 1360 trivial. 0 not checked. [2018-12-30 23:35:43,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:35:44,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-12-30 23:35:44,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:35:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:35:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:35:44,001 INFO L87 Difference]: Start difference. First operand 12596 states and 12792 transitions. Second operand 7 states. [2018-12-30 23:35:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:49,728 INFO L93 Difference]: Finished difference Result 32695 states and 33203 transitions. [2018-12-30 23:35:49,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:35:49,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1169 [2018-12-30 23:35:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:49,747 INFO L225 Difference]: With dead ends: 32695 [2018-12-30 23:35:49,747 INFO L226 Difference]: Without dead ends: 20400 [2018-12-30 23:35:49,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:35:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20400 states. [2018-12-30 23:35:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20400 to 12298. [2018-12-30 23:35:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12298 states. [2018-12-30 23:35:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12298 states to 12298 states and 12480 transitions. [2018-12-30 23:35:49,922 INFO L78 Accepts]: Start accepts. Automaton has 12298 states and 12480 transitions. Word has length 1169 [2018-12-30 23:35:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:49,923 INFO L480 AbstractCegarLoop]: Abstraction has 12298 states and 12480 transitions. [2018-12-30 23:35:49,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:35:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12298 states and 12480 transitions. [2018-12-30 23:35:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1367 [2018-12-30 23:35:49,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:49,945 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:35:49,946 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:49,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1172605738, now seen corresponding path program 1 times [2018-12-30 23:35:49,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:49,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:49,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:49,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:49,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:50,731 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:35:51,352 WARN L181 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-12-30 23:35:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3874 backedges. 2936 proven. 264 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2018-12-30 23:35:53,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:35:53,249 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:35:53,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:53,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:35:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3874 backedges. 2981 proven. 87 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-12-30 23:35:55,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:35:55,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2018-12-30 23:35:55,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-30 23:35:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-30 23:35:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-30 23:35:55,111 INFO L87 Difference]: Start difference. First operand 12298 states and 12480 transitions. Second operand 13 states. [2018-12-30 23:36:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:01,398 INFO L93 Difference]: Finished difference Result 24488 states and 24853 transitions. [2018-12-30 23:36:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-30 23:36:01,399 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1366 [2018-12-30 23:36:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:01,410 INFO L225 Difference]: With dead ends: 24488 [2018-12-30 23:36:01,410 INFO L226 Difference]: Without dead ends: 14285 [2018-12-30 23:36:01,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1410 GetRequests, 1379 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2018-12-30 23:36:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14285 states. [2018-12-30 23:36:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14285 to 13197. [2018-12-30 23:36:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13197 states. [2018-12-30 23:36:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13197 states to 13197 states and 13386 transitions. [2018-12-30 23:36:01,557 INFO L78 Accepts]: Start accepts. Automaton has 13197 states and 13386 transitions. Word has length 1366 [2018-12-30 23:36:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:01,558 INFO L480 AbstractCegarLoop]: Abstraction has 13197 states and 13386 transitions. [2018-12-30 23:36:01,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-30 23:36:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 13197 states and 13386 transitions. [2018-12-30 23:36:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2018-12-30 23:36:01,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:01,581 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:01,582 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1545903027, now seen corresponding path program 1 times [2018-12-30 23:36:01,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:01,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:01,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3956 backedges. 2161 proven. 843 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2018-12-30 23:36:04,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:36:04,679 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:36:04,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:05,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:36:05,223 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 19 [2018-12-30 23:36:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3956 backedges. 2161 proven. 843 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2018-12-30 23:36:10,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:36:10,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-12-30 23:36:10,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:36:10,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:36:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:36:10,237 INFO L87 Difference]: Start difference. First operand 13197 states and 13386 transitions. Second operand 7 states. [2018-12-30 23:36:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:16,718 INFO L93 Difference]: Finished difference Result 21889 states and 22203 transitions. [2018-12-30 23:36:16,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:36:16,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1378 [2018-12-30 23:36:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:16,735 INFO L225 Difference]: With dead ends: 21889 [2018-12-30 23:36:16,735 INFO L226 Difference]: Without dead ends: 21887 [2018-12-30 23:36:16,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1376 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:36:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21887 states. [2018-12-30 23:36:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21887 to 14393. [2018-12-30 23:36:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14393 states. [2018-12-30 23:36:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14393 states to 14393 states and 14599 transitions. [2018-12-30 23:36:16,935 INFO L78 Accepts]: Start accepts. Automaton has 14393 states and 14599 transitions. Word has length 1378 [2018-12-30 23:36:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:16,936 INFO L480 AbstractCegarLoop]: Abstraction has 14393 states and 14599 transitions. [2018-12-30 23:36:16,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:36:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14393 states and 14599 transitions. [2018-12-30 23:36:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1452 [2018-12-30 23:36:16,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:16,956 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, 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, 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, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,956 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:16,958 INFO L82 PathProgramCache]: Analyzing trace with hash 351071971, now seen corresponding path program 1 times [2018-12-30 23:36:16,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:16,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:16,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:16,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:16,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:17,742 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:36:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3776 backedges. 1664 proven. 335 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-12-30 23:36:19,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:36:19,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:36:19,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:19,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:36:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3776 backedges. 1731 proven. 0 refuted. 0 times theorem prover too weak. 2045 trivial. 0 not checked. [2018-12-30 23:36:20,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:36:20,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 23:36:20,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:36:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:36:20,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:36:20,453 INFO L87 Difference]: Start difference. First operand 14393 states and 14599 transitions. Second operand 9 states. [2018-12-30 23:36:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:24,097 INFO L93 Difference]: Finished difference Result 29526 states and 29948 transitions. [2018-12-30 23:36:24,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:36:24,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1451 [2018-12-30 23:36:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:24,111 INFO L225 Difference]: With dead ends: 29526 [2018-12-30 23:36:24,111 INFO L226 Difference]: Without dead ends: 15733 [2018-12-30 23:36:24,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1470 GetRequests, 1455 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:36:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15733 states. [2018-12-30 23:36:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15733 to 13496. [2018-12-30 23:36:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13496 states. [2018-12-30 23:36:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 13683 transitions. [2018-12-30 23:36:24,295 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 13683 transitions. Word has length 1451 [2018-12-30 23:36:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:24,296 INFO L480 AbstractCegarLoop]: Abstraction has 13496 states and 13683 transitions. [2018-12-30 23:36:24,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:36:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 13683 transitions. [2018-12-30 23:36:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1592 [2018-12-30 23:36:24,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:24,398 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, 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, 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, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:36:24,398 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1675721414, now seen corresponding path program 1 times [2018-12-30 23:36:24,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:24,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:24,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:24,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:24,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:25,156 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-12-30 23:36:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5316 backedges. 4035 proven. 0 refuted. 0 times theorem prover too weak. 1281 trivial. 0 not checked. [2018-12-30 23:36:26,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:36:26,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:36:26,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:36:26,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:36:26,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:36:26,985 INFO L87 Difference]: Start difference. First operand 13496 states and 13683 transitions. Second operand 5 states. [2018-12-30 23:36:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:29,594 INFO L93 Difference]: Finished difference Result 26109 states and 26476 transitions. [2018-12-30 23:36:29,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:36:29,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1591 [2018-12-30 23:36:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:29,601 INFO L225 Difference]: With dead ends: 26109 [2018-12-30 23:36:29,602 INFO L226 Difference]: Without dead ends: 5099 [2018-12-30 23:36:29,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:36:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5099 states. [2018-12-30 23:36:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5099 to 4491. [2018-12-30 23:36:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2018-12-30 23:36:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 4516 transitions. [2018-12-30 23:36:29,680 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 4516 transitions. Word has length 1591 [2018-12-30 23:36:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:29,681 INFO L480 AbstractCegarLoop]: Abstraction has 4491 states and 4516 transitions. [2018-12-30 23:36:29,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:36:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 4516 transitions. [2018-12-30 23:36:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1790 [2018-12-30 23:36:29,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:29,753 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 1] [2018-12-30 23:36:29,753 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1413703160, now seen corresponding path program 1 times [2018-12-30 23:36:29,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:29,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:29,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6174 backedges. 4041 proven. 0 refuted. 0 times theorem prover too weak. 2133 trivial. 0 not checked. [2018-12-30 23:36:31,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:36:31,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:36:31,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:36:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:36:31,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:36:31,514 INFO L87 Difference]: Start difference. First operand 4491 states and 4516 transitions. Second operand 3 states. [2018-12-30 23:36:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:32,491 INFO L93 Difference]: Finished difference Result 7784 states and 7827 transitions. [2018-12-30 23:36:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:36:32,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1789 [2018-12-30 23:36:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:32,495 INFO L225 Difference]: With dead ends: 7784 [2018-12-30 23:36:32,495 INFO L226 Difference]: Without dead ends: 4491 [2018-12-30 23:36:32,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:36:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2018-12-30 23:36:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4491. [2018-12-30 23:36:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2018-12-30 23:36:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 4514 transitions. [2018-12-30 23:36:32,547 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 4514 transitions. Word has length 1789 [2018-12-30 23:36:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:32,548 INFO L480 AbstractCegarLoop]: Abstraction has 4491 states and 4514 transitions. [2018-12-30 23:36:32,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:36:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 4514 transitions. [2018-12-30 23:36:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1886 [2018-12-30 23:36:32,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:32,569 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 1] [2018-12-30 23:36:32,569 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:32,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:32,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1314169253, now seen corresponding path program 1 times [2018-12-30 23:36:32,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:32,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:32,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:32,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6447 backedges. 3508 proven. 843 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-12-30 23:36:35,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:36:35,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:36:35,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:35,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:36:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6447 backedges. 3995 proven. 440 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2018-12-30 23:36:40,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:36:40,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-30 23:36:40,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:36:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:36:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:36:40,102 INFO L87 Difference]: Start difference. First operand 4491 states and 4514 transitions. Second operand 9 states. [2018-12-30 23:36:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:44,623 INFO L93 Difference]: Finished difference Result 4790 states and 4815 transitions. [2018-12-30 23:36:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:36:44,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1885 [2018-12-30 23:36:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:44,626 INFO L225 Difference]: With dead ends: 4790 [2018-12-30 23:36:44,626 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:36:44,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1894 GetRequests, 1885 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:36:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:36:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:36:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:36:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:36:44,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1885 [2018-12-30 23:36:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:44,630 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:36:44,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:36:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:36:44,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:36:44,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:36:44,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:45,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:45,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:45,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:45,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:46,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:46,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:46,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:47,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:47,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:48,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:48,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:48,938 WARN L181 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 1164 DAG size of output: 1047 [2018-12-30 23:36:48,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:49,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:49,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:49,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:49,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:49,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:49,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:49,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:50,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:50,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:50,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:51,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:51,928 WARN L181 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 1161 DAG size of output: 1046 [2018-12-30 23:36:52,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:36:52,947 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 843 DAG size of output: 771 [2018-12-30 23:37:55,152 WARN L181 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 1014 DAG size of output: 223 [2018-12-30 23:38:56,902 WARN L181 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 1014 DAG size of output: 225 [2018-12-30 23:39:35,098 WARN L181 SmtUtils]: Spent 38.19 s on a formula simplification. DAG size of input: 746 DAG size of output: 204 [2018-12-30 23:39:35,102 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,102 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,102 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,102 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,102 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,103 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,104 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,105 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,106 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,107 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,108 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:39:35,109 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:39:35,110 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2018-12-30 23:39:35,111 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,112 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2018-12-30 23:39:35,113 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,114 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,115 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,116 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,117 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,118 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,119 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,120 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,121 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse37 (+ ~a0~0 98)) (.cse31 (+ ~a29~0 16)) (.cse36 (+ ~a4~0 86))) (let ((.cse18 (<= .cse36 0)) (.cse10 (= ~a2~0 4)) (.cse0 (< 0 .cse31)) (.cse4 (<= (+ ~a0~0 147) 0)) (.cse35 (+ ~a29~0 144)) (.cse28 (< 0 .cse37))) (let ((.cse6 (= ~a2~0 1)) (.cse14 (= ~a2~0 3)) (.cse7 (<= .cse37 0)) (.cse25 (<= 0 (+ ~a0~0 146))) (.cse3 (= ~a2~0 2)) (.cse26 (or .cse0 (< 0 .cse36) .cse4 (<= .cse35 0) .cse28)) (.cse34 (and .cse18 (not .cse10))) (.cse19 (<= 3 ~a2~0))) (let ((.cse16 (and .cse34 .cse19)) (.cse5 (<= 44 ~a29~0)) (.cse29 (= ~a2~0 5)) (.cse22 (<= ~a0~0 599970)) (.cse24 (and .cse3 .cse34 .cse26)) (.cse23 (<= 0 (+ ~a29~0 15))) (.cse30 (and .cse7 .cse25 .cse3 .cse26)) (.cse9 (<= ~a29~0 41)) (.cse15 (<= 0 (+ ~a0~0 570979))) (.cse27 (< 0 .cse35)) (.cse13 (< 43 ~a29~0)) (.cse2 (and .cse10 .cse26 .cse18)) (.cse20 (and .cse14 .cse34 .cse26)) (.cse12 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse32 (and .cse18 .cse6)) (.cse1 (<= ~a29~0 43)) (.cse21 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and (and .cse5 .cse6 (<= 0 (+ ~a0~0 384412))) .cse7) (and (exists ((v_prenex_19 Int)) (let ((.cse8 (* 10 v_prenex_19))) (and (not (= 0 (mod (+ v_prenex_19 8) 9))) (<= (+ (div (+ .cse8 (- 3298780)) 9) 1) ~a0~0) (< .cse8 3298780) (< 0 (+ v_prenex_19 147))))) .cse9 .cse10 .cse4) (let ((.cse11 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse11) .cse12 (<= 0 (+ ~a29~0 127)) .cse6 (<= .cse11 0) (<= (+ (div (+ (* 9 ~a29~0) 2) 10) 115) 0))) (and (and (or (and (<= 0 (+ ~a0~0 300116)) .cse10) (and (exists ((v_~a29~0_894 Int)) (and (<= (+ (mod v_~a29~0_894 299978) 300022) ~a29~0) (< 43 v_~a29~0_894) (<= 0 v_~a29~0_894))) .cse10)) .cse4) .cse13) (and .cse14 (and (and .cse4 .cse1) .cse15)) (and .cse7 .cse16) (and .cse9 (exists ((v_~a0~0_834 Int)) (let ((.cse17 (+ v_~a0~0_834 600067))) (and (<= (div .cse17 5) ~a0~0) (<= 0 .cse17) (<= 0 (+ v_~a0~0_834 570979))))) .cse18 (not (= 3 ~a2~0)) .cse19 (<= ~a2~0 4)) (and .cse3 .cse4 .cse15) (and .cse20 .cse21) (and .cse22 .cse20 .cse13) (and .cse23 .cse24 (or (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse21)) (and (and .cse7 .cse6 .cse25) .cse26) (and .cse9 .cse21 .cse6 .cse27 .cse28) (and .cse22 (and .cse29 .cse16) .cse13) (and .cse22 (and .cse9 .cse20)) (and .cse9 (and .cse29 .cse0 .cse16)) (and .cse22 .cse9 .cse6 .cse0) (and .cse5 .cse30) (and .cse29 .cse7) (and .cse22 .cse24 (<= .cse31 0)) (and .cse24 .cse13) (and .cse9 .cse23 .cse30) (and .cse7 .cse25 .cse14) (and (<= (+ ~a0~0 104) 0) (and .cse32 .cse26)) (and .cse9 .cse4 .cse15 .cse6 .cse27) (and (and .cse7 .cse10 .cse25) .cse13) (and .cse21 .cse2) (and .cse20 (<= (+ ~a29~0 145) 0) .cse12) (and (exists ((v_prenex_77 Int)) (let ((.cse33 (+ (* 10 (div v_prenex_77 5)) 3459790))) (and (<= 0 .cse33) (<= v_prenex_77 599970) (<= (div .cse33 (- 9)) ~a0~0) (= 0 (mod v_prenex_77 5))))) .cse4 .cse14) (and (and (and .cse32 .cse1) .cse26) .cse21)))))) [2018-12-30 23:39:35,121 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:39:35,121 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:39:35,121 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,122 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,123 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:39:35,124 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2018-12-30 23:39:35,124 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,124 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,124 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,124 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,124 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,124 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,125 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse38 (+ ~a4~0 86)) (.cse37 (+ ~a0~0 98)) (.cse36 (+ ~a29~0 144)) (.cse12 (+ ~a29~0 16))) (let ((.cse2 (< 0 .cse12)) (.cse6 (<= (+ ~a0~0 147) 0)) (.cse29 (<= .cse36 0)) (.cse31 (< 0 .cse37)) (.cse10 (<= .cse38 0)) (.cse8 (= ~a2~0 4))) (let ((.cse35 (and .cse10 (not .cse8))) (.cse33 (or .cse2 (< 0 .cse38) .cse6 .cse29 .cse31)) (.cse28 (= ~a2~0 3)) (.cse21 (= ~a2~0 1))) (let ((.cse15 (<= .cse37 0)) (.cse23 (<= 0 (+ ~a0~0 146))) (.cse24 (= ~a2~0 2)) (.cse27 (<= ~a29~0 43)) (.cse11 (<= 3 ~a2~0)) (.cse32 (and .cse10 .cse21)) (.cse1 (<= ~a29~0 41)) (.cse30 (and (and .cse35 .cse33) .cse28))) (let ((.cse17 (and .cse1 .cse30)) (.cse14 (<= 0 (+ ~a0~0 570979))) (.cse25 (and .cse32 .cse33)) (.cse0 (<= ~a0~0 599970)) (.cse26 (= ~a2~0 5)) (.cse16 (and .cse35 .cse11)) (.cse3 (and .cse21 .cse27 (< 0 .cse36))) (.cse19 (and .cse8 .cse33 .cse10)) (.cse13 (or (and .cse24 .cse35 (not (= 2 ULTIMATE.start_calculate_output_~input))) (and .cse24 .cse35 .cse33))) (.cse5 (< 43 ~a29~0)) (.cse4 (and .cse15 .cse24 .cse23)) (.cse18 (<= (+ ~a0~0 61) 0))) (or (and .cse0 (and .cse1 .cse2 .cse3)) (and .cse4 .cse5) (and .cse1 .cse6 (exists ((v_prenex_19 Int)) (let ((.cse7 (* 10 v_prenex_19))) (and (not (= 0 (mod (+ v_prenex_19 8) 9))) (<= (+ (div (+ .cse7 (- 3298780)) 9) 1) ~a0~0) (< .cse7 3298780) (< 0 (+ v_prenex_19 147))))) .cse8) (and .cse1 (exists ((v_~a0~0_834 Int)) (let ((.cse9 (+ v_~a0~0_834 600067))) (and (<= (div .cse9 5) ~a0~0) (<= 0 .cse9) (<= 0 (+ v_~a0~0_834 570979))))) .cse10 (not (= 3 ~a2~0)) .cse11 (<= ~a2~0 4)) (and .cse0 (<= .cse12 0) .cse13) (and .cse1 .cse6 .cse14 .cse3) (and .cse15 .cse16) (and .cse17 (<= (+ ~a29~0 145) 0)) (and (<= 0 (+ ~a29~0 15)) .cse13 (or (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse18)) (and (and (or (and (<= 0 (+ ~a0~0 300116)) .cse8) (and (exists ((v_~a29~0_894 Int)) (and (<= (+ (mod v_~a29~0_894 299978) 300022) ~a29~0) (< 43 v_~a29~0_894) (<= 0 v_~a29~0_894))) .cse8)) .cse6) .cse5) (and .cse19 .cse18) (and (exists ((v_prenex_25 Int)) (let ((.cse20 (mod v_prenex_25 299926))) (and (not (= 0 .cse20)) (< v_prenex_25 0) (<= .cse20 (+ ~a0~0 600001)) (<= (+ v_prenex_25 44) 0)))) (<= 44 ~a29~0) (<= 0 (+ ~a0~0 384412)) .cse6 .cse21) (let ((.cse22 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse22) (<= 0 (+ ~a29~0 127)) .cse21 (<= .cse22 0) (<= (+ (div (+ (* 9 ~a29~0) 2) 10) 115) 0))) (and (and .cse15 .cse8 .cse23) .cse5) (and .cse24 .cse6 .cse14) (and .cse25 (<= (+ ~a0~0 104) 0)) (and .cse0 .cse17) (and .cse0 (and (and .cse26 .cse16) .cse5)) (and (and .cse6 .cse27 .cse28) .cse14) (and .cse25 .cse29) (and .cse15 .cse26) (and .cse0 (and .cse30 .cse5)) (and .cse1 (and .cse26 .cse2 .cse16)) (and .cse1 .cse3 .cse18 .cse31) (and .cse2 .cse27 .cse19) (and .cse15 .cse23 .cse28) (and (and (and .cse32 .cse27) .cse33) .cse18) (and .cse13 .cse5) (and .cse2 .cse24 .cse6) (and .cse1 .cse2 .cse4) (and .cse33 (and .cse15 .cse23 .cse21)) (and .cse30 .cse18) (and (exists ((v_prenex_77 Int)) (let ((.cse34 (+ (* 10 (div v_prenex_77 5)) 3459790))) (and (<= 0 .cse34) (<= v_prenex_77 599970) (<= (div .cse34 (- 9)) ~a0~0) (= 0 (mod v_prenex_77 5))))) .cse6 .cse28))))))) [2018-12-30 23:39:35,125 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,125 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:39:35,125 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:39:35,125 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,125 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,125 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,126 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:39:35,127 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:39:35,128 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,129 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,130 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,131 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,131 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,131 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,131 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse38 (+ ~a4~0 86)) (.cse37 (+ ~a0~0 98)) (.cse36 (+ ~a29~0 144)) (.cse12 (+ ~a29~0 16))) (let ((.cse2 (< 0 .cse12)) (.cse6 (<= (+ ~a0~0 147) 0)) (.cse29 (<= .cse36 0)) (.cse31 (< 0 .cse37)) (.cse10 (<= .cse38 0)) (.cse8 (= ~a2~0 4))) (let ((.cse35 (and .cse10 (not .cse8))) (.cse33 (or .cse2 (< 0 .cse38) .cse6 .cse29 .cse31)) (.cse28 (= ~a2~0 3)) (.cse21 (= ~a2~0 1))) (let ((.cse15 (<= .cse37 0)) (.cse22 (<= 0 (+ ~a0~0 146))) (.cse23 (= ~a2~0 2)) (.cse27 (<= ~a29~0 43)) (.cse11 (<= 3 ~a2~0)) (.cse32 (and .cse10 .cse21)) (.cse1 (<= ~a29~0 41)) (.cse30 (and (and .cse35 .cse33) .cse28))) (let ((.cse17 (and .cse1 .cse30)) (.cse14 (<= 0 (+ ~a0~0 570979))) (.cse24 (and .cse32 .cse33)) (.cse0 (<= ~a0~0 599970)) (.cse26 (= ~a2~0 5)) (.cse16 (and .cse35 .cse11)) (.cse3 (and .cse21 .cse27 (< 0 .cse36))) (.cse19 (and .cse8 .cse33 .cse10)) (.cse13 (or (and .cse23 .cse35 (not (= 2 ULTIMATE.start_calculate_output_~input))) (and .cse23 .cse35 .cse33))) (.cse5 (< 43 ~a29~0)) (.cse4 (and .cse15 .cse23 .cse22)) (.cse18 (<= (+ ~a0~0 61) 0))) (or (and .cse0 (and .cse1 .cse2 .cse3)) (and .cse4 .cse5) (and .cse1 .cse6 (exists ((v_prenex_19 Int)) (let ((.cse7 (* 10 v_prenex_19))) (and (not (= 0 (mod (+ v_prenex_19 8) 9))) (<= (+ (div (+ .cse7 (- 3298780)) 9) 1) ~a0~0) (< .cse7 3298780) (< 0 (+ v_prenex_19 147))))) .cse8) (and .cse1 (exists ((v_~a0~0_834 Int)) (let ((.cse9 (+ v_~a0~0_834 600067))) (and (<= (div .cse9 5) ~a0~0) (<= 0 .cse9) (<= 0 (+ v_~a0~0_834 570979))))) .cse10 (not (= 3 ~a2~0)) .cse11 (<= ~a2~0 4)) (and .cse0 (<= .cse12 0) .cse13) (and .cse1 .cse6 .cse14 .cse3) (and .cse15 .cse16) (and .cse17 (<= (+ ~a29~0 145) 0)) (and (<= 0 (+ ~a29~0 15)) .cse13 (or (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse18)) (and (and (or (and (<= 0 (+ ~a0~0 300116)) .cse8) (and (exists ((v_~a29~0_894 Int)) (and (<= (+ (mod v_~a29~0_894 299978) 300022) ~a29~0) (< 43 v_~a29~0_894) (<= 0 v_~a29~0_894))) .cse8)) .cse6) .cse5) (and .cse19 .cse18) (and (exists ((v_prenex_25 Int)) (let ((.cse20 (mod v_prenex_25 299926))) (and (not (= 0 .cse20)) (< v_prenex_25 0) (<= .cse20 (+ ~a0~0 600001)) (<= (+ v_prenex_25 44) 0)))) (<= 44 ~a29~0) (<= 0 (+ ~a0~0 384412)) .cse6 .cse21) (and (and .cse15 .cse8 .cse22) .cse5) (and .cse23 .cse6 .cse14) (and .cse24 (<= (+ ~a0~0 104) 0)) (let ((.cse25 (+ ~a0~0 44))) (and (<= (+ ~a4~0 89) 0) (<= 0 .cse25) (not (= 1 ULTIMATE.start_calculate_output_~input)) (<= 0 (+ ~a29~0 127)) .cse21 (<= .cse25 0) (<= (+ (div (+ (* 9 ~a29~0) 2) 10) 115) 0))) (and .cse0 .cse17) (and .cse0 (and (and .cse26 .cse16) .cse5)) (and (and .cse6 .cse27 .cse28) .cse14) (and .cse24 .cse29) (and .cse15 .cse26) (and .cse0 (and .cse30 .cse5)) (and .cse1 (and .cse26 .cse2 .cse16)) (and .cse1 .cse3 .cse18 .cse31) (and .cse2 .cse27 .cse19) (and .cse15 .cse22 .cse28) (and (and (and .cse32 .cse27) .cse33) .cse18) (and .cse13 .cse5) (and .cse2 .cse23 .cse6) (and .cse1 .cse2 .cse4) (and .cse33 (and .cse15 .cse22 .cse21)) (and .cse30 .cse18) (and (exists ((v_prenex_77 Int)) (let ((.cse34 (+ (* 10 (div v_prenex_77 5)) 3459790))) (and (<= 0 .cse34) (<= v_prenex_77 599970) (<= (div .cse34 (- 9)) ~a0~0) (= 0 (mod v_prenex_77 5))))) .cse6 .cse28))))))) [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,132 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,133 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:39:35,134 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,135 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:39:35,136 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,137 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,138 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:39:35,139 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,140 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:39:35,142 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2018-12-30 23:39:35,142 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,142 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,142 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:39:35,142 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2018-12-30 23:39:35,142 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-12-30 23:39:35,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,313 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,317 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,317 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:39:35 BoogieIcfgContainer [2018-12-30 23:39:35,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:39:35,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:39:35,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:39:35,352 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:39:35,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:26:51" (3/4) ... [2018-12-30 23:39:35,361 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:39:35,436 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-30 23:39:35,442 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:39:35,480 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a0 <= 599970 && (a29 <= 41 && 0 < a29 + 16) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (((a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146) && 43 < a29)) || (((a29 <= 41 && a0 + 147 <= 0) && (\exists v_prenex_19 : int :: ((!(0 == (v_prenex_19 + 8) % 9) && (10 * v_prenex_19 + -3298780) / 9 + 1 <= a0) && 10 * v_prenex_19 < 3298780) && 0 < v_prenex_19 + 147)) && a2 == 4)) || (((((a29 <= 41 && (\exists v_~a0~0_834 : int :: ((v_~a0~0_834 + 600067) / 5 <= a0 && 0 <= v_~a0~0_834 + 600067) && 0 <= v_~a0~0_834 + 570979)) && a4 + 86 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a0 <= 599970 && a29 + 16 <= 0) && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))))) || (((a29 <= 41 && a0 + 147 <= 0) && 0 <= a0 + 570979) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || ((a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a29 + 145 <= 0)) || ((0 <= a29 + 15 && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)))) && (!(6 == input) || a0 + 61 <= 0))) || ((((0 <= a0 + 300116 && a2 == 4) || ((\exists v_~a29~0_894 : int :: (v_~a29~0_894 % 299978 + 300022 <= a29 && 43 < v_~a29~0_894) && 0 <= v_~a29~0_894) && a2 == 4)) && a0 + 147 <= 0) && 43 < a29)) || (((a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((((\exists v_prenex_25 : int :: ((!(0 == v_prenex_25 % 299926) && v_prenex_25 < 0) && v_prenex_25 % 299926 <= a0 + 600001) && v_prenex_25 + 44 <= 0) && 44 <= a29) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a2 == 1)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a0 + 44 <= 0) && (9 * a29 + 2) / 10 + 115 <= 0)) || (((a0 + 98 <= 0 && a2 == 4) && 0 <= a0 + 146) && 43 < a29)) || ((a2 == 2 && a0 + 147 <= 0) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 104 <= 0)) || (a0 <= 599970 && a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3)) || (a0 <= 599970 && (a2 == 5 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2) && 43 < a29)) || (((a0 + 147 <= 0 && a29 <= 43) && a2 == 3) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 144 <= 0)) || (a0 + 98 <= 0 && a2 == 5)) || (a0 <= 599970 && (((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && 43 < a29)) || (a29 <= 41 && (a2 == 5 && 0 < a29 + 16) && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((a29 <= 41 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((0 < a29 + 16 && a29 <= 43) && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 3)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) && 43 < a29)) || ((0 < a29 + 16 && a2 == 2) && a0 + 147 <= 0)) || ((a29 <= 41 && 0 < a29 + 16) && (a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146)) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98) && (a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 1)) || ((((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a0 + 61 <= 0)) || (((\exists v_prenex_77 : int :: ((0 <= 10 * (v_prenex_77 / 5) + 3459790 && v_prenex_77 <= 599970) && (10 * (v_prenex_77 / 5) + 3459790) / -9 <= a0) && 0 == v_prenex_77 % 5) && a0 + 147 <= 0) && a2 == 3) [2018-12-30 23:39:35,487 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a0 <= 599970 && (a29 <= 41 && 0 < a29 + 16) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (((a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146) && 43 < a29)) || (((a29 <= 41 && a0 + 147 <= 0) && (\exists v_prenex_19 : int :: ((!(0 == (v_prenex_19 + 8) % 9) && (10 * v_prenex_19 + -3298780) / 9 + 1 <= a0) && 10 * v_prenex_19 < 3298780) && 0 < v_prenex_19 + 147)) && a2 == 4)) || (((((a29 <= 41 && (\exists v_~a0~0_834 : int :: ((v_~a0~0_834 + 600067) / 5 <= a0 && 0 <= v_~a0~0_834 + 600067) && 0 <= v_~a0~0_834 + 570979)) && a4 + 86 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a0 <= 599970 && a29 + 16 <= 0) && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))))) || (((a29 <= 41 && a0 + 147 <= 0) && 0 <= a0 + 570979) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || ((a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a29 + 145 <= 0)) || ((0 <= a29 + 15 && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)))) && (!(6 == input) || a0 + 61 <= 0))) || ((((0 <= a0 + 300116 && a2 == 4) || ((\exists v_~a29~0_894 : int :: (v_~a29~0_894 % 299978 + 300022 <= a29 && 43 < v_~a29~0_894) && 0 <= v_~a29~0_894) && a2 == 4)) && a0 + 147 <= 0) && 43 < a29)) || (((a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((((\exists v_prenex_25 : int :: ((!(0 == v_prenex_25 % 299926) && v_prenex_25 < 0) && v_prenex_25 % 299926 <= a0 + 600001) && v_prenex_25 + 44 <= 0) && 44 <= a29) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a2 == 1)) || (((a0 + 98 <= 0 && a2 == 4) && 0 <= a0 + 146) && 43 < a29)) || ((a2 == 2 && a0 + 147 <= 0) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 104 <= 0)) || ((((((a4 + 89 <= 0 && 0 <= a0 + 44) && !(1 == input)) && 0 <= a29 + 127) && a2 == 1) && a0 + 44 <= 0) && (9 * a29 + 2) / 10 + 115 <= 0)) || (a0 <= 599970 && a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3)) || (a0 <= 599970 && (a2 == 5 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2) && 43 < a29)) || (((a0 + 147 <= 0 && a29 <= 43) && a2 == 3) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 144 <= 0)) || (a0 + 98 <= 0 && a2 == 5)) || (a0 <= 599970 && (((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && 43 < a29)) || (a29 <= 41 && (a2 == 5 && 0 < a29 + 16) && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((a29 <= 41 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((0 < a29 + 16 && a29 <= 43) && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 3)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) && 43 < a29)) || ((0 < a29 + 16 && a2 == 2) && a0 + 147 <= 0)) || ((a29 <= 41 && 0 < a29 + 16) && (a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146)) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98) && (a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 1)) || ((((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a0 + 61 <= 0)) || (((\exists v_prenex_77 : int :: ((0 <= 10 * (v_prenex_77 / 5) + 3459790 && v_prenex_77 <= 599970) && (10 * (v_prenex_77 / 5) + 3459790) / -9 <= a0) && 0 == v_prenex_77 % 5) && a0 + 147 <= 0) && a2 == 3) [2018-12-30 23:39:35,502 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((0 < a29 + 16 && a29 <= 43) && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0) || ((0 < a29 + 16 && a2 == 2) && a0 + 147 <= 0)) || (((44 <= a29 && a2 == 1) && 0 <= a0 + 384412) && a0 + 98 <= 0)) || ((((\exists v_prenex_19 : int :: ((!(0 == (v_prenex_19 + 8) % 9) && (10 * v_prenex_19 + -3298780) / 9 + 1 <= a0) && 10 * v_prenex_19 < 3298780) && 0 < v_prenex_19 + 147) && a29 <= 41) && a2 == 4) && a0 + 147 <= 0)) || ((((((a4 + 89 <= 0 && 0 <= a0 + 44) && !(1 == input)) && 0 <= a29 + 127) && a2 == 1) && a0 + 44 <= 0) && (9 * a29 + 2) / 10 + 115 <= 0)) || ((((0 <= a0 + 300116 && a2 == 4) || ((\exists v_~a29~0_894 : int :: (v_~a29~0_894 % 299978 + 300022 <= a29 && 43 < v_~a29~0_894) && 0 <= v_~a29~0_894) && a2 == 4)) && a0 + 147 <= 0) && 43 < a29)) || (a2 == 3 && (a0 + 147 <= 0 && a29 <= 43) && 0 <= a0 + 570979)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((((a29 <= 41 && (\exists v_~a0~0_834 : int :: ((v_~a0~0_834 + 600067) / 5 <= a0 && 0 <= v_~a0~0_834 + 600067) && 0 <= v_~a0~0_834 + 570979)) && a4 + 86 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a2 == 2 && a0 + 147 <= 0) && 0 <= a0 + 570979)) || (((a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((a0 <= 599970 && (a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && 43 < a29)) || ((0 <= a29 + 15 && (a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && (!(6 == input) || a0 + 61 <= 0))) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || ((((a29 <= 41 && a0 + 61 <= 0) && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98)) || ((a0 <= 599970 && a2 == 5 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2) && 43 < a29)) || (a0 <= 599970 && a29 <= 41 && (a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || (a29 <= 41 && (a2 == 5 && 0 < a29 + 16) && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((a0 <= 599970 && a29 <= 41) && a2 == 1) && 0 < a29 + 16)) || (44 <= a29 && ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 2) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || (a2 == 5 && a0 + 98 <= 0)) || ((a0 <= 599970 && (a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 16 <= 0)) || (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && 43 < a29)) || ((a29 <= 41 && 0 <= a29 + 15) && ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 2) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 3)) || (a0 + 104 <= 0 && (a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || ((((a29 <= 41 && a0 + 147 <= 0) && 0 <= a0 + 570979) && a2 == 1) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a2 == 4) && 0 <= a0 + 146) && 43 < a29)) || (a0 + 61 <= 0 && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0)) || ((((a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 145 <= 0) && !(1 == input))) || (((\exists v_prenex_77 : int :: ((0 <= 10 * (v_prenex_77 / 5) + 3459790 && v_prenex_77 <= 599970) && (10 * (v_prenex_77 / 5) + 3459790) / -9 <= a0) && 0 == v_prenex_77 % 5) && a0 + 147 <= 0) && a2 == 3)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0) [2018-12-30 23:39:35,828 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:39:35,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:39:35,829 INFO L168 Benchmark]: Toolchain (without parser) took 776368.79 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 947.2 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-30 23:39:35,832 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:39:35,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1343.66 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 850.6 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:35,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 405.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 850.6 MB in the beginning and 1.1 GB in the end (delta: -262.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:35,833 INFO L168 Benchmark]: Boogie Preprocessor took 201.81 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:35,834 INFO L168 Benchmark]: RCFGBuilder took 9608.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.7 MB). Peak memory consumption was 321.5 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:35,834 INFO L168 Benchmark]: TraceAbstraction took 764324.42 ms. Allocated memory was 1.3 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-30 23:39:35,835 INFO L168 Benchmark]: Witness Printer took 476.36 ms. Allocated memory is still 4.6 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 75.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:35,844 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1343.66 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 850.6 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 405.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 850.6 MB in the beginning and 1.1 GB in the end (delta: -262.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 201.81 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9608.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.7 MB). Peak memory consumption was 321.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 764324.42 ms. Allocated memory was 1.3 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 476.36 ms. Allocated memory is still 4.6 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 75.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: 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:39:35,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a0 <= 599970 && (a29 <= 41 && 0 < a29 + 16) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (((a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146) && 43 < a29)) || (((a29 <= 41 && a0 + 147 <= 0) && (\exists v_prenex_19 : int :: ((!(0 == (v_prenex_19 + 8) % 9) && (10 * v_prenex_19 + -3298780) / 9 + 1 <= a0) && 10 * v_prenex_19 < 3298780) && 0 < v_prenex_19 + 147)) && a2 == 4)) || (((((a29 <= 41 && (\exists v_~a0~0_834 : int :: ((v_~a0~0_834 + 600067) / 5 <= a0 && 0 <= v_~a0~0_834 + 600067) && 0 <= v_~a0~0_834 + 570979)) && a4 + 86 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a0 <= 599970 && a29 + 16 <= 0) && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))))) || (((a29 <= 41 && a0 + 147 <= 0) && 0 <= a0 + 570979) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || ((a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a29 + 145 <= 0)) || ((0 <= a29 + 15 && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)))) && (!(6 == input) || a0 + 61 <= 0))) || ((((0 <= a0 + 300116 && a2 == 4) || ((\exists v_~a29~0_894 : int :: (v_~a29~0_894 % 299978 + 300022 <= a29 && 43 < v_~a29~0_894) && 0 <= v_~a29~0_894) && a2 == 4)) && a0 + 147 <= 0) && 43 < a29)) || (((a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((((\exists v_prenex_25 : int :: ((!(0 == v_prenex_25 % 299926) && v_prenex_25 < 0) && v_prenex_25 % 299926 <= a0 + 600001) && v_prenex_25 + 44 <= 0) && 44 <= a29) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a2 == 1)) || (((((a4 + 89 <= 0 && 0 <= a0 + 44) && 0 <= a29 + 127) && a2 == 1) && a0 + 44 <= 0) && (9 * a29 + 2) / 10 + 115 <= 0)) || (((a0 + 98 <= 0 && a2 == 4) && 0 <= a0 + 146) && 43 < a29)) || ((a2 == 2 && a0 + 147 <= 0) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 104 <= 0)) || (a0 <= 599970 && a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3)) || (a0 <= 599970 && (a2 == 5 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2) && 43 < a29)) || (((a0 + 147 <= 0 && a29 <= 43) && a2 == 3) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 144 <= 0)) || (a0 + 98 <= 0 && a2 == 5)) || (a0 <= 599970 && (((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && 43 < a29)) || (a29 <= 41 && (a2 == 5 && 0 < a29 + 16) && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((a29 <= 41 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((0 < a29 + 16 && a29 <= 43) && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 3)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) && 43 < a29)) || ((0 < a29 + 16 && a2 == 2) && a0 + 147 <= 0)) || ((a29 <= 41 && 0 < a29 + 16) && (a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146)) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98) && (a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 1)) || ((((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a0 + 61 <= 0)) || (((\exists v_prenex_77 : int :: ((0 <= 10 * (v_prenex_77 / 5) + 3459790 && v_prenex_77 <= 599970) && (10 * (v_prenex_77 / 5) + 3459790) / -9 <= a0) && 0 == v_prenex_77 % 5) && a0 + 147 <= 0) && a2 == 3) - InvariantResult [Line: 23]: Loop Invariant [2018-12-30 23:39:35,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,902 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,902 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,903 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_25,QUANTIFIED] [2018-12-30 23:39:35,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a0 <= 599970 && (a29 <= 41 && 0 < a29 + 16) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (((a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146) && 43 < a29)) || (((a29 <= 41 && a0 + 147 <= 0) && (\exists v_prenex_19 : int :: ((!(0 == (v_prenex_19 + 8) % 9) && (10 * v_prenex_19 + -3298780) / 9 + 1 <= a0) && 10 * v_prenex_19 < 3298780) && 0 < v_prenex_19 + 147)) && a2 == 4)) || (((((a29 <= 41 && (\exists v_~a0~0_834 : int :: ((v_~a0~0_834 + 600067) / 5 <= a0 && 0 <= v_~a0~0_834 + 600067) && 0 <= v_~a0~0_834 + 570979)) && a4 + 86 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a0 <= 599970 && a29 + 16 <= 0) && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))))) || (((a29 <= 41 && a0 + 147 <= 0) && 0 <= a0 + 570979) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || ((a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a29 + 145 <= 0)) || ((0 <= a29 + 15 && (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)))) && (!(6 == input) || a0 + 61 <= 0))) || ((((0 <= a0 + 300116 && a2 == 4) || ((\exists v_~a29~0_894 : int :: (v_~a29~0_894 % 299978 + 300022 <= a29 && 43 < v_~a29~0_894) && 0 <= v_~a29~0_894) && a2 == 4)) && a0 + 147 <= 0) && 43 < a29)) || (((a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0) && a0 + 61 <= 0)) || (((((\exists v_prenex_25 : int :: ((!(0 == v_prenex_25 % 299926) && v_prenex_25 < 0) && v_prenex_25 % 299926 <= a0 + 600001) && v_prenex_25 + 44 <= 0) && 44 <= a29) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a2 == 1)) || (((a0 + 98 <= 0 && a2 == 4) && 0 <= a0 + 146) && 43 < a29)) || ((a2 == 2 && a0 + 147 <= 0) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 104 <= 0)) || ((((((a4 + 89 <= 0 && 0 <= a0 + 44) && !(1 == input)) && 0 <= a29 + 127) && a2 == 1) && a0 + 44 <= 0) && (9 * a29 + 2) / 10 + 115 <= 0)) || (a0 <= 599970 && a29 <= 41 && ((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3)) || (a0 <= 599970 && (a2 == 5 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2) && 43 < a29)) || (((a0 + 147 <= 0 && a29 <= 43) && a2 == 3) && 0 <= a0 + 570979)) || (((a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 144 <= 0)) || (a0 + 98 <= 0 && a2 == 5)) || (a0 <= 599970 && (((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && 43 < a29)) || (a29 <= 41 && (a2 == 5 && 0 < a29 + 16) && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((a29 <= 41 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((0 < a29 + 16 && a29 <= 43) && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 3)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && !(2 == input)) || ((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) && 43 < a29)) || ((0 < a29 + 16 && a2 == 2) && a0 + 147 <= 0)) || ((a29 <= 41 && 0 < a29 + 16) && (a0 + 98 <= 0 && a2 == 2) && 0 <= a0 + 146)) || (((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98) && (a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 1)) || ((((a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a2 == 3) && a0 + 61 <= 0)) || (((\exists v_prenex_77 : int :: ((0 <= 10 * (v_prenex_77 / 5) + 3459790 && v_prenex_77 <= 599970) && (10 * (v_prenex_77 / 5) + 3459790) / -9 <= a0) && 0 == v_prenex_77 % 5) && a0 + 147 <= 0) && a2 == 3) - InvariantResult [Line: 1658]: Loop Invariant [2018-12-30 23:39:35,933 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,933 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_19,QUANTIFIED] [2018-12-30 23:39:35,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_894,QUANTIFIED] [2018-12-30 23:39:35,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2018-12-30 23:39:35,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] [2018-12-30 23:39:35,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_77,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((0 < a29 + 16 && a29 <= 43) && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0) || ((0 < a29 + 16 && a2 == 2) && a0 + 147 <= 0)) || (((44 <= a29 && a2 == 1) && 0 <= a0 + 384412) && a0 + 98 <= 0)) || ((((\exists v_prenex_19 : int :: ((!(0 == (v_prenex_19 + 8) % 9) && (10 * v_prenex_19 + -3298780) / 9 + 1 <= a0) && 10 * v_prenex_19 < 3298780) && 0 < v_prenex_19 + 147) && a29 <= 41) && a2 == 4) && a0 + 147 <= 0)) || ((((((a4 + 89 <= 0 && 0 <= a0 + 44) && !(1 == input)) && 0 <= a29 + 127) && a2 == 1) && a0 + 44 <= 0) && (9 * a29 + 2) / 10 + 115 <= 0)) || ((((0 <= a0 + 300116 && a2 == 4) || ((\exists v_~a29~0_894 : int :: (v_~a29~0_894 % 299978 + 300022 <= a29 && 43 < v_~a29~0_894) && 0 <= v_~a29~0_894) && a2 == 4)) && a0 + 147 <= 0) && 43 < a29)) || (a2 == 3 && (a0 + 147 <= 0 && a29 <= 43) && 0 <= a0 + 570979)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((((a29 <= 41 && (\exists v_~a0~0_834 : int :: ((v_~a0~0_834 + 600067) / 5 <= a0 && 0 <= v_~a0~0_834 + 600067) && 0 <= v_~a0~0_834 + 570979)) && a4 + 86 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4)) || ((a2 == 2 && a0 + 147 <= 0) && 0 <= a0 + 570979)) || (((a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || ((a0 <= 599970 && (a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && 43 < a29)) || ((0 <= a29 + 15 && (a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && (!(6 == input) || a0 + 61 <= 0))) || (((a0 + 98 <= 0 && a2 == 1) && 0 <= a0 + 146) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || ((((a29 <= 41 && a0 + 61 <= 0) && a2 == 1) && 0 < a29 + 144) && 0 < a0 + 98)) || ((a0 <= 599970 && a2 == 5 && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2) && 43 < a29)) || (a0 <= 599970 && a29 <= 41 && (a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || (a29 <= 41 && (a2 == 5 && 0 < a29 + 16) && (a4 + 86 <= 0 && !(a2 == 4)) && 3 <= a2)) || (((a0 <= 599970 && a29 <= 41) && a2 == 1) && 0 < a29 + 16)) || (44 <= a29 && ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 2) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || (a2 == 5 && a0 + 98 <= 0)) || ((a0 <= 599970 && (a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 16 <= 0)) || (((a2 == 2 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && 43 < a29)) || ((a29 <= 41 && 0 <= a29 + 15) && ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 2) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || ((a0 + 98 <= 0 && 0 <= a0 + 146) && a2 == 3)) || (a0 + 104 <= 0 && (a4 + 86 <= 0 && a2 == 1) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98))) || ((((a29 <= 41 && a0 + 147 <= 0) && 0 <= a0 + 570979) && a2 == 1) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a2 == 4) && 0 <= a0 + 146) && 43 < a29)) || (a0 + 61 <= 0 && (a2 == 4 && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a4 + 86 <= 0)) || ((((a2 == 3 && a4 + 86 <= 0 && !(a2 == 4)) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a29 + 145 <= 0) && !(1 == input))) || (((\exists v_prenex_77 : int :: ((0 <= 10 * (v_prenex_77 / 5) + 3459790 && v_prenex_77 <= 599970) && (10 * (v_prenex_77 / 5) + 3459790) / -9 <= a0) && 0 == v_prenex_77 % 5) && a0 + 147 <= 0) && a2 == 3)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && ((((0 < a29 + 16 || 0 < a4 + 86) || a0 + 147 <= 0) || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 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, 764.0s OverallTime, 24 OverallIterations, 10 TraceHistogramMax, 511.0s AutomataDifference, 0.0s DeadEndRemovalTime, 170.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 3558 SDtfs, 32669 SDslu, 2424 SDs, 0 SdLazy, 80659 SolverSat, 6996 SolverUnsat, 181 SolverUnknown, 0 SolverNotchecked, 474.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13562 GetRequests, 13341 SyntacticMatches, 50 SemanticMatches, 171 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 32.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18743occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 76533 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 217 NumberOfFragments, 3430 HoareAnnotationTreeSize, 4 FomulaSimplifications, 301669021 FormulaSimplificationTreeSizeReduction, 8.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 985456514 FormulaSimplificationTreeSizeReductionInter, 162.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 51.2s InterpolantComputationTime, 35095 NumberOfCodeBlocks, 35095 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 35058 ConstructedInterpolants, 1782 QuantifiedInterpolants, 202645631 SizeOfPredicates, 15 NumberOfNonLiveVariables, 15416 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 67479/76875 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...