./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label27_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem15_label27_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14831cf592bc13b54caac21143b5bc01f6bc3848 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:34:42,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:34:42,197 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:34:42,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:34:42,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:34:42,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:34:42,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:34:42,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:34:42,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:34:42,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:34:42,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:34:42,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:34:42,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:34:42,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:34:42,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:34:42,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:34:42,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:34:42,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:34:42,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:34:42,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:34:42,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:34:42,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:34:42,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:34:42,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:34:42,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:34:42,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:34:42,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:34:42,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:34:42,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:34:42,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:34:42,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:34:42,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:34:42,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:34:42,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:34:42,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:34:42,260 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:34:42,260 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:34:42,275 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:34:42,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:34:42,276 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:34:42,276 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:34:42,277 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:34:42,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:34:42,277 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:34:42,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:34:42,277 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:34:42,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:34:42,278 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:34:42,278 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:34:42,278 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:34:42,278 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:34:42,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:34:42,278 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:34:42,278 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:34:42,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:34:42,280 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:34:42,280 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:34:42,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:34:42,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:34:42,281 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:34:42,281 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:34:42,281 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:34:42,281 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:34:42,282 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:34:42,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:34:42,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14831cf592bc13b54caac21143b5bc01f6bc3848 [2019-01-12 04:34:42,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:34:42,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:34:42,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:34:42,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:34:42,355 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:34:42,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label27_true-unreach-call.c [2019-01-12 04:34:42,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfe4cd44/90d2ba2034114b1f85d5f820865608e4/FLAGdb677d3a9 [2019-01-12 04:34:43,190 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:34:43,191 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label27_true-unreach-call.c [2019-01-12 04:34:43,213 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfe4cd44/90d2ba2034114b1f85d5f820865608e4/FLAGdb677d3a9 [2019-01-12 04:34:43,392 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdfe4cd44/90d2ba2034114b1f85d5f820865608e4 [2019-01-12 04:34:43,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:34:43,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:34:43,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:34:43,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:34:43,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:34:43,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:34:43" (1/1) ... [2019-01-12 04:34:43,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:43, skipping insertion in model container [2019-01-12 04:34:43,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:34:43" (1/1) ... [2019-01-12 04:34:43,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:34:43,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:34:44,329 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:34:44,337 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:34:44,768 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:34:44,792 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:34:44,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44 WrapperNode [2019-01-12 04:34:44,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:34:44,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:34:44,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:34:44,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:34:44,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:44,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:34:45,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:34:45,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:34:45,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:34:45,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:45,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:34:45,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:34:45,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:34:45,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:34:45,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:34:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:34:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:34:52,103 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:34:52,104 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:34:52,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:52 BoogieIcfgContainer [2019-01-12 04:34:52,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:34:52,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:34:52,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:34:52,110 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:34:52,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:34:43" (1/3) ... [2019-01-12 04:34:52,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d7e27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:52, skipping insertion in model container [2019-01-12 04:34:52,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44" (2/3) ... [2019-01-12 04:34:52,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d7e27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:52, skipping insertion in model container [2019-01-12 04:34:52,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:52" (3/3) ... [2019-01-12 04:34:52,115 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label27_true-unreach-call.c [2019-01-12 04:34:52,125 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:34:52,133 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:34:52,150 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:34:52,183 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:34:52,184 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:34:52,184 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:34:52,184 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:34:52,184 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:34:52,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:34:52,184 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:34:52,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:34:52,185 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:34:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:34:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 04:34:52,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:52,220 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] [2019-01-12 04:34:52,223 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-01-12 04:34:52,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:52,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:52,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:52,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:52,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:52,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:52,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:52,681 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:34:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:58,332 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-01-12 04:34:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:58,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-12 04:34:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:58,363 INFO L225 Difference]: With dead ends: 1514 [2019-01-12 04:34:58,363 INFO L226 Difference]: Without dead ends: 1008 [2019-01-12 04:34:58,371 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 [2019-01-12 04:34:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-01-12 04:34:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-01-12 04:34:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-01-12 04:34:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-01-12 04:34:58,454 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 37 [2019-01-12 04:34:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:58,455 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-01-12 04:34:58,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-01-12 04:34:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-12 04:34:58,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:58,460 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:58,460 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1560092623, now seen corresponding path program 1 times [2019-01-12 04:34:58,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:58,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:58,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:58,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:58,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:58,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:58,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:34:58,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:58,787 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 4 states. [2019-01-12 04:35:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:06,118 INFO L93 Difference]: Finished difference Result 2561 states and 4453 transitions. [2019-01-12 04:35:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:06,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-01-12 04:35:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:06,131 INFO L225 Difference]: With dead ends: 2561 [2019-01-12 04:35:06,131 INFO L226 Difference]: Without dead ends: 1886 [2019-01-12 04:35:06,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-01-12 04:35:06,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1881. [2019-01-12 04:35:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-01-12 04:35:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2859 transitions. [2019-01-12 04:35:06,190 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2859 transitions. Word has length 102 [2019-01-12 04:35:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:06,191 INFO L480 AbstractCegarLoop]: Abstraction has 1881 states and 2859 transitions. [2019-01-12 04:35:06,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2859 transitions. [2019-01-12 04:35:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 04:35:06,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:06,197 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:06,197 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:06,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:06,197 INFO L82 PathProgramCache]: Analyzing trace with hash -600642833, now seen corresponding path program 1 times [2019-01-12 04:35:06,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:06,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:06,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:35:06,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:06,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:06,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:06,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:06,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:06,486 INFO L87 Difference]: Start difference. First operand 1881 states and 2859 transitions. Second operand 4 states. [2019-01-12 04:35:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:11,082 INFO L93 Difference]: Finished difference Result 7055 states and 10676 transitions. [2019-01-12 04:35:11,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:11,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-01-12 04:35:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:11,108 INFO L225 Difference]: With dead ends: 7055 [2019-01-12 04:35:11,108 INFO L226 Difference]: Without dead ends: 5176 [2019-01-12 04:35:11,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2019-01-12 04:35:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 3376. [2019-01-12 04:35:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2019-01-12 04:35:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4559 transitions. [2019-01-12 04:35:11,182 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4559 transitions. Word has length 156 [2019-01-12 04:35:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:11,183 INFO L480 AbstractCegarLoop]: Abstraction has 3376 states and 4559 transitions. [2019-01-12 04:35:11,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4559 transitions. [2019-01-12 04:35:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-01-12 04:35:11,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:11,193 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:11,194 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1266153403, now seen corresponding path program 1 times [2019-01-12 04:35:11,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:11,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:11,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:11,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:11,912 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:35:12,254 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:35:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-12 04:35:12,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:12,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:12,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:12,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:12,535 INFO L87 Difference]: Start difference. First operand 3376 states and 4559 transitions. Second operand 5 states. [2019-01-12 04:35:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:16,524 INFO L93 Difference]: Finished difference Result 7649 states and 10094 transitions. [2019-01-12 04:35:16,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:16,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 393 [2019-01-12 04:35:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:16,546 INFO L225 Difference]: With dead ends: 7649 [2019-01-12 04:35:16,547 INFO L226 Difference]: Without dead ends: 4275 [2019-01-12 04:35:16,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:16,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-01-12 04:35:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3974. [2019-01-12 04:35:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2019-01-12 04:35:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5199 transitions. [2019-01-12 04:35:16,624 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5199 transitions. Word has length 393 [2019-01-12 04:35:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:16,626 INFO L480 AbstractCegarLoop]: Abstraction has 3974 states and 5199 transitions. [2019-01-12 04:35:16,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5199 transitions. [2019-01-12 04:35:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-01-12 04:35:16,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:16,635 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:16,636 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:16,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1517405968, now seen corresponding path program 1 times [2019-01-12 04:35:16,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:16,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:16,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:35:17,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:17,488 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 [2019-01-12 04:35:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:17,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:18,365 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 21 [2019-01-12 04:35:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 140 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:35:18,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:35:18,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2019-01-12 04:35:18,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:35:18,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:35:18,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:35:18,812 INFO L87 Difference]: Start difference. First operand 3974 states and 5199 transitions. Second operand 8 states. [2019-01-12 04:35:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:32,918 INFO L93 Difference]: Finished difference Result 19398 states and 26036 transitions. [2019-01-12 04:35:32,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 04:35:32,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 414 [2019-01-12 04:35:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:33,012 INFO L225 Difference]: With dead ends: 19398 [2019-01-12 04:35:33,016 INFO L226 Difference]: Without dead ends: 15426 [2019-01-12 04:35:33,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-12 04:35:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15426 states. [2019-01-12 04:35:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15426 to 10259. [2019-01-12 04:35:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10259 states. [2019-01-12 04:35:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 12731 transitions. [2019-01-12 04:35:33,365 INFO L78 Accepts]: Start accepts. Automaton has 10259 states and 12731 transitions. Word has length 414 [2019-01-12 04:35:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:33,368 INFO L480 AbstractCegarLoop]: Abstraction has 10259 states and 12731 transitions. [2019-01-12 04:35:33,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:35:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10259 states and 12731 transitions. [2019-01-12 04:35:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-01-12 04:35:33,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:33,407 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:33,409 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:33,410 INFO L82 PathProgramCache]: Analyzing trace with hash -520409033, now seen corresponding path program 1 times [2019-01-12 04:35:33,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:33,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:33,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:33,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:33,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:34,363 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:35:34,684 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:35:35,203 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-01-12 04:35:35,839 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-12 04:35:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 533 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-12 04:35:36,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:36,364 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 [2019-01-12 04:35:36,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:36,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-01-12 04:35:36,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:35:36,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:35:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:35:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:35:36,777 INFO L87 Difference]: Start difference. First operand 10259 states and 12731 transitions. Second operand 8 states. [2019-01-12 04:35:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:43,656 INFO L93 Difference]: Finished difference Result 23466 states and 28512 transitions. [2019-01-12 04:35:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:35:43,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 538 [2019-01-12 04:35:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:43,688 INFO L225 Difference]: With dead ends: 23466 [2019-01-12 04:35:43,688 INFO L226 Difference]: Without dead ends: 10557 [2019-01-12 04:35:43,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 541 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:35:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10557 states. [2019-01-12 04:35:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10557 to 10258. [2019-01-12 04:35:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10258 states. [2019-01-12 04:35:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 11761 transitions. [2019-01-12 04:35:43,897 INFO L78 Accepts]: Start accepts. Automaton has 10258 states and 11761 transitions. Word has length 538 [2019-01-12 04:35:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:43,898 INFO L480 AbstractCegarLoop]: Abstraction has 10258 states and 11761 transitions. [2019-01-12 04:35:43,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:35:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 10258 states and 11761 transitions. [2019-01-12 04:35:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-01-12 04:35:43,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:43,923 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:43,923 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2934659, now seen corresponding path program 1 times [2019-01-12 04:35:43,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:43,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:43,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:43,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:43,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:44,706 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-12 04:35:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:35:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:35:44,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:44,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:44,991 INFO L87 Difference]: Start difference. First operand 10258 states and 11761 transitions. Second operand 5 states. [2019-01-12 04:35:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:49,945 INFO L93 Difference]: Finished difference Result 27090 states and 31533 transitions. [2019-01-12 04:35:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:49,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 566 [2019-01-12 04:35:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:49,984 INFO L225 Difference]: With dead ends: 27090 [2019-01-12 04:35:49,984 INFO L226 Difference]: Without dead ends: 18630 [2019-01-12 04:35:50,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18630 states. [2019-01-12 04:35:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18630 to 13547. [2019-01-12 04:35:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13547 states. [2019-01-12 04:35:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13547 states to 13547 states and 15716 transitions. [2019-01-12 04:35:50,229 INFO L78 Accepts]: Start accepts. Automaton has 13547 states and 15716 transitions. Word has length 566 [2019-01-12 04:35:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:50,232 INFO L480 AbstractCegarLoop]: Abstraction has 13547 states and 15716 transitions. [2019-01-12 04:35:50,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 13547 states and 15716 transitions. [2019-01-12 04:35:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-01-12 04:35:50,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:50,256 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:50,256 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1711740941, now seen corresponding path program 1 times [2019-01-12 04:35:50,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:50,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:50,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-01-12 04:35:51,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:51,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:51,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:35:51,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:35:51,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:51,028 INFO L87 Difference]: Start difference. First operand 13547 states and 15716 transitions. Second operand 3 states. [2019-01-12 04:35:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:53,164 INFO L93 Difference]: Finished difference Result 25593 states and 29880 transitions. [2019-01-12 04:35:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:35:53,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 676 [2019-01-12 04:35:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:53,190 INFO L225 Difference]: With dead ends: 25593 [2019-01-12 04:35:53,190 INFO L226 Difference]: Without dead ends: 13545 [2019-01-12 04:35:53,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13545 states. [2019-01-12 04:35:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13545 to 13545. [2019-01-12 04:35:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13545 states. [2019-01-12 04:35:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13545 states to 13545 states and 15712 transitions. [2019-01-12 04:35:53,377 INFO L78 Accepts]: Start accepts. Automaton has 13545 states and 15712 transitions. Word has length 676 [2019-01-12 04:35:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:53,379 INFO L480 AbstractCegarLoop]: Abstraction has 13545 states and 15712 transitions. [2019-01-12 04:35:53,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:35:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13545 states and 15712 transitions. [2019-01-12 04:35:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-01-12 04:35:53,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:53,408 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:53,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:53,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1832391907, now seen corresponding path program 1 times [2019-01-12 04:35:53,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:53,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:35:54,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:54,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:54,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:54,182 INFO L87 Difference]: Start difference. First operand 13545 states and 15712 transitions. Second operand 4 states. [2019-01-12 04:35:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:57,097 INFO L93 Difference]: Finished difference Result 36373 states and 41923 transitions. [2019-01-12 04:35:57,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:57,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 710 [2019-01-12 04:35:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:57,137 INFO L225 Difference]: With dead ends: 36373 [2019-01-12 04:35:57,137 INFO L226 Difference]: Without dead ends: 22830 [2019-01-12 04:35:57,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22830 states. [2019-01-12 04:35:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22830 to 21916. [2019-01-12 04:35:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21916 states. [2019-01-12 04:35:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21916 states to 21916 states and 24736 transitions. [2019-01-12 04:35:57,471 INFO L78 Accepts]: Start accepts. Automaton has 21916 states and 24736 transitions. Word has length 710 [2019-01-12 04:35:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:57,472 INFO L480 AbstractCegarLoop]: Abstraction has 21916 states and 24736 transitions. [2019-01-12 04:35:57,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 21916 states and 24736 transitions. [2019-01-12 04:35:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2019-01-12 04:35:57,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:57,494 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:57,494 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:57,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:57,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1105529793, now seen corresponding path program 1 times [2019-01-12 04:35:57,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:57,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:57,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:58,111 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:35:58,284 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-12 04:35:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 542 proven. 67 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-12 04:35:59,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:59,358 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 [2019-01-12 04:35:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:59,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-12 04:35:59,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:59,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:35:59,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:35:59,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:35:59,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:35:59,826 INFO L87 Difference]: Start difference. First operand 21916 states and 24736 transitions. Second operand 9 states. [2019-01-12 04:36:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:05,280 INFO L93 Difference]: Finished difference Result 44332 states and 49929 transitions. [2019-01-12 04:36:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:36:05,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 720 [2019-01-12 04:36:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:05,306 INFO L225 Difference]: With dead ends: 44332 [2019-01-12 04:36:05,306 INFO L226 Difference]: Without dead ends: 22418 [2019-01-12 04:36:05,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 722 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:36:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22418 states. [2019-01-12 04:36:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22418 to 20714. [2019-01-12 04:36:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20714 states. [2019-01-12 04:36:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20714 states to 20714 states and 22957 transitions. [2019-01-12 04:36:05,647 INFO L78 Accepts]: Start accepts. Automaton has 20714 states and 22957 transitions. Word has length 720 [2019-01-12 04:36:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:05,648 INFO L480 AbstractCegarLoop]: Abstraction has 20714 states and 22957 transitions. [2019-01-12 04:36:05,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:36:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20714 states and 22957 transitions. [2019-01-12 04:36:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-01-12 04:36:05,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:05,665 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:05,665 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1478502531, now seen corresponding path program 1 times [2019-01-12 04:36:05,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:05,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:06,387 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:36:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 657 proven. 136 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:36:07,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:07,163 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 [2019-01-12 04:36:07,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:07,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-01-12 04:36:08,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:08,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-12 04:36:08,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:36:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:36:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:08,283 INFO L87 Difference]: Start difference. First operand 20714 states and 22957 transitions. Second operand 5 states. [2019-01-12 04:36:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:14,099 INFO L93 Difference]: Finished difference Result 47074 states and 51838 transitions. [2019-01-12 04:36:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:36:14,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 722 [2019-01-12 04:36:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:14,121 INFO L225 Difference]: With dead ends: 47074 [2019-01-12 04:36:14,121 INFO L226 Difference]: Without dead ends: 19186 [2019-01-12 04:36:14,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 722 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:14,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19186 states. [2019-01-12 04:36:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19186 to 14096. [2019-01-12 04:36:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14096 states. [2019-01-12 04:36:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14096 states to 14096 states and 14767 transitions. [2019-01-12 04:36:14,366 INFO L78 Accepts]: Start accepts. Automaton has 14096 states and 14767 transitions. Word has length 722 [2019-01-12 04:36:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:14,367 INFO L480 AbstractCegarLoop]: Abstraction has 14096 states and 14767 transitions. [2019-01-12 04:36:14,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:36:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14096 states and 14767 transitions. [2019-01-12 04:36:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2019-01-12 04:36:14,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:14,380 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:14,380 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1158651664, now seen corresponding path program 1 times [2019-01-12 04:36:14,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:14,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:14,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:14,921 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 04:36:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:36:15,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:15,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:36:15,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:36:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:36:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:36:15,556 INFO L87 Difference]: Start difference. First operand 14096 states and 14767 transitions. Second operand 6 states. [2019-01-12 04:36:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:18,838 INFO L93 Difference]: Finished difference Result 29109 states and 30514 transitions. [2019-01-12 04:36:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:36:18,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 724 [2019-01-12 04:36:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:18,850 INFO L225 Difference]: With dead ends: 29109 [2019-01-12 04:36:18,850 INFO L226 Difference]: Without dead ends: 15015 [2019-01-12 04:36:18,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:36:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2019-01-12 04:36:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 14994. [2019-01-12 04:36:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14994 states. [2019-01-12 04:36:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14994 states to 14994 states and 15678 transitions. [2019-01-12 04:36:19,028 INFO L78 Accepts]: Start accepts. Automaton has 14994 states and 15678 transitions. Word has length 724 [2019-01-12 04:36:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:19,028 INFO L480 AbstractCegarLoop]: Abstraction has 14994 states and 15678 transitions. [2019-01-12 04:36:19,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:36:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 14994 states and 15678 transitions. [2019-01-12 04:36:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2019-01-12 04:36:19,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:19,040 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:19,040 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:19,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1417323524, now seen corresponding path program 1 times [2019-01-12 04:36:19,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:19,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:19,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:19,670 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:36:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 35 proven. 487 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-12 04:36:20,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:20,393 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 [2019-01-12 04:36:20,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:20,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:20,915 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2019-01-12 04:36:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-12 04:36:21,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:21,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:36:21,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:36:21,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:36:21,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:36:21,889 INFO L87 Difference]: Start difference. First operand 14994 states and 15678 transitions. Second operand 7 states. [2019-01-12 04:36:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:29,448 INFO L93 Difference]: Finished difference Result 39281 states and 40936 transitions. [2019-01-12 04:36:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:36:29,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 730 [2019-01-12 04:36:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:29,473 INFO L225 Difference]: With dead ends: 39281 [2019-01-12 04:36:29,473 INFO L226 Difference]: Without dead ends: 24289 [2019-01-12 04:36:29,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:36:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24289 states. [2019-01-12 04:36:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24289 to 17687. [2019-01-12 04:36:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17687 states. [2019-01-12 04:36:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17687 states to 17687 states and 18435 transitions. [2019-01-12 04:36:29,787 INFO L78 Accepts]: Start accepts. Automaton has 17687 states and 18435 transitions. Word has length 730 [2019-01-12 04:36:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:29,788 INFO L480 AbstractCegarLoop]: Abstraction has 17687 states and 18435 transitions. [2019-01-12 04:36:29,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:36:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17687 states and 18435 transitions. [2019-01-12 04:36:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-01-12 04:36:29,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:29,809 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:29,810 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1210135993, now seen corresponding path program 1 times [2019-01-12 04:36:29,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:29,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:29,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-01-12 04:36:30,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:30,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:30,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:36:30,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:36:30,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:36:30,433 INFO L87 Difference]: Start difference. First operand 17687 states and 18435 transitions. Second operand 3 states. [2019-01-12 04:36:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:31,734 INFO L93 Difference]: Finished difference Result 33276 states and 34703 transitions. [2019-01-12 04:36:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:36:31,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 983 [2019-01-12 04:36:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:31,751 INFO L225 Difference]: With dead ends: 33276 [2019-01-12 04:36:31,751 INFO L226 Difference]: Without dead ends: 17686 [2019-01-12 04:36:31,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:36:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17686 states. [2019-01-12 04:36:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17686 to 17387. [2019-01-12 04:36:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17387 states. [2019-01-12 04:36:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17387 states to 17387 states and 18115 transitions. [2019-01-12 04:36:31,935 INFO L78 Accepts]: Start accepts. Automaton has 17387 states and 18115 transitions. Word has length 983 [2019-01-12 04:36:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:31,936 INFO L480 AbstractCegarLoop]: Abstraction has 17387 states and 18115 transitions. [2019-01-12 04:36:31,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:36:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 17387 states and 18115 transitions. [2019-01-12 04:36:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2019-01-12 04:36:31,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:31,968 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:31,969 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash -357221268, now seen corresponding path program 1 times [2019-01-12 04:36:31,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:31,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:31,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:31,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:31,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 1474 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2019-01-12 04:36:33,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:33,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:33,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:33,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:33,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:33,519 INFO L87 Difference]: Start difference. First operand 17387 states and 18115 transitions. Second operand 4 states. [2019-01-12 04:36:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:35,566 INFO L93 Difference]: Finished difference Result 32976 states and 34392 transitions. [2019-01-12 04:36:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:35,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1074 [2019-01-12 04:36:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:35,585 INFO L225 Difference]: With dead ends: 32976 [2019-01-12 04:36:35,585 INFO L226 Difference]: Without dead ends: 17686 [2019-01-12 04:36:35,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17686 states. [2019-01-12 04:36:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17686 to 17686. [2019-01-12 04:36:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17686 states. [2019-01-12 04:36:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17686 states to 17686 states and 18343 transitions. [2019-01-12 04:36:35,770 INFO L78 Accepts]: Start accepts. Automaton has 17686 states and 18343 transitions. Word has length 1074 [2019-01-12 04:36:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:35,771 INFO L480 AbstractCegarLoop]: Abstraction has 17686 states and 18343 transitions. [2019-01-12 04:36:35,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 17686 states and 18343 transitions. [2019-01-12 04:36:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2019-01-12 04:36:35,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:35,797 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:35,797 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1324101687, now seen corresponding path program 1 times [2019-01-12 04:36:35,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:35,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:35,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:35,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:35,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:37,479 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-12 04:36:37,976 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-12 04:36:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2174 proven. 398 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-01-12 04:36:39,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:39,867 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 [2019-01-12 04:36:39,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:40,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:40,689 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 27 [2019-01-12 04:36:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2056 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-01-12 04:36:42,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:42,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-01-12 04:36:42,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 04:36:42,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 04:36:42,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:36:42,567 INFO L87 Difference]: Start difference. First operand 17686 states and 18343 transitions. Second operand 14 states. [2019-01-12 04:37:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:01,771 INFO L93 Difference]: Finished difference Result 37661 states and 39071 transitions. [2019-01-12 04:37:01,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 04:37:01,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1204 [2019-01-12 04:37:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:01,795 INFO L225 Difference]: With dead ends: 37661 [2019-01-12 04:37:01,796 INFO L226 Difference]: Without dead ends: 20568 [2019-01-12 04:37:01,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1230 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=434, Invalid=1546, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 04:37:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20568 states. [2019-01-12 04:37:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20568 to 17987. [2019-01-12 04:37:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17987 states. [2019-01-12 04:37:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17987 states to 17987 states and 18590 transitions. [2019-01-12 04:37:01,990 INFO L78 Accepts]: Start accepts. Automaton has 17987 states and 18590 transitions. Word has length 1204 [2019-01-12 04:37:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:01,990 INFO L480 AbstractCegarLoop]: Abstraction has 17987 states and 18590 transitions. [2019-01-12 04:37:01,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 04:37:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17987 states and 18590 transitions. [2019-01-12 04:37:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2019-01-12 04:37:02,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:02,014 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:02,015 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash -121694548, now seen corresponding path program 1 times [2019-01-12 04:37:02,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:02,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:02,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2505 backedges. 1575 proven. 0 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-01-12 04:37:03,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:03,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:03,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:03,700 INFO L87 Difference]: Start difference. First operand 17987 states and 18590 transitions. Second operand 4 states. [2019-01-12 04:37:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:05,695 INFO L93 Difference]: Finished difference Result 39884 states and 41239 transitions. [2019-01-12 04:37:05,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:05,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1209 [2019-01-12 04:37:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:05,715 INFO L225 Difference]: With dead ends: 39884 [2019-01-12 04:37:05,715 INFO L226 Difference]: Without dead ends: 22198 [2019-01-12 04:37:05,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2019-01-12 04:37:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 18285. [2019-01-12 04:37:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18285 states. [2019-01-12 04:37:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18285 states to 18285 states and 18884 transitions. [2019-01-12 04:37:05,910 INFO L78 Accepts]: Start accepts. Automaton has 18285 states and 18884 transitions. Word has length 1209 [2019-01-12 04:37:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:05,911 INFO L480 AbstractCegarLoop]: Abstraction has 18285 states and 18884 transitions. [2019-01-12 04:37:05,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 18285 states and 18884 transitions. [2019-01-12 04:37:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1437 [2019-01-12 04:37:05,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:05,942 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:05,942 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1064392768, now seen corresponding path program 1 times [2019-01-12 04:37:05,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:05,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:05,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:06,819 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:37:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 2403 proven. 343 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-01-12 04:37:09,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:09,351 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 [2019-01-12 04:37:09,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:09,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:09,970 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-12 04:37:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4213 backedges. 2746 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-01-12 04:37:11,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:37:11,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:37:11,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:37:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:37:11,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:37:11,728 INFO L87 Difference]: Start difference. First operand 18285 states and 18884 transitions. Second operand 6 states. [2019-01-12 04:37:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:17,135 INFO L93 Difference]: Finished difference Result 41674 states and 43139 transitions. [2019-01-12 04:37:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:37:17,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1436 [2019-01-12 04:37:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:17,157 INFO L225 Difference]: With dead ends: 41674 [2019-01-12 04:37:17,157 INFO L226 Difference]: Without dead ends: 23391 [2019-01-12 04:37:17,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1445 GetRequests, 1438 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:37:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23391 states. [2019-01-12 04:37:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23391 to 14687. [2019-01-12 04:37:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14687 states. [2019-01-12 04:37:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14687 states to 14687 states and 14991 transitions. [2019-01-12 04:37:17,351 INFO L78 Accepts]: Start accepts. Automaton has 14687 states and 14991 transitions. Word has length 1436 [2019-01-12 04:37:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:17,352 INFO L480 AbstractCegarLoop]: Abstraction has 14687 states and 14991 transitions. [2019-01-12 04:37:17,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:37:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 14687 states and 14991 transitions. [2019-01-12 04:37:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2019-01-12 04:37:17,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:17,376 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:17,376 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1533655480, now seen corresponding path program 1 times [2019-01-12 04:37:17,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 2560 proven. 561 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2019-01-12 04:37:20,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:20,335 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 [2019-01-12 04:37:20,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:20,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 2560 proven. 561 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2019-01-12 04:37:25,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:37:25,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-01-12 04:37:25,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:37:25,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:37:25,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:37:25,944 INFO L87 Difference]: Start difference. First operand 14687 states and 14991 transitions. Second operand 7 states. [2019-01-12 04:37:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:30,625 INFO L93 Difference]: Finished difference Result 22777 states and 23231 transitions. [2019-01-12 04:37:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:37:30,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1468 [2019-01-12 04:37:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:30,644 INFO L225 Difference]: With dead ends: 22777 [2019-01-12 04:37:30,644 INFO L226 Difference]: Without dead ends: 22775 [2019-01-12 04:37:30,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1473 GetRequests, 1467 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:37:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22775 states. [2019-01-12 04:37:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22775 to 15885. [2019-01-12 04:37:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15885 states. [2019-01-12 04:37:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15885 states to 15885 states and 16219 transitions. [2019-01-12 04:37:30,827 INFO L78 Accepts]: Start accepts. Automaton has 15885 states and 16219 transitions. Word has length 1468 [2019-01-12 04:37:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:30,828 INFO L480 AbstractCegarLoop]: Abstraction has 15885 states and 16219 transitions. [2019-01-12 04:37:30,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:37:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 15885 states and 16219 transitions. [2019-01-12 04:37:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2019-01-12 04:37:30,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:30,851 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:30,851 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1729617442, now seen corresponding path program 1 times [2019-01-12 04:37:30,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:30,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:30,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:30,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:30,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:31,725 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:37:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 35 proven. 3578 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-01-12 04:37:34,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:34,740 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 [2019-01-12 04:37:34,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:35,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:35,597 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 18 [2019-01-12 04:37:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 2622 proven. 561 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2019-01-12 04:37:37,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:37:37,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-01-12 04:37:37,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:37:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:37:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:37:37,836 INFO L87 Difference]: Start difference. First operand 15885 states and 16219 transitions. Second operand 11 states. [2019-01-12 04:37:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:46,485 INFO L93 Difference]: Finished difference Result 37465 states and 38250 transitions. [2019-01-12 04:37:46,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 04:37:46,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1485 [2019-01-12 04:37:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:46,521 INFO L225 Difference]: With dead ends: 37465 [2019-01-12 04:37:46,521 INFO L226 Difference]: Without dead ends: 37463 [2019-01-12 04:37:46,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1501 GetRequests, 1487 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-12 04:37:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37463 states. [2019-01-12 04:37:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37463 to 15885. [2019-01-12 04:37:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15885 states. [2019-01-12 04:37:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15885 states to 15885 states and 16219 transitions. [2019-01-12 04:37:46,767 INFO L78 Accepts]: Start accepts. Automaton has 15885 states and 16219 transitions. Word has length 1485 [2019-01-12 04:37:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:46,768 INFO L480 AbstractCegarLoop]: Abstraction has 15885 states and 16219 transitions. [2019-01-12 04:37:46,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:37:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 15885 states and 16219 transitions. [2019-01-12 04:37:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2019-01-12 04:37:46,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:46,791 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:46,791 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:46,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1882290462, now seen corresponding path program 1 times [2019-01-12 04:37:46,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:46,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:46,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:46,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:46,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5374 backedges. 3666 proven. 0 refuted. 0 times theorem prover too weak. 1708 trivial. 0 not checked. [2019-01-12 04:37:48,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:48,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:37:48,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:37:48,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:37:48,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:48,625 INFO L87 Difference]: Start difference. First operand 15885 states and 16219 transitions. Second operand 3 states. [2019-01-12 04:37:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:49,858 INFO L93 Difference]: Finished difference Result 31476 states and 32145 transitions. [2019-01-12 04:37:49,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:49,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1695 [2019-01-12 04:37:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:49,873 INFO L225 Difference]: With dead ends: 31476 [2019-01-12 04:37:49,873 INFO L226 Difference]: Without dead ends: 17688 [2019-01-12 04:37:49,881 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 [2019-01-12 04:37:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17688 states. [2019-01-12 04:37:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17688 to 16184. [2019-01-12 04:37:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16184 states. [2019-01-12 04:37:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16184 states to 16184 states and 16509 transitions. [2019-01-12 04:37:50,050 INFO L78 Accepts]: Start accepts. Automaton has 16184 states and 16509 transitions. Word has length 1695 [2019-01-12 04:37:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:50,051 INFO L480 AbstractCegarLoop]: Abstraction has 16184 states and 16509 transitions. [2019-01-12 04:37:50,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16184 states and 16509 transitions. [2019-01-12 04:37:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1792 [2019-01-12 04:37:50,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:50,077 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:50,077 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2019664079, now seen corresponding path program 1 times [2019-01-12 04:37:50,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:50,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:50,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 3074 proven. 561 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-01-12 04:37:52,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:52,412 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 [2019-01-12 04:37:52,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:52,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:53,268 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 18 [2019-01-12 04:37:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5647 backedges. 3074 proven. 561 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-01-12 04:37:56,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:37:56,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-01-12 04:37:56,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:37:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:37:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:37:56,304 INFO L87 Difference]: Start difference. First operand 16184 states and 16509 transitions. Second operand 8 states. [2019-01-12 04:38:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:01,060 INFO L93 Difference]: Finished difference Result 26670 states and 27196 transitions. [2019-01-12 04:38:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:38:01,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1791 [2019-01-12 04:38:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:01,086 INFO L225 Difference]: With dead ends: 26670 [2019-01-12 04:38:01,086 INFO L226 Difference]: Without dead ends: 26668 [2019-01-12 04:38:01,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1802 GetRequests, 1793 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:38:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26668 states. [2019-01-12 04:38:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26668 to 16184. [2019-01-12 04:38:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16184 states. [2019-01-12 04:38:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16184 states to 16184 states and 16509 transitions. [2019-01-12 04:38:01,300 INFO L78 Accepts]: Start accepts. Automaton has 16184 states and 16509 transitions. Word has length 1791 [2019-01-12 04:38:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:01,302 INFO L480 AbstractCegarLoop]: Abstraction has 16184 states and 16509 transitions. [2019-01-12 04:38:01,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:38:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 16184 states and 16509 transitions. [2019-01-12 04:38:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1800 [2019-01-12 04:38:01,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:01,327 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:38:01,328 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash 346048769, now seen corresponding path program 1 times [2019-01-12 04:38:01,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:01,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:01,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:01,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:01,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:02,269 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-01-12 04:38:02,483 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 04:38:02,699 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 04:38:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6406 backedges. 3589 proven. 1322 refuted. 0 times theorem prover too weak. 1495 trivial. 0 not checked. [2019-01-12 04:38:04,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:38:04,450 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 [2019-01-12 04:38:04,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:04,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:38:05,629 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 498 DAG size of output: 21 [2019-01-12 04:38:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6406 backedges. 3589 proven. 1322 refuted. 0 times theorem prover too weak. 1495 trivial. 0 not checked. [2019-01-12 04:38:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:38:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-12 04:38:08,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:38:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:38:08,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:38:08,905 INFO L87 Difference]: Start difference. First operand 16184 states and 16509 transitions. Second operand 9 states. [2019-01-12 04:38:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:14,153 INFO L93 Difference]: Finished difference Result 37159 states and 37912 transitions. [2019-01-12 04:38:14,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:38:14,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1799 [2019-01-12 04:38:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:14,156 INFO L225 Difference]: With dead ends: 37159 [2019-01-12 04:38:14,156 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:38:14,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1814 GetRequests, 1803 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-12 04:38:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:38:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:38:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:38:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:38:14,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1799 [2019-01-12 04:38:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:14,168 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:38:14,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:38:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:38:14,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:38:14,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:38:15,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:15,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:17,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:17,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:17,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:18,026 WARN L181 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 1242 DAG size of output: 1171 [2019-01-12 04:38:18,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:18,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:19,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:20,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:20,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:20,607 WARN L181 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 1239 DAG size of output: 1168 [2019-01-12 04:38:21,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:21,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:21,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:38:21,959 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 962 DAG size of output: 917 [2019-01-12 04:38:46,800 WARN L181 SmtUtils]: Spent 24.83 s on a formula simplification. DAG size of input: 1151 DAG size of output: 223 [2019-01-12 04:39:17,206 WARN L181 SmtUtils]: Spent 30.40 s on a formula simplification. DAG size of input: 1148 DAG size of output: 223 [2019-01-12 04:39:34,087 WARN L181 SmtUtils]: Spent 16.87 s on a formula simplification. DAG size of input: 906 DAG size of output: 219 [2019-01-12 04:39:34,090 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,091 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,092 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,093 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:39:34,094 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,095 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:39:34,096 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,097 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:39:34,098 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,099 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:39:34,100 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,101 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:39:34,102 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,103 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,104 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,105 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,106 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,107 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,108 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,109 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse48 (+ ~a0~0 98)) (.cse50 (+ ~a4~0 86))) (let ((.cse31 (< 0 .cse50)) (.cse23 (<= (+ ~a0~0 147) 0)) (.cse14 (< 0 .cse48)) (.cse30 (= ~a2~0 1)) (.cse49 (+ ~a29~0 144)) (.cse46 (<= .cse50 0)) (.cse44 (not (= 3 ~a2~0)))) (let ((.cse6 (<= 2 ~a2~0)) (.cse8 (and .cse46 .cse44)) (.cse37 (<= ~a2~0 3)) (.cse45 (+ ~a29~0 16)) (.cse41 (= ~a2~0 3)) (.cse40 (<= .cse49 0)) (.cse42 (not (= 1 ULTIMATE.start_calculate_output_~input))) (.cse26 (<= (+ ~a0~0 61) 0)) (.cse25 (and .cse46 .cse30)) (.cse22 (or .cse31 .cse23 .cse14)) (.cse43 (< 0 .cse49))) (let ((.cse11 (and .cse30 .cse31 .cse43)) (.cse24 (<= 0 (+ ~a0~0 599998))) (.cse16 (<= (+ ~a0~0 300073) 0)) (.cse32 (<= 0 (+ ~a0~0 385322))) (.cse0 (<= 44 ~a29~0)) (.cse19 (<= .cse48 0)) (.cse15 (<= ~a29~0 36)) (.cse4 (<= 3 ~a2~0)) (.cse36 (exists ((v_prenex_36 Int)) (let ((.cse47 (mod (+ v_prenex_36 11) 29))) (and (<= .cse47 (+ ~a29~0 14)) (not (= .cse47 0)) (< (+ v_prenex_36 371124) 0))))) (.cse9 (and (and .cse25 (<= ~a29~0 43) .cse43) .cse22)) (.cse10 (or (and .cse41 .cse40 .cse42) .cse31 .cse26)) (.cse17 (< 0 .cse45)) (.cse18 (and (and .cse46 .cse43) .cse37)) (.cse5 (exists ((v_prenex_6 Int)) (and (<= (+ v_prenex_6 98) 0) (<= ~a0~0 (div (+ (* 10 v_prenex_6) (- 3298780)) 9)) (= (mod (+ v_prenex_6 8) 9) 0)))) (.cse33 (and .cse46 .cse43 .cse44)) (.cse27 (= ~a2~0 4)) (.cse28 (and .cse6 .cse8 .cse14)) (.cse34 (<= ~a0~0 599999)) (.cse20 (= ~a2~0 2)) (.cse21 (<= (+ ~a4~0 89) 0)) (.cse12 (<= ~a0~0 599946)) (.cse13 (<= .cse45 0)) (.cse35 (and .cse43 .cse31 .cse44)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse29 (<= 0 (+ ~a0~0 146))) (.cse7 (<= (+ ~a0~0 99) 0))) (or (and .cse0 .cse1 (exists ((v_prenex_125 Int)) (let ((.cse3 (* 10 (div v_prenex_125 5)))) (let ((.cse2 (+ .cse3 3459790))) (and (<= (div .cse2 (- 9)) ~a0~0) (<= 0 v_prenex_125) (<= 0 .cse2) (<= v_prenex_125 599999) (<= 0 (+ .cse3 3459800)))))) .cse4 .cse5) (and .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse1 .cse11 .cse12 .cse13 .cse14) (and .cse11 (<= 0 (+ ~a0~0 451092)) .cse15 .cse1 .cse16) (and .cse6 .cse17 .cse7 .cse18) (and (and .cse19 .cse1 .cse17 .cse20) .cse15) (and .cse6 .cse21 .cse22 .cse7) (and .cse23 (and .cse24 .cse1 .cse17 .cse11 (exists ((v_~a29~0_895 Int)) (and (<= ~a29~0 (+ (mod (+ v_~a29~0_895 11) 29) 15)) (<= 0 (+ v_~a29~0_895 371124)))))) (and .cse7 .cse25) (and .cse26 .cse27 .cse28) (and .cse19 .cse0 .cse1 .cse20) (and .cse19 .cse1 .cse29 (and .cse30 .cse31)) (and .cse32 (and .cse1 .cse27) .cse23 .cse13) (and (and .cse6 .cse17 .cse33) .cse34) (and .cse32 (and .cse0 .cse1 .cse30) .cse23) (and (and .cse24 .cse6 .cse35 .cse1) .cse23 .cse36) (and .cse24 .cse6 .cse35 .cse1 .cse16) (and .cse32 (and .cse37 .cse1 .cse7 .cse4 .cse36)) (and (or (and .cse19 (and .cse35 .cse0 .cse1) .cse4) (and .cse19 (and .cse35 .cse1) .cse15 .cse4 .cse36)) (exists ((v_prenex_100 Int)) (let ((.cse38 (+ (* 10 (div v_prenex_100 5)) 3459790))) (and (<= 0 .cse38) (<= v_prenex_100 599970) (<= 0 v_prenex_100) (<= (div .cse38 (- 9)) ~a0~0))))) (let ((.cse39 (+ ~a0~0 44))) (and .cse9 (<= 0 .cse39) .cse13 (<= .cse39 0))) (and .cse6 .cse10 .cse18 .cse14) (and .cse34 (and .cse6 .cse17 .cse18 .cse14)) (and .cse1 .cse20 .cse5) (and .cse25 .cse40 .cse26) (and (and .cse33 .cse27) .cse34) (and (<= 214745 ~a0~0) .cse27 .cse12 .cse28) (and .cse6 .cse37 .cse1 .cse31 .cse29 .cse7) (and .cse34 (and .cse8 .cse20)) (and (and (and .cse21 .cse14) (and .cse41 .cse40) (or .cse42 .cse26)) .cse12) (and (and .cse6 .cse1 .cse31 .cse23 .cse37) .cse13) (and .cse6 .cse13 .cse35 .cse1 .cse29 .cse7)))))) [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,110 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,111 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,112 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,113 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,113 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse52 (+ ~a29~0 144)) (.cse53 (+ ~a4~0 86))) (let ((.cse49 (<= .cse53 0)) (.cse48 (+ ~a0~0 98)) (.cse47 (< 0 .cse52)) (.cse4 (< 0 .cse53)) (.cse50 (not (= 3 ~a2~0)))) (let ((.cse46 (<= ~a29~0 43)) (.cse34 (<= ~a2~0 3)) (.cse45 (+ ~a29~0 16)) (.cse8 (and .cse47 .cse4 .cse50)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse13 (<= (+ ~a0~0 147) 0)) (.cse24 (< 0 .cse48)) (.cse3 (= ~a2~0 1)) (.cse7 (<= 2 ~a2~0)) (.cse33 (and .cse49 .cse50))) (let ((.cse32 (and .cse7 .cse33)) (.cse14 (and .cse49 .cse3)) (.cse44 (or .cse4 .cse13 .cse24)) (.cse39 (<= 0 (+ ~a0~0 599998))) (.cse26 (and .cse7 .cse8 .cse1)) (.cse15 (<= .cse52 0)) (.cse43 (<= (+ ~a0~0 61) 0)) (.cse20 (< 0 .cse45)) (.cse41 (and (and .cse49 .cse47) .cse34)) (.cse40 (and .cse3 .cse4 .cse46 .cse47))) (let ((.cse30 (and .cse1 .cse40)) (.cse19 (<= 3 ~a2~0)) (.cse27 (exists ((v_prenex_36 Int)) (let ((.cse51 (mod (+ v_prenex_36 11) 29))) (and (<= .cse51 (+ ~a29~0 14)) (not (= .cse51 0)) (< (+ v_prenex_36 371124) 0))))) (.cse22 (<= ~a0~0 599999)) (.cse21 (and .cse49 .cse47 .cse50)) (.cse11 (<= ~a0~0 599946)) (.cse12 (<= 0 (+ ~a0~0 385322))) (.cse16 (<= 44 ~a29~0)) (.cse23 (and .cse7 .cse20 .cse41)) (.cse0 (<= .cse48 0)) (.cse25 (<= ~a29~0 36)) (.cse37 (or (and (= ~a2~0 3) .cse15 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse4 .cse43)) (.cse31 (<= (+ ~a0~0 300073) 0)) (.cse35 (and .cse39 .cse26)) (.cse2 (<= 0 (+ ~a0~0 146))) (.cse38 (and (and .cse14 .cse46 .cse47) .cse44)) (.cse9 (= ~a2~0 4)) (.cse10 (and .cse32 .cse24)) (.cse5 (<= .cse45 0)) (.cse36 (and .cse7 (<= (+ ~a4~0 89) 0) .cse44 .cse34)) (.cse6 (<= (+ ~a0~0 99) 0)) (.cse29 (= ~a2~0 2))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4))) (and .cse5 (and .cse6 (and .cse7 .cse8 .cse1 .cse2))) (and (and .cse9 .cse10) (<= 214745 ~a0~0) .cse11) (and .cse12 .cse13 (and .cse9 .cse1) .cse5) (and .cse14 .cse15) (and (and .cse16 .cse1) (exists ((v_prenex_125 Int)) (let ((.cse18 (* 10 (div v_prenex_125 5)))) (let ((.cse17 (+ .cse18 3459790))) (and (<= (div .cse17 (- 9)) ~a0~0) (<= 0 v_prenex_125) (<= 0 .cse17) (<= v_prenex_125 599999) (<= 0 (+ .cse18 3459800)))))) .cse19 (exists ((v_prenex_6 Int)) (and (<= (+ v_prenex_6 98) 0) (<= ~a0~0 (div (+ (* 10 v_prenex_6) (- 3298780)) 9)) (= (mod (+ v_prenex_6 8) 9) 0)))) (and (and .cse7 .cse20 .cse21) .cse22) (and .cse22 (and .cse23 .cse24)) (and (or (and .cse25 (and .cse0 .cse26) .cse27) (and .cse0 (and .cse8 .cse16 .cse1) .cse19)) (exists ((v_prenex_100 Int)) (let ((.cse28 (+ (* 10 (div v_prenex_100 5)) 3459790))) (and (<= 0 .cse28) (<= v_prenex_100 599970) (<= 0 v_prenex_100) (<= (div .cse28 (- 9)) ~a0~0))))) (and .cse0 (and .cse16 .cse1 .cse29)) (and (<= 0 (+ ~a0~0 451092)) .cse30 .cse31) (and .cse30 .cse11 .cse5 .cse24) (and .cse6 .cse32) (and .cse22 (and .cse33 .cse29)) (and .cse12 (and (and .cse1 .cse6 .cse34) .cse19 .cse27)) (and .cse13 .cse35 .cse27) (and .cse22 (and .cse9 .cse21)) (and (and .cse15 .cse36) .cse11) (and .cse12 (and .cse16 .cse1 .cse3) .cse13) (and .cse37 .cse38) (and (and .cse39 .cse1 .cse20 .cse40) .cse13) (and .cse23 .cse6) (and (and (and .cse1 .cse20 .cse29) .cse0) .cse25) (and (and .cse37 (and .cse7 .cse41)) .cse24) (and .cse31 .cse35) (and .cse7 .cse34 .cse1 .cse4 .cse2 .cse6) (let ((.cse42 (+ ~a0~0 44))) (and .cse38 (<= 0 .cse42) .cse5 (<= .cse42 0))) (and .cse43 .cse9 .cse10) (and .cse6 .cse14) (and .cse5 (and (and .cse7 .cse1 .cse4 .cse34) .cse13)) (and .cse36 .cse6) (and (and .cse1 .cse29) .cse13))))))) [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:39:34,114 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:39:34,115 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,116 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,117 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,118 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,119 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,120 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,120 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse53 (+ ~a29~0 144)) (.cse54 (+ ~a4~0 86))) (let ((.cse50 (<= .cse54 0)) (.cse49 (< 0 .cse53)) (.cse4 (< 0 .cse54)) (.cse51 (not (= 3 ~a2~0))) (.cse47 (+ ~a0~0 98))) (let ((.cse48 (<= ~a29~0 43)) (.cse15 (<= (+ ~a0~0 147) 0)) (.cse28 (< 0 .cse47)) (.cse3 (= ~a2~0 1)) (.cse37 (<= ~a2~0 3)) (.cse46 (+ ~a29~0 16)) (.cse10 (and .cse49 .cse4 .cse51)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse9 (<= 2 ~a2~0)) (.cse36 (and .cse50 .cse51))) (let ((.cse35 (and .cse9 .cse36)) (.cse41 (<= 0 (+ ~a0~0 599998))) (.cse30 (and .cse9 .cse10 .cse1)) (.cse17 (<= .cse53 0)) (.cse44 (<= (+ ~a0~0 61) 0)) (.cse24 (< 0 .cse46)) (.cse43 (and (and .cse50 .cse49) .cse37)) (.cse16 (and .cse50 .cse3)) (.cse45 (or .cse4 .cse15 .cse28)) (.cse42 (and .cse3 .cse4 .cse48 .cse49))) (let ((.cse6 (exists ((v_prenex_6 Int)) (and (<= (+ v_prenex_6 98) 0) (<= ~a0~0 (div (+ (* 10 v_prenex_6) (- 3298780)) 9)) (= (mod (+ v_prenex_6 8) 9) 0)))) (.cse33 (and .cse1 .cse42)) (.cse21 (<= 3 ~a2~0)) (.cse31 (exists ((v_prenex_36 Int)) (let ((.cse52 (mod (+ v_prenex_36 11) 29))) (and (<= .cse52 (+ ~a29~0 14)) (not (= .cse52 0)) (< (+ v_prenex_36 371124) 0))))) (.cse26 (<= ~a0~0 599999)) (.cse25 (and .cse50 .cse49 .cse51)) (.cse13 (<= ~a0~0 599946)) (.cse14 (<= 0 (+ ~a0~0 385322))) (.cse18 (<= 44 ~a29~0)) (.cse22 (and (and .cse16 .cse48 .cse49) .cse45)) (.cse27 (and .cse9 .cse24 .cse43)) (.cse5 (= ~a2~0 2)) (.cse0 (<= .cse47 0)) (.cse29 (<= ~a29~0 36)) (.cse40 (or (and (= ~a2~0 3) .cse17 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse4 .cse44)) (.cse34 (<= (+ ~a0~0 300073) 0)) (.cse38 (and .cse41 .cse30)) (.cse2 (<= 0 (+ ~a0~0 146))) (.cse11 (= ~a2~0 4)) (.cse12 (and .cse35 .cse28)) (.cse7 (<= .cse46 0)) (.cse39 (and .cse9 (<= (+ ~a4~0 89) 0) .cse45 .cse37)) (.cse8 (<= (+ ~a0~0 99) 0))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4))) (and (and .cse1 .cse5) .cse6) (and .cse7 (and .cse8 (and .cse9 .cse10 .cse1 .cse2))) (and (and .cse11 .cse12) (<= 214745 ~a0~0) .cse13) (and .cse14 .cse15 (and .cse11 .cse1) .cse7) (and .cse16 .cse17) (and (and .cse18 .cse1) (exists ((v_prenex_125 Int)) (let ((.cse20 (* 10 (div v_prenex_125 5)))) (let ((.cse19 (+ .cse20 3459790))) (and (<= (div .cse19 (- 9)) ~a0~0) (<= 0 v_prenex_125) (<= 0 .cse19) (<= v_prenex_125 599999) (<= 0 (+ .cse20 3459800)))))) .cse21 .cse6) (let ((.cse23 (+ ~a0~0 44))) (and .cse22 (<= 0 .cse23) .cse7 (<= .cse23 0))) (and (and .cse9 .cse24 .cse25) .cse26) (and .cse26 (and .cse27 .cse28)) (and (or (and .cse29 (and .cse0 .cse30) .cse31) (and .cse0 (and .cse10 .cse18 .cse1) .cse21)) (exists ((v_prenex_100 Int)) (let ((.cse32 (+ (* 10 (div v_prenex_100 5)) 3459790))) (and (<= 0 .cse32) (<= v_prenex_100 599970) (<= 0 v_prenex_100) (<= (div .cse32 (- 9)) ~a0~0))))) (and .cse0 (and .cse18 .cse1 .cse5)) (and (<= 0 (+ ~a0~0 451092)) .cse33 .cse34) (and .cse33 .cse13 .cse7 .cse28) (and .cse8 .cse35) (and .cse26 (and .cse36 .cse5)) (and .cse14 (and (and .cse1 .cse8 .cse37) .cse21 .cse31)) (and .cse15 .cse38 .cse31) (and .cse26 (and .cse11 .cse25)) (and (and .cse17 .cse39) .cse13) (and .cse14 (and .cse18 .cse1 .cse3) .cse15) (and .cse40 .cse22) (and (and .cse41 .cse1 .cse24 .cse42) .cse15) (and .cse27 .cse8) (and (and (and .cse1 .cse24 .cse5) .cse0) .cse29) (and (and .cse40 (and .cse9 .cse43)) .cse28) (and .cse34 .cse38) (and .cse9 .cse37 .cse1 .cse4 .cse2 .cse8) (and .cse44 .cse11 .cse12) (and .cse8 .cse16) (and .cse7 (and (and .cse9 .cse1 .cse4 .cse37) .cse15)) (and .cse39 .cse8))))))) [2019-01-12 04:39:34,120 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,121 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,122 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,123 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,124 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,125 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:39:34,127 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,127 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,127 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,127 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,127 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,127 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,128 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,129 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:39:34,140 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:39:34,140 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,140 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,140 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:39:34,140 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:39:34,140 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:39:34,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,276 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,277 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:39:34 BoogieIcfgContainer [2019-01-12 04:39:34,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:39:34,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:39:34,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:39:34,312 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:39:34,313 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:52" (3/4) ... [2019-01-12 04:39:34,322 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:39:34,424 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:39:34,430 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:39:34,470 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0) [2019-01-12 04:39:34,476 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0) [2019-01-12 04:39:34,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0)) || ((2 <= a2 && a0 + 99 <= 0) && a4 + 86 <= 0 && !(3 == a2))) || (((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0))) || ((((a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || ((((((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 451092) && a29 <= 36) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && a0 + 99 <= 0) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && a2 == 2) && a29 <= 36)) || (((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a0 + 99 <= 0)) || (a0 + 147 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && (\exists v_~a29~0_895 : int :: a29 <= (v_~a29~0_895 + 11) % 29 + 15 && 0 <= v_~a29~0_895 + 371124))) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 44 <= a29) && a4 + 42 <= 0) && a2 == 2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86)) || (((0 <= a0 + 385322 && a4 + 42 <= 0 && a2 == 4) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 147 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (0 <= a0 + 385322 && (((a2 <= 3 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2) || ((((a0 + 98 <= 0 && ((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a29 <= 36) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0)) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a2 == 4) && a0 <= 599999)) || (((214745 <= a0 && a2 == 4) && a0 <= 599946) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || ((((a4 + 89 <= 0 && 0 < a0 + 98) && a2 == 3 && a29 + 144 <= 0) && (!(1 == input) || a0 + 61 <= 0)) && a0 <= 599946)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a0 + 147 <= 0) && a2 <= 3) && a29 + 16 <= 0)) || (((((2 <= a2 && a29 + 16 <= 0) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 99 <= 0) [2019-01-12 04:39:34,744 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:39:34,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:39:34,746 INFO L168 Benchmark]: Toolchain (without parser) took 291347.84 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 947.3 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-12 04:39:34,748 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:39:34,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1392.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:34,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 209.75 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: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:34,749 INFO L168 Benchmark]: Boogie Preprocessor took 206.72 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:34,749 INFO L168 Benchmark]: RCFGBuilder took 6894.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.5 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:34,749 INFO L168 Benchmark]: TraceAbstraction took 282204.89 ms. Allocated memory was 1.3 GB in the beginning and 5.1 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:39:34,749 INFO L168 Benchmark]: Witness Printer took 432.36 ms. Allocated memory is still 5.1 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:34,757 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.19 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 1392.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 209.75 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: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 206.72 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6894.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.5 MB). Peak memory consumption was 246.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 282204.89 ms. Allocated memory was 1.3 GB in the beginning and 5.1 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 432.36 ms. Allocated memory is still 5.1 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 82.6 MB). Peak memory consumption was 82.6 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_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-01-12 04:39:34,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 2) && a0 + 147 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:39:34,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (a29 + 16 <= 0 && a0 + 99 <= 0 && ((2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146)) || (((a2 == 4 && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98) && 214745 <= a0) && a0 <= 599946)) || (((0 <= a0 + 385322 && a0 + 147 <= 0) && a2 == 4 && a4 + 42 <= 0) && a29 + 16 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((((a29 <= 36 && a0 + 98 <= 0 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0)) || ((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2)) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (a0 + 98 <= 0 && (44 <= a29 && a4 + 42 <= 0) && a2 == 2)) || ((0 <= a0 + 451092 && a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 300073 <= 0)) || ((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || (a0 + 99 <= 0 && 2 <= a2 && a4 + 86 <= 0 && !(3 == a2))) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || (0 <= a0 + 385322 && (((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 <= 3) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((a0 + 147 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || (a0 <= 599999 && a2 == 4 && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2))) || ((a29 + 144 <= 0 && ((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 <= 599946)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && a0 + 99 <= 0)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 2) && a0 + 98 <= 0) && a29 <= 36)) || ((((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0) && 2 <= a2 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 + 300073 <= 0 && 0 <= a0 + 599998 && (2 <= a2 && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || (a29 + 16 <= 0 && (((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 3) && a0 + 147 <= 0)) || ((((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a2 <= 3) && a0 + 99 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:39:34,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_125,QUANTIFIED] [2019-01-12 04:39:34,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-01-12 04:39:34,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_36,QUANTIFIED] [2019-01-12 04:39:34,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_100,QUANTIFIED] [2019-01-12 04:39:34,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:39:34,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((44 <= a29 && a4 + 42 <= 0) && (\exists v_prenex_125 : int :: ((((10 * (v_prenex_125 / 5) + 3459790) / -9 <= a0 && 0 <= v_prenex_125) && 0 <= 10 * (v_prenex_125 / 5) + 3459790) && v_prenex_125 <= 599999) && 0 <= 10 * (v_prenex_125 / 5) + 3459800)) && 3 <= a2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0)) || ((2 <= a2 && a0 + 99 <= 0) && a4 + 86 <= 0 && !(3 == a2))) || (((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0))) || ((((a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && a0 <= 599946) && a29 + 16 <= 0) && 0 < a0 + 98)) || ((((((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && 0 <= a0 + 451092) && a29 <= 36) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && a0 + 99 <= 0) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && a2 == 2) && a29 <= 36)) || (((2 <= a2 && a4 + 89 <= 0) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && a0 + 99 <= 0)) || (a0 + 147 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && 0 < a29 + 16) && (a2 == 1 && 0 < a4 + 86) && 0 < a29 + 144) && (\exists v_~a29~0_895 : int :: a29 <= (v_~a29~0_895 + 11) % 29 + 15 && 0 <= v_~a29~0_895 + 371124))) || (a0 + 99 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((a0 + 61 <= 0 && a2 == 4) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((a0 + 98 <= 0 && 44 <= a29) && a4 + 42 <= 0) && a2 == 2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 146) && a2 == 1 && 0 < a4 + 86)) || (((0 <= a0 + 385322 && a4 + 42 <= 0 && a2 == 4) && a0 + 147 <= 0) && a29 + 16 <= 0)) || (((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a0 <= 599999)) || ((0 <= a0 + 385322 && (44 <= a29 && a4 + 42 <= 0) && a2 == 1) && a0 + 147 <= 0)) || (((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 147 <= 0) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((0 <= a0 + 599998 && 2 <= a2) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a0 + 300073 <= 0)) || (0 <= a0 + 385322 && (((a2 <= 3 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) || ((((a0 + 98 <= 0 && (((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && 44 <= a29) && a4 + 42 <= 0) && 3 <= a2) || ((((a0 + 98 <= 0 && ((0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && a29 <= 36) && 3 <= a2) && (\exists v_prenex_36 : int :: ((v_prenex_36 + 11) % 29 <= a29 + 14 && !((v_prenex_36 + 11) % 29 == 0)) && v_prenex_36 + 371124 < 0))) && (\exists v_prenex_100 : int :: ((0 <= 10 * (v_prenex_100 / 5) + 3459790 && v_prenex_100 <= 599970) && 0 <= v_prenex_100) && (10 * (v_prenex_100 / 5) + 3459790) / -9 <= a0))) || (((((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && ((0 < a4 + 86 || a0 + 147 <= 0) || 0 < a0 + 98)) && 0 <= a0 + 44) && a29 + 16 <= 0) && a0 + 44 <= 0)) || (((2 <= a2 && ((((a2 == 3 && a29 + 144 <= 0) && !(1 == input)) || 0 < a4 + 86) || a0 + 61 <= 0)) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || (a0 <= 599999 && ((2 <= a2 && 0 < a29 + 16) && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 <= 3) && 0 < a0 + 98)) || ((a4 + 42 <= 0 && a2 == 2) && (\exists v_prenex_6 : int :: (v_prenex_6 + 98 <= 0 && a0 <= (10 * v_prenex_6 + -3298780) / 9) && (v_prenex_6 + 8) % 9 == 0))) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && 0 < a29 + 144) && !(3 == a2)) && a2 == 4) && a0 <= 599999)) || (((214745 <= a0 && a2 == 4) && a0 <= 599946) && (2 <= a2 && a4 + 86 <= 0 && !(3 == a2)) && 0 < a0 + 98)) || (((((2 <= a2 && a2 <= 3) && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a0 + 146) && a0 + 99 <= 0)) || (a0 <= 599999 && (a4 + 86 <= 0 && !(3 == a2)) && a2 == 2)) || ((((a4 + 89 <= 0 && 0 < a0 + 98) && a2 == 3 && a29 + 144 <= 0) && (!(1 == input) || a0 + 61 <= 0)) && a0 <= 599946)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a0 + 147 <= 0) && a2 <= 3) && a29 + 16 <= 0)) || (((((2 <= a2 && a29 + 16 <= 0) && (0 < a29 + 144 && 0 < a4 + 86) && !(3 == a2)) && a4 + 42 <= 0) && 0 <= a0 + 146) && a0 + 99 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 281.9s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 130.0s AutomataDifference, 0.0s DeadEndRemovalTime, 79.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 3533 SDtfs, 33656 SDslu, 2073 SDs, 0 SdLazy, 72347 SolverSat, 8012 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 106.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12559 GetRequests, 12378 SyntacticMatches, 21 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21916occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 83270 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 368 NumberOfFragments, 3481 HoareAnnotationTreeSize, 4 FomulaSimplifications, 31437115 FormulaSimplificationTreeSizeReduction, 7.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 386801141 FormulaSimplificationTreeSizeReductionInter, 72.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 40.9s InterpolantComputationTime, 32939 NumberOfCodeBlocks, 32939 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 32905 ConstructedInterpolants, 1733 QuantifiedInterpolants, 181914472 SizeOfPredicates, 10 NumberOfNonLiveVariables, 14195 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 34 InterpolantComputations, 18 PerfectInterpolantSequences, 67263/77828 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...