./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label57_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label57_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 22c18731806e96bfa852bca51e2e7f8af9799504 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:44:40,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:44:40,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:44:40,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:44:40,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:44:40,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:44:40,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:44:40,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:44:40,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:44:40,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:44:40,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:44:40,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:44:40,634 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:44:40,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:44:40,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:44:40,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:44:40,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:44:40,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:44:40,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:44:40,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:44:40,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:44:40,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:44:40,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:44:40,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:44:40,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:44:40,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:44:40,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:44:40,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:44:40,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:44:40,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:44:40,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:44:40,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:44:40,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:44:40,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:44:40,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:44:40,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:44:40,687 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:44:40,712 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:44:40,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:44:40,714 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:44:40,715 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:44:40,715 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:44:40,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:44:40,715 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:44:40,716 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:44:40,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:44:40,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:44:40,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:44:40,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:44:40,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:44:40,717 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:44:40,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:44:40,718 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:44:40,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:44:40,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:44:40,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:44:40,721 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:44:40,721 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:44:40,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:44:40,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:44:40,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:44:40,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:44:40,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:44:40,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:44:40,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:44:40,723 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 -> 22c18731806e96bfa852bca51e2e7f8af9799504 [2019-01-12 03:44:40,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:44:40,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:44:40,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:44:40,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:44:40,810 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:44:40,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label57_true-unreach-call.c [2019-01-12 03:44:40,868 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a24391f7/ee0c68a10c09451a9d9eab53bb76b2d9/FLAG82d6dd4ad [2019-01-12 03:44:41,390 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:44:41,394 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label57_true-unreach-call.c [2019-01-12 03:44:41,420 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a24391f7/ee0c68a10c09451a9d9eab53bb76b2d9/FLAG82d6dd4ad [2019-01-12 03:44:41,652 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a24391f7/ee0c68a10c09451a9d9eab53bb76b2d9 [2019-01-12 03:44:41,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:44:41,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:44:41,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:44:41,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:44:41,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:44:41,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:44:41" (1/1) ... [2019-01-12 03:44:41,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:41, skipping insertion in model container [2019-01-12 03:44:41,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:44:41" (1/1) ... [2019-01-12 03:44:41,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:44:41,755 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:44:42,375 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:44:42,380 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:44:42,627 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:44:42,776 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:44:42,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42 WrapperNode [2019-01-12 03:44:42,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:44:42,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:44:42,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:44:42,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:44:42,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:42,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:42,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:44:42,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:44:42,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:44:42,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:44:42,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:42,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:43,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:43,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:43,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:43,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:43,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... [2019-01-12 03:44:43,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:44:43,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:44:43,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:44:43,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:44:43,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:44:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:44:43,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:44:47,312 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:44:47,314 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:44:47,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:44:47 BoogieIcfgContainer [2019-01-12 03:44:47,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:44:47,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:44:47,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:44:47,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:44:47,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:44:41" (1/3) ... [2019-01-12 03:44:47,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd3309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:44:47, skipping insertion in model container [2019-01-12 03:44:47,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:44:42" (2/3) ... [2019-01-12 03:44:47,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd3309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:44:47, skipping insertion in model container [2019-01-12 03:44:47,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:44:47" (3/3) ... [2019-01-12 03:44:47,334 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label57_true-unreach-call.c [2019-01-12 03:44:47,347 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:44:47,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:44:47,378 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:44:47,420 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:44:47,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:44:47,421 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:44:47,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:44:47,421 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:44:47,421 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:44:47,422 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:44:47,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:44:47,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:44:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:44:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 03:44:47,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:47,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:47,459 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:47,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:47,465 INFO L82 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2019-01-12 03:44:47,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:47,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:47,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:47,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:47,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:44:48,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:48,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:44:48,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:44:48,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:44:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:48,043 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:44:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:52,003 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-01-12 03:44:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:44:52,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-01-12 03:44:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:52,027 INFO L225 Difference]: With dead ends: 966 [2019-01-12 03:44:52,027 INFO L226 Difference]: Without dead ends: 616 [2019-01-12 03:44:52,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-01-12 03:44:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-01-12 03:44:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-01-12 03:44:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-01-12 03:44:52,135 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 46 [2019-01-12 03:44:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:52,136 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-01-12 03:44:52,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:44:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-01-12 03:44:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 03:44:52,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:52,141 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:52,142 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1553487167, now seen corresponding path program 1 times [2019-01-12 03:44:52,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:52,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:52,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:52,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:52,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:44:52,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:52,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:44:52,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:44:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:44:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:52,414 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-01-12 03:44:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:55,179 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-01-12 03:44:55,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:44:55,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-01-12 03:44:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:55,195 INFO L225 Difference]: With dead ends: 2309 [2019-01-12 03:44:55,195 INFO L226 Difference]: Without dead ends: 1711 [2019-01-12 03:44:55,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-01-12 03:44:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1527. [2019-01-12 03:44:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-01-12 03:44:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2032 transitions. [2019-01-12 03:44:55,291 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2032 transitions. Word has length 117 [2019-01-12 03:44:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:55,291 INFO L480 AbstractCegarLoop]: Abstraction has 1527 states and 2032 transitions. [2019-01-12 03:44:55,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:44:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2032 transitions. [2019-01-12 03:44:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-12 03:44:55,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:55,296 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:55,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash 624671770, now seen corresponding path program 1 times [2019-01-12 03:44:55,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:55,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:55,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:44:55,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:55,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:44:55,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:44:55,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:44:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:55,626 INFO L87 Difference]: Start difference. First operand 1527 states and 2032 transitions. Second operand 4 states. [2019-01-12 03:44:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:58,611 INFO L93 Difference]: Finished difference Result 5088 states and 6913 transitions. [2019-01-12 03:44:58,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:44:58,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-01-12 03:44:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:58,629 INFO L225 Difference]: With dead ends: 5088 [2019-01-12 03:44:58,630 INFO L226 Difference]: Without dead ends: 3563 [2019-01-12 03:44:58,633 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 03:44:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-01-12 03:44:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2447. [2019-01-12 03:44:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-01-12 03:44:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-01-12 03:44:58,688 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 130 [2019-01-12 03:44:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:58,689 INFO L480 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-01-12 03:44:58,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:44:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-01-12 03:44:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-01-12 03:44:58,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:58,692 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:58,692 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash 383208159, now seen corresponding path program 1 times [2019-01-12 03:44:58,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:58,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:44:59,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:59,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:44:59,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:44:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:44:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:59,114 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 5 states. [2019-01-12 03:45:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:03,527 INFO L93 Difference]: Finished difference Result 8049 states and 10315 transitions. [2019-01-12 03:45:03,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:45:03,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-01-12 03:45:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:03,553 INFO L225 Difference]: With dead ends: 8049 [2019-01-12 03:45:03,553 INFO L226 Difference]: Without dead ends: 5788 [2019-01-12 03:45:03,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:45:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2019-01-12 03:45:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5787. [2019-01-12 03:45:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-01-12 03:45:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7107 transitions. [2019-01-12 03:45:03,669 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7107 transitions. Word has length 173 [2019-01-12 03:45:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:03,669 INFO L480 AbstractCegarLoop]: Abstraction has 5787 states and 7107 transitions. [2019-01-12 03:45:03,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:45:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7107 transitions. [2019-01-12 03:45:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-01-12 03:45:03,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:45:03,681 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:45:03,681 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:45:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:45:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1602503085, now seen corresponding path program 1 times [2019-01-12 03:45:03,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:45:03,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:45:03,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:03,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 03:45:04,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:45:04,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:45:04,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:45:04,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:45:04,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:45:04,214 INFO L87 Difference]: Start difference. First operand 5787 states and 7107 transitions. Second operand 4 states. [2019-01-12 03:45:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:06,040 INFO L93 Difference]: Finished difference Result 13801 states and 17074 transitions. [2019-01-12 03:45:06,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:45:06,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-01-12 03:45:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:06,076 INFO L225 Difference]: With dead ends: 13801 [2019-01-12 03:45:06,076 INFO L226 Difference]: Without dead ends: 8200 [2019-01-12 03:45:06,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:45:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2019-01-12 03:45:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 7995. [2019-01-12 03:45:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7995 states. [2019-01-12 03:45:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7995 states to 7995 states and 9579 transitions. [2019-01-12 03:45:06,261 INFO L78 Accepts]: Start accepts. Automaton has 7995 states and 9579 transitions. Word has length 309 [2019-01-12 03:45:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:06,262 INFO L480 AbstractCegarLoop]: Abstraction has 7995 states and 9579 transitions. [2019-01-12 03:45:06,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:45:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7995 states and 9579 transitions. [2019-01-12 03:45:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-01-12 03:45:06,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:45:06,283 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:45:06,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:45:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:45:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -606468400, now seen corresponding path program 1 times [2019-01-12 03:45:06,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:45:06,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:45:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:06,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:06,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-12 03:45:06,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:45:06,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:45:06,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:45:06,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:45:06,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:45:06,740 INFO L87 Difference]: Start difference. First operand 7995 states and 9579 transitions. Second operand 4 states. [2019-01-12 03:45:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:09,131 INFO L93 Difference]: Finished difference Result 20621 states and 24840 transitions. [2019-01-12 03:45:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:45:09,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-01-12 03:45:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:09,185 INFO L225 Difference]: With dead ends: 20621 [2019-01-12 03:45:09,186 INFO L226 Difference]: Without dead ends: 12812 [2019-01-12 03:45:09,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:45:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-01-12 03:45:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 8539. [2019-01-12 03:45:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8539 states. [2019-01-12 03:45:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8539 states to 8539 states and 10160 transitions. [2019-01-12 03:45:09,365 INFO L78 Accepts]: Start accepts. Automaton has 8539 states and 10160 transitions. Word has length 332 [2019-01-12 03:45:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:09,366 INFO L480 AbstractCegarLoop]: Abstraction has 8539 states and 10160 transitions. [2019-01-12 03:45:09,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:45:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8539 states and 10160 transitions. [2019-01-12 03:45:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-01-12 03:45:09,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:45:09,380 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:45:09,380 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:45:09,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:45:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1478199095, now seen corresponding path program 1 times [2019-01-12 03:45:09,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:45:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:45:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:09,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-01-12 03:45:09,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:45:09,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:45:09,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:45:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:45:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:45:09,657 INFO L87 Difference]: Start difference. First operand 8539 states and 10160 transitions. Second operand 3 states. [2019-01-12 03:45:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:10,748 INFO L93 Difference]: Finished difference Result 17255 states and 20563 transitions. [2019-01-12 03:45:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:45:10,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-01-12 03:45:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:10,767 INFO L225 Difference]: With dead ends: 17255 [2019-01-12 03:45:10,767 INFO L226 Difference]: Without dead ends: 9826 [2019-01-12 03:45:10,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:45:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-01-12 03:45:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 6874. [2019-01-12 03:45:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-01-12 03:45:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 8202 transitions. [2019-01-12 03:45:10,887 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 8202 transitions. Word has length 338 [2019-01-12 03:45:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:10,888 INFO L480 AbstractCegarLoop]: Abstraction has 6874 states and 8202 transitions. [2019-01-12 03:45:10,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:45:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 8202 transitions. [2019-01-12 03:45:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-01-12 03:45:10,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:45:10,900 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:45:10,901 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:45:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:45:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1497380334, now seen corresponding path program 1 times [2019-01-12 03:45:10,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:45:10,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:45:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:10,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 44 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:45:11,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:45:11,763 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 03:45:11,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:11,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:45:12,201 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 03:45:12,773 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2019-01-12 03:45:13,318 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-12 03:45:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 15 proven. 214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:45:14,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:45:14,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-01-12 03:45:14,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:45:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:45:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:45:14,598 INFO L87 Difference]: Start difference. First operand 6874 states and 8202 transitions. Second operand 10 states. [2019-01-12 03:45:14,804 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-12 03:45:18,020 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-12 03:45:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:28,506 INFO L93 Difference]: Finished difference Result 26663 states and 32391 transitions. [2019-01-12 03:45:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 03:45:28,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 351 [2019-01-12 03:45:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:28,544 INFO L225 Difference]: With dead ends: 26663 [2019-01-12 03:45:28,545 INFO L226 Difference]: Without dead ends: 17951 [2019-01-12 03:45:28,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2019-01-12 03:45:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17951 states. [2019-01-12 03:45:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17951 to 9257. [2019-01-12 03:45:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9257 states. [2019-01-12 03:45:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9257 states to 9257 states and 10692 transitions. [2019-01-12 03:45:28,800 INFO L78 Accepts]: Start accepts. Automaton has 9257 states and 10692 transitions. Word has length 351 [2019-01-12 03:45:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:28,801 INFO L480 AbstractCegarLoop]: Abstraction has 9257 states and 10692 transitions. [2019-01-12 03:45:28,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:45:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9257 states and 10692 transitions. [2019-01-12 03:45:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-01-12 03:45:28,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:45:28,831 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:45:28,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:45:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:45:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1603876004, now seen corresponding path program 1 times [2019-01-12 03:45:28,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:45:28,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:45:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:28,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:28,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:29,583 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 03:45:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 435 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 03:45:29,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:45:29,894 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 03:45:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:30,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:45:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 03:45:30,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:45:30,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 03:45:30,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:45:30,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:45:30,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:45:30,292 INFO L87 Difference]: Start difference. First operand 9257 states and 10692 transitions. Second operand 7 states. [2019-01-12 03:45:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:34,703 INFO L93 Difference]: Finished difference Result 26250 states and 30175 transitions. [2019-01-12 03:45:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 03:45:34,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 456 [2019-01-12 03:45:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:34,730 INFO L225 Difference]: With dead ends: 26250 [2019-01-12 03:45:34,730 INFO L226 Difference]: Without dead ends: 15891 [2019-01-12 03:45:34,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 03:45:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15891 states. [2019-01-12 03:45:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15891 to 9067. [2019-01-12 03:45:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9067 states. [2019-01-12 03:45:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9067 states to 9067 states and 10079 transitions. [2019-01-12 03:45:34,899 INFO L78 Accepts]: Start accepts. Automaton has 9067 states and 10079 transitions. Word has length 456 [2019-01-12 03:45:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:34,900 INFO L480 AbstractCegarLoop]: Abstraction has 9067 states and 10079 transitions. [2019-01-12 03:45:34,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:45:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9067 states and 10079 transitions. [2019-01-12 03:45:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-01-12 03:45:34,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:45:34,924 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 03:45:34,924 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:45:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:45:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash -734371707, now seen corresponding path program 1 times [2019-01-12 03:45:34,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:45:34,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:45:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:34,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-01-12 03:45:35,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:45:35,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:45:35,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:45:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:45:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:45:35,442 INFO L87 Difference]: Start difference. First operand 9067 states and 10079 transitions. Second operand 4 states. [2019-01-12 03:45:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:36,889 INFO L93 Difference]: Finished difference Result 19435 states and 21614 transitions. [2019-01-12 03:45:36,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:45:36,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-01-12 03:45:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:36,905 INFO L225 Difference]: With dead ends: 19435 [2019-01-12 03:45:36,906 INFO L226 Difference]: Without dead ends: 9999 [2019-01-12 03:45:36,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:45:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2019-01-12 03:45:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 8881. [2019-01-12 03:45:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8881 states. [2019-01-12 03:45:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 9822 transitions. [2019-01-12 03:45:37,064 INFO L78 Accepts]: Start accepts. Automaton has 8881 states and 9822 transitions. Word has length 505 [2019-01-12 03:45:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:37,064 INFO L480 AbstractCegarLoop]: Abstraction has 8881 states and 9822 transitions. [2019-01-12 03:45:37,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:45:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8881 states and 9822 transitions. [2019-01-12 03:45:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-01-12 03:45:37,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:45:37,098 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 03:45:37,098 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:45:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:45:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1159225603, now seen corresponding path program 1 times [2019-01-12 03:45:37,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:45:37,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:45:37,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:37,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:45:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:37,819 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 03:45:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 540 proven. 149 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:45:38,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:45:38,020 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 03:45:38,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:45:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:45:38,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:45:38,418 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 03:45:38,967 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-01-12 03:45:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 453 proven. 236 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:45:40,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:45:40,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-12 03:45:40,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 03:45:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 03:45:40,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-12 03:45:40,123 INFO L87 Difference]: Start difference. First operand 8881 states and 9822 transitions. Second operand 11 states. [2019-01-12 03:45:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:45:49,635 INFO L93 Difference]: Finished difference Result 23338 states and 25621 transitions. [2019-01-12 03:45:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 03:45:49,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 522 [2019-01-12 03:45:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:45:49,638 INFO L225 Difference]: With dead ends: 23338 [2019-01-12 03:45:49,638 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:45:49,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2019-01-12 03:45:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:45:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:45:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:45:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:45:49,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 522 [2019-01-12 03:45:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:45:49,654 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:45:49,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 03:45:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:45:49,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:45:49,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:45:49,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:49,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:49,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:49,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:50,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:50,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:50,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:50,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:50,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:50,893 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 488 DAG size of output: 407 [2019-01-12 03:45:50,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:50,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:45:51,764 WARN L181 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 488 DAG size of output: 407 [2019-01-12 03:46:00,056 WARN L181 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 394 DAG size of output: 157 [2019-01-12 03:46:05,077 WARN L181 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 394 DAG size of output: 157 [2019-01-12 03:46:05,081 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:46:05,081 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:46:05,081 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:46:05,082 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,083 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:46:05,084 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:46:05,084 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:46:05,084 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,084 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (= ~a25~0 12)) (.cse21 (= ~a25~0 13))) (let ((.cse19 (<= 130 ~a29~0)) (.cse6 (exists ((v_prenex_2 Int)) (let ((.cse36 (+ v_prenex_2 69157))) (and (<= (+ ~a29~0 299882) (mod .cse36 299861)) (<= 0 .cse36) (<= 130 v_prenex_2))))) (.cse5 (= 1 ~a3~0)) (.cse7 (= 15 ~a8~0)) (.cse25 (exists ((v_prenex_2 Int)) (let ((.cse35 (+ v_prenex_2 69157))) (and (<= 0 .cse35) (<= 130 v_prenex_2) (<= ~a29~0 (+ (mod .cse35 299861) 300138)))))) (.cse2 (= 1 ~a4~0)) (.cse1 (<= (+ ~a29~0 22) 0)) (.cse30 (<= ~a29~0 140)) (.cse32 (not .cse21)) (.cse16 (<= ~a23~0 138)) (.cse17 (not (= ~a4~0 1))) (.cse31 (< 306 ~a23~0)) (.cse0 (<= 312 ~a23~0)) (.cse23 (<= ~a23~0 312)) (.cse33 (not .cse4)) (.cse24 (< 138 ~a23~0))) (let ((.cse20 (or (and .cse23 .cse0) (and .cse23 .cse33 .cse24))) (.cse8 (= ~a25~0 10)) (.cse26 (or (and .cse31 .cse33) .cse0)) (.cse13 (<= ~a4~0 0)) (.cse12 (or (and .cse16 .cse1 .cse33) (and .cse30 .cse32 .cse16 .cse17))) (.cse9 (and .cse5 .cse32 .cse16 .cse33 .cse7 .cse25 .cse2)) (.cse27 (<= ~a25~0 9)) (.cse18 (<= ~a29~0 277)) (.cse11 (= ~a25~0 9)) (.cse14 (or (and .cse23 .cse5 .cse32 (and .cse33 .cse24 .cse30) .cse7 .cse2) (and .cse4 .cse23 .cse5 .cse6 .cse7 .cse2 .cse24))) (.cse10 (< 0 (+ ~a23~0 43))) (.cse34 (or (and .cse5 (and .cse32 .cse0) .cse7 .cse19) (and .cse5 .cse32 .cse7 .cse33 .cse19))) (.cse22 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (<= ~a29~0 (+ (mod v_prenex_4 299861) 300139)) (< 277 v_prenex_4)))) (.cse15 (or .cse31 .cse16)) (.cse3 (= ~a25~0 11))) (or (or (and .cse0 .cse1 .cse2 .cse3) (and (or (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse1 .cse7 .cse8)) .cse2)) (and .cse9 .cse10 .cse3) (and .cse11 .cse10 .cse12) (and .cse4 .cse13 .cse1) (and .cse14 .cse15) (and (and .cse16 .cse17) .cse18 .cse19) (and .cse20 .cse21 .cse18 .cse2 .cse19) (and .cse8 .cse5 .cse22 .cse15 .cse7 .cse2) (and (and (and .cse23 .cse24) .cse5 .cse7 .cse25) .cse2 .cse3) (and .cse1 .cse16) (and .cse21 (and .cse26 .cse25) .cse5 .cse7 .cse2) (and (and .cse27 .cse2 .cse19) .cse18) (and .cse12 (<= (+ ~a29~0 21) 0)) (and .cse11 .cse10 .cse16 .cse2) (and (and (and .cse8 .cse19) .cse2) .cse18) (and .cse10 (let ((.cse28 (let ((.cse29 (and .cse8 .cse30))) (or (and .cse16 .cse29) (and .cse13 .cse29))))) (or (and .cse1 .cse28) (and .cse15 .cse28)))) (and .cse4 .cse23 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (< 277 v_prenex_4) (<= (+ ~a29~0 299881) (mod v_prenex_4 299861)))) .cse5 .cse7 .cse2 .cse24) (and .cse21 (and .cse20 .cse5 .cse25 .cse19) .cse7 .cse2) (and .cse5 (and .cse4 .cse31) .cse7 .cse18 .cse2 .cse19) (and (<= ~a29~0 599998) .cse32 .cse16 .cse33 .cse19) (and .cse1 .cse21 .cse5 .cse7 .cse2) (and .cse16 .cse2 .cse8) (and (and .cse1 .cse26 .cse2) .cse21) (and .cse4 .cse13 .cse18 .cse19) (and .cse12 .cse3) (and .cse9 .cse27) (and .cse22 (and .cse27 .cse34 .cse2)) (and .cse16 .cse33 .cse18 .cse19) (and .cse11 .cse14) (and (and .cse10 .cse34) .cse22 .cse15 .cse2 .cse3))))) [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:46:05,085 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,086 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,087 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 144) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:46:05,088 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:46:05,089 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,090 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,092 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:46:05,092 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:46:05,092 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:46:05,092 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:46:05,092 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:46:05,092 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:46:05,092 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,093 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:46:05,094 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:46:05,095 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,096 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,097 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,098 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,099 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,100 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,101 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,102 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,103 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,104 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,105 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:46:05,106 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:46:05,107 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:46:05,108 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:46:05,108 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,108 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,108 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse4 (= ~a25~0 12)) (.cse21 (= ~a25~0 13))) (let ((.cse19 (<= 130 ~a29~0)) (.cse6 (exists ((v_prenex_2 Int)) (let ((.cse36 (+ v_prenex_2 69157))) (and (<= (+ ~a29~0 299882) (mod .cse36 299861)) (<= 0 .cse36) (<= 130 v_prenex_2))))) (.cse5 (= 1 ~a3~0)) (.cse7 (= 15 ~a8~0)) (.cse25 (exists ((v_prenex_2 Int)) (let ((.cse35 (+ v_prenex_2 69157))) (and (<= 0 .cse35) (<= 130 v_prenex_2) (<= ~a29~0 (+ (mod .cse35 299861) 300138)))))) (.cse2 (= 1 ~a4~0)) (.cse1 (<= (+ ~a29~0 22) 0)) (.cse30 (<= ~a29~0 140)) (.cse32 (not .cse21)) (.cse16 (<= ~a23~0 138)) (.cse17 (not (= ~a4~0 1))) (.cse31 (< 306 ~a23~0)) (.cse0 (<= 312 ~a23~0)) (.cse23 (<= ~a23~0 312)) (.cse33 (not .cse4)) (.cse24 (< 138 ~a23~0))) (let ((.cse20 (or (and .cse23 .cse0) (and .cse23 .cse33 .cse24))) (.cse8 (= ~a25~0 10)) (.cse26 (or (and .cse31 .cse33) .cse0)) (.cse13 (<= ~a4~0 0)) (.cse12 (or (and .cse16 .cse1 .cse33) (and .cse30 .cse32 .cse16 .cse17))) (.cse9 (and .cse5 .cse32 .cse16 .cse33 .cse7 .cse25 .cse2)) (.cse27 (<= ~a25~0 9)) (.cse18 (<= ~a29~0 277)) (.cse11 (= ~a25~0 9)) (.cse14 (or (and .cse23 .cse5 .cse32 (and .cse33 .cse24 .cse30) .cse7 .cse2) (and .cse4 .cse23 .cse5 .cse6 .cse7 .cse2 .cse24))) (.cse10 (< 0 (+ ~a23~0 43))) (.cse34 (or (and .cse5 (and .cse32 .cse0) .cse7 .cse19) (and .cse5 .cse32 .cse7 .cse33 .cse19))) (.cse22 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (<= ~a29~0 (+ (mod v_prenex_4 299861) 300139)) (< 277 v_prenex_4)))) (.cse15 (or .cse31 .cse16)) (.cse3 (= ~a25~0 11))) (or (or (and .cse0 .cse1 .cse2 .cse3) (and (or (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse1 .cse7 .cse8)) .cse2)) (and .cse9 .cse10 .cse3) (and .cse11 .cse10 .cse12) (and .cse4 .cse13 .cse1) (and .cse14 .cse15) (and (and .cse16 .cse17) .cse18 .cse19) (and .cse20 .cse21 .cse18 .cse2 .cse19) (and .cse8 .cse5 .cse22 .cse15 .cse7 .cse2) (and (and (and .cse23 .cse24) .cse5 .cse7 .cse25) .cse2 .cse3) (and .cse1 .cse16) (and .cse21 (and .cse26 .cse25) .cse5 .cse7 .cse2) (and (and .cse27 .cse2 .cse19) .cse18) (and .cse12 (<= (+ ~a29~0 21) 0)) (and .cse11 .cse10 .cse16 .cse2) (and (and (and .cse8 .cse19) .cse2) .cse18) (and .cse10 (let ((.cse28 (let ((.cse29 (and .cse8 .cse30))) (or (and .cse16 .cse29) (and .cse13 .cse29))))) (or (and .cse1 .cse28) (and .cse15 .cse28)))) (and .cse4 .cse23 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (< 277 v_prenex_4) (<= (+ ~a29~0 299881) (mod v_prenex_4 299861)))) .cse5 .cse7 .cse2 .cse24) (and .cse21 (and .cse20 .cse5 .cse25 .cse19) .cse7 .cse2) (and .cse5 (and .cse4 .cse31) .cse7 .cse18 .cse2 .cse19) (and (<= ~a29~0 599998) .cse32 .cse16 .cse33 .cse19) (and .cse1 .cse21 .cse5 .cse7 .cse2) (and .cse16 .cse2 .cse8) (and (and .cse1 .cse26 .cse2) .cse21) (and .cse4 .cse13 .cse18 .cse19) (and .cse12 .cse3) (and .cse9 .cse27) (and .cse22 (and .cse27 .cse34 .cse2)) (and .cse16 .cse33 .cse18 .cse19) (and .cse11 .cse14) (and (and .cse10 .cse34) .cse22 .cse15 .cse2 .cse3))))) [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,109 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,110 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:46:05,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,198 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,242 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:46:05 BoogieIcfgContainer [2019-01-12 03:46:05,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:46:05,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:46:05,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:46:05,279 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:46:05,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:44:47" (3/4) ... [2019-01-12 03:46:05,286 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:46:05,333 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:46:05,335 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:46:05,380 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((312 <= a23 && a29 + 22 <= 0) && 1 == a4) && a25 == 11) || (((((a25 == 12 && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) || (((1 == a3 && a29 + 22 <= 0) && 15 == a8) && a25 == 10)) && 1 == a4)) || ((((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && 0 < a23 + 43) && a25 == 11)) || ((a25 == 9 && 0 < a23 + 43) && (((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))))) || ((a25 == 12 && a4 <= 0) && a29 + 22 <= 0)) || (((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)) && (306 < a23 || a23 <= 138))) || (((a23 <= 138 && !(a4 == 1)) && a29 <= 277) && 130 <= a29)) || ((((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && a25 == 13) && a29 <= 277) && 1 == a4) && 130 <= a29)) || (((((a25 == 10 && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 15 == a8) && 1 == a4)) || ((((((a23 <= 312 && 138 < a23) && 1 == a3) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 == 11)) || (a29 + 22 <= 0 && a23 <= 138)) || ((((a25 == 13 && ((306 < a23 && !(a25 == 12)) || 312 <= a23) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a29 <= 277)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a29 + 21 <= 0)) || (((a25 == 9 && 0 < a23 + 43) && a23 <= 138) && 1 == a4)) || (((a25 == 10 && 130 <= a29) && 1 == a4) && a29 <= 277)) || (0 < a23 + 43 && ((a29 + 22 <= 0 && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140))) || ((306 < a23 || a23 <= 138) && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140)))))) || ((((((a25 == 12 && a23 <= 312) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && 277 < v_prenex_4) && a29 + 299881 <= v_prenex_4 % 299861)) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a25 == 13 && ((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && 1 == a3) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 130 <= a29) && 15 == a8) && 1 == a4)) || (((((1 == a3 && a25 == 12 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29)) || ((((a29 <= 599998 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 130 <= a29)) || ((((a29 + 22 <= 0 && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a29 + 22 <= 0 && ((306 < a23 && !(a25 == 12)) || 312 <= a23)) && 1 == a4) && a25 == 13)) || (((a25 == 12 && a4 <= 0) && a29 <= 277) && 130 <= a29)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a25 == 11)) || (((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 <= 9)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (a25 <= 9 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && 1 == a4)) || (((a23 <= 138 && !(a25 == 12)) && a29 <= 277) && 130 <= a29)) || (a25 == 9 && ((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)))) || (((((0 < a23 + 43 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 1 == a4) && a25 == 11) [2019-01-12 03:46:05,389 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((312 <= a23 && a29 + 22 <= 0) && 1 == a4) && a25 == 11) || (((((a25 == 12 && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) || (((1 == a3 && a29 + 22 <= 0) && 15 == a8) && a25 == 10)) && 1 == a4)) || ((((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && 0 < a23 + 43) && a25 == 11)) || ((a25 == 9 && 0 < a23 + 43) && (((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))))) || ((a25 == 12 && a4 <= 0) && a29 + 22 <= 0)) || (((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)) && (306 < a23 || a23 <= 138))) || (((a23 <= 138 && !(a4 == 1)) && a29 <= 277) && 130 <= a29)) || ((((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && a25 == 13) && a29 <= 277) && 1 == a4) && 130 <= a29)) || (((((a25 == 10 && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 15 == a8) && 1 == a4)) || ((((((a23 <= 312 && 138 < a23) && 1 == a3) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 == 11)) || (a29 + 22 <= 0 && a23 <= 138)) || ((((a25 == 13 && ((306 < a23 && !(a25 == 12)) || 312 <= a23) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a29 <= 277)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a29 + 21 <= 0)) || (((a25 == 9 && 0 < a23 + 43) && a23 <= 138) && 1 == a4)) || (((a25 == 10 && 130 <= a29) && 1 == a4) && a29 <= 277)) || (0 < a23 + 43 && ((a29 + 22 <= 0 && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140))) || ((306 < a23 || a23 <= 138) && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140)))))) || ((((((a25 == 12 && a23 <= 312) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && 277 < v_prenex_4) && a29 + 299881 <= v_prenex_4 % 299861)) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a25 == 13 && ((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && 1 == a3) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 130 <= a29) && 15 == a8) && 1 == a4)) || (((((1 == a3 && a25 == 12 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29)) || ((((a29 <= 599998 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 130 <= a29)) || ((((a29 + 22 <= 0 && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a29 + 22 <= 0 && ((306 < a23 && !(a25 == 12)) || 312 <= a23)) && 1 == a4) && a25 == 13)) || (((a25 == 12 && a4 <= 0) && a29 <= 277) && 130 <= a29)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a25 == 11)) || (((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 <= 9)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (a25 <= 9 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && 1 == a4)) || (((a23 <= 138 && !(a25 == 12)) && a29 <= 277) && 130 <= a29)) || (a25 == 9 && ((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)))) || (((((0 < a23 + 43 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 1 == a4) && a25 == 11) [2019-01-12 03:46:05,609 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:46:05,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:46:05,610 INFO L168 Benchmark]: Toolchain (without parser) took 83953.02 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 947.3 MB in the beginning and 1.8 GB in the end (delta: -901.4 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:46:05,610 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:46:05,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1118.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -208.8 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:46:05,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:46:05,614 INFO L168 Benchmark]: Boogie Preprocessor took 138.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:46:05,614 INFO L168 Benchmark]: RCFGBuilder took 4203.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:46:05,614 INFO L168 Benchmark]: TraceAbstraction took 77959.44 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 989.3 MB). Free memory was 951.6 MB in the beginning and 1.9 GB in the end (delta: -948.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-12 03:46:05,615 INFO L168 Benchmark]: Witness Printer took 330.61 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:46:05,619 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.18 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 1118.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -208.8 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 195.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4203.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 951.6 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77959.44 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 989.3 MB). Free memory was 951.6 MB in the beginning and 1.9 GB in the end (delta: -948.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 330.61 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-01-12 03:46:05,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,657 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,657 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,660 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,660 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((312 <= a23 && a29 + 22 <= 0) && 1 == a4) && a25 == 11) || (((((a25 == 12 && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) || (((1 == a3 && a29 + 22 <= 0) && 15 == a8) && a25 == 10)) && 1 == a4)) || ((((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && 0 < a23 + 43) && a25 == 11)) || ((a25 == 9 && 0 < a23 + 43) && (((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))))) || ((a25 == 12 && a4 <= 0) && a29 + 22 <= 0)) || (((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)) && (306 < a23 || a23 <= 138))) || (((a23 <= 138 && !(a4 == 1)) && a29 <= 277) && 130 <= a29)) || ((((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && a25 == 13) && a29 <= 277) && 1 == a4) && 130 <= a29)) || (((((a25 == 10 && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 15 == a8) && 1 == a4)) || ((((((a23 <= 312 && 138 < a23) && 1 == a3) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 == 11)) || (a29 + 22 <= 0 && a23 <= 138)) || ((((a25 == 13 && ((306 < a23 && !(a25 == 12)) || 312 <= a23) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a29 <= 277)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a29 + 21 <= 0)) || (((a25 == 9 && 0 < a23 + 43) && a23 <= 138) && 1 == a4)) || (((a25 == 10 && 130 <= a29) && 1 == a4) && a29 <= 277)) || (0 < a23 + 43 && ((a29 + 22 <= 0 && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140))) || ((306 < a23 || a23 <= 138) && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140)))))) || ((((((a25 == 12 && a23 <= 312) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && 277 < v_prenex_4) && a29 + 299881 <= v_prenex_4 % 299861)) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a25 == 13 && ((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && 1 == a3) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 130 <= a29) && 15 == a8) && 1 == a4)) || (((((1 == a3 && a25 == 12 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29)) || ((((a29 <= 599998 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 130 <= a29)) || ((((a29 + 22 <= 0 && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a29 + 22 <= 0 && ((306 < a23 && !(a25 == 12)) || 312 <= a23)) && 1 == a4) && a25 == 13)) || (((a25 == 12 && a4 <= 0) && a29 <= 277) && 130 <= a29)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a25 == 11)) || (((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 <= 9)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (a25 <= 9 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && 1 == a4)) || (((a23 <= 138 && !(a25 == 12)) && a29 <= 277) && 130 <= a29)) || (a25 == 9 && ((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)))) || (((((0 < a23 + 43 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 1 == a4) && a25 == 11) - InvariantResult [Line: 22]: Loop Invariant [2019-01-12 03:46:05,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,683 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:46:05,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-01-12 03:46:05,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((312 <= a23 && a29 + 22 <= 0) && 1 == a4) && a25 == 11) || (((((a25 == 12 && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) || (((1 == a3 && a29 + 22 <= 0) && 15 == a8) && a25 == 10)) && 1 == a4)) || ((((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && 0 < a23 + 43) && a25 == 11)) || ((a25 == 9 && 0 < a23 + 43) && (((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))))) || ((a25 == 12 && a4 <= 0) && a29 + 22 <= 0)) || (((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)) && (306 < a23 || a23 <= 138))) || (((a23 <= 138 && !(a4 == 1)) && a29 <= 277) && 130 <= a29)) || ((((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && a25 == 13) && a29 <= 277) && 1 == a4) && 130 <= a29)) || (((((a25 == 10 && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 15 == a8) && 1 == a4)) || ((((((a23 <= 312 && 138 < a23) && 1 == a3) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 == 11)) || (a29 + 22 <= 0 && a23 <= 138)) || ((((a25 == 13 && ((306 < a23 && !(a25 == 12)) || 312 <= a23) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a3) && 15 == a8) && 1 == a4)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a29 <= 277)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a29 + 21 <= 0)) || (((a25 == 9 && 0 < a23 + 43) && a23 <= 138) && 1 == a4)) || (((a25 == 10 && 130 <= a29) && 1 == a4) && a29 <= 277)) || (0 < a23 + 43 && ((a29 + 22 <= 0 && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140))) || ((306 < a23 || a23 <= 138) && ((a23 <= 138 && a25 == 10 && a29 <= 140) || (a4 <= 0 && a25 == 10 && a29 <= 140)))))) || ((((((a25 == 12 && a23 <= 312) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && 277 < v_prenex_4) && a29 + 299881 <= v_prenex_4 % 299861)) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a25 == 13 && ((((a23 <= 312 && 312 <= a23) || ((a23 <= 312 && !(a25 == 12)) && 138 < a23)) && 1 == a3) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 130 <= a29) && 15 == a8) && 1 == a4)) || (((((1 == a3 && a25 == 12 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 130 <= a29)) || ((((a29 <= 599998 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 130 <= a29)) || ((((a29 + 22 <= 0 && a25 == 13) && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a29 + 22 <= 0 && ((306 < a23 && !(a25 == 12)) || 312 <= a23)) && 1 == a4) && a25 == 13)) || (((a25 == 12 && a4 <= 0) && a29 <= 277) && 130 <= a29)) || ((((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12)) || (((a29 <= 140 && !(a25 == 13)) && a23 <= 138) && !(a4 == 1))) && a25 == 11)) || (((((((1 == a3 && !(a25 == 13)) && a23 <= 138) && !(a25 == 12)) && 15 == a8) && (\exists v_prenex_2 : int :: (0 <= v_prenex_2 + 69157 && 130 <= v_prenex_2) && a29 <= (v_prenex_2 + 69157) % 299861 + 300138)) && 1 == a4) && a25 <= 9)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (a25 <= 9 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && 1 == a4)) || (((a23 <= 138 && !(a25 == 12)) && a29 <= 277) && 130 <= a29)) || (a25 == 9 && ((((((a23 <= 312 && 1 == a3) && !(a25 == 13)) && (!(a25 == 12) && 138 < a23) && a29 <= 140) && 15 == a8) && 1 == a4) || ((((((a25 == 12 && a23 <= 312) && 1 == a3) && (\exists v_prenex_2 : int :: (a29 + 299882 <= (v_prenex_2 + 69157) % 299861 && 0 <= v_prenex_2 + 69157) && 130 <= v_prenex_2)) && 15 == a8) && 1 == a4) && 138 < a23)))) || (((((0 < a23 + 43 && ((((1 == a3 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 130 <= a29) || ((((1 == a3 && !(a25 == 13)) && 15 == a8) && !(a25 == 12)) && 130 <= a29))) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && (306 < a23 || a23 <= 138)) && 1 == a4) && a25 == 11) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 77.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 49.1s AutomataDifference, 0.0s DeadEndRemovalTime, 15.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1312 SDtfs, 11095 SDslu, 814 SDs, 0 SdLazy, 24295 SolverSat, 6416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1431 GetRequests, 1350 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9257occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 25383 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 206 NumberOfFragments, 2105 HoareAnnotationTreeSize, 3 FomulaSimplifications, 32076 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 33128 FormulaSimplificationTreeSizeReductionInter, 13.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 4608 NumberOfCodeBlocks, 4608 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4594 ConstructedInterpolants, 354 QuantifiedInterpolants, 10200971 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1701 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 4171/4958 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...