./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label46_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem15_label46_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 0625ff07812b5aaa146593f6672735f97b29427f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:36:23,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:36:23,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:36:23,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:36:23,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:36:23,276 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:36:23,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:36:23,279 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:36:23,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:36:23,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:36:23,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:36:23,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:36:23,284 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:36:23,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:36:23,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:36:23,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:36:23,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:36:23,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:36:23,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:36:23,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:36:23,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:36:23,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:36:23,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:36:23,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:36:23,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:36:23,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:36:23,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:36:23,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:36:23,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:36:23,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:36:23,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:36:23,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:36:23,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:36:23,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:36:23,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:36:23,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:36:23,307 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:36:23,328 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:36:23,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:36:23,330 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:36:23,330 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:36:23,330 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:36:23,330 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:36:23,330 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:36:23,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:36:23,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:36:23,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:36:23,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:36:23,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:36:23,334 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:36:23,334 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:36:23,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:36:23,334 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:36:23,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:36:23,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:36:23,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:36:23,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:36:23,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:36:23,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:36:23,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:36:23,336 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:36:23,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:36:23,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:36:23,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:36:23,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:36:23,338 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 -> 0625ff07812b5aaa146593f6672735f97b29427f [2019-01-12 04:36:23,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:36:23,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:36:23,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:36:23,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:36:23,420 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:36:23,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label46_true-unreach-call.c [2019-01-12 04:36:23,479 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac9e38bb/4442be187ca34e348d0bb674c4d89a04/FLAG9e7a761b3 [2019-01-12 04:36:24,180 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:36:24,181 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label46_true-unreach-call.c [2019-01-12 04:36:24,209 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac9e38bb/4442be187ca34e348d0bb674c4d89a04/FLAG9e7a761b3 [2019-01-12 04:36:24,291 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac9e38bb/4442be187ca34e348d0bb674c4d89a04 [2019-01-12 04:36:24,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:36:24,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:36:24,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:36:24,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:36:24,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:36:24,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:36:24" (1/1) ... [2019-01-12 04:36:24,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b175b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:24, skipping insertion in model container [2019-01-12 04:36:24,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:36:24" (1/1) ... [2019-01-12 04:36:24,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:36:24,420 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:36:25,268 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:36:25,280 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:36:25,655 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:36:25,678 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:36:25,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25 WrapperNode [2019-01-12 04:36:25,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:36:25,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:36:25,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:36:25,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:36:25,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:25,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 04:36:25" (1/1) ... [2019-01-12 04:36:25,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:36:25,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:36:25,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:36:25,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:36:26,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:26,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:26,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:26,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:26,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:26,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:26,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... [2019-01-12 04:36:26,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:36:26,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:36:26,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:36:26,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:36:26,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:36:26,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:36:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:36:33,584 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:36:33,584 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:36:33,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:36:33 BoogieIcfgContainer [2019-01-12 04:36:33,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:36:33,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:36:33,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:36:33,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:36:33,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:36:24" (1/3) ... [2019-01-12 04:36:33,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc49cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:36:33, skipping insertion in model container [2019-01-12 04:36:33,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:25" (2/3) ... [2019-01-12 04:36:33,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc49cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:36:33, skipping insertion in model container [2019-01-12 04:36:33,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:36:33" (3/3) ... [2019-01-12 04:36:33,594 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label46_true-unreach-call.c [2019-01-12 04:36:33,603 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:36:33,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:36:33,628 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:36:33,668 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:36:33,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:36:33,669 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:36:33,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:36:33,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:36:33,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:36:33,669 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:36:33,670 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:36:33,670 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:36:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:36:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 04:36:33,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:33,711 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] [2019-01-12 04:36:33,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash 712930081, now seen corresponding path program 1 times [2019-01-12 04:36:33,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:33,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:33,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:33,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:33,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:34,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:34,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:34,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:34,153 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:36:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:39,144 INFO L93 Difference]: Finished difference Result 1469 states and 2719 transitions. [2019-01-12 04:36:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:39,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-12 04:36:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:39,174 INFO L225 Difference]: With dead ends: 1469 [2019-01-12 04:36:39,174 INFO L226 Difference]: Without dead ends: 978 [2019-01-12 04:36:39,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-01-12 04:36:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-01-12 04:36:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-01-12 04:36:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1489 transitions. [2019-01-12 04:36:39,278 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1489 transitions. Word has length 43 [2019-01-12 04:36:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:39,278 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1489 transitions. [2019-01-12 04:36:39,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1489 transitions. [2019-01-12 04:36:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-12 04:36:39,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:39,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:39,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash 520359049, now seen corresponding path program 1 times [2019-01-12 04:36:39,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:39,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:39,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:39,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:39,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:39,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:39,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:39,660 INFO L87 Difference]: Start difference. First operand 974 states and 1489 transitions. Second operand 4 states. [2019-01-12 04:36:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:45,038 INFO L93 Difference]: Finished difference Result 3748 states and 5754 transitions. [2019-01-12 04:36:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:45,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-01-12 04:36:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:45,060 INFO L225 Difference]: With dead ends: 3748 [2019-01-12 04:36:45,061 INFO L226 Difference]: Without dead ends: 2776 [2019-01-12 04:36:45,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-01-12 04:36:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1873. [2019-01-12 04:36:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-01-12 04:36:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-01-12 04:36:45,129 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 162 [2019-01-12 04:36:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:45,134 INFO L480 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-01-12 04:36:45,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-01-12 04:36:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-12 04:36:45,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:45,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:45,156 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:45,158 INFO L82 PathProgramCache]: Analyzing trace with hash -825944738, now seen corresponding path program 1 times [2019-01-12 04:36:45,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:45,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:45,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-12 04:36:45,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:45,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:36:45,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:45,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:46,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:46,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:36:46,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:46,032 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 4 states. [2019-01-12 04:36:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:54,256 INFO L93 Difference]: Finished difference Result 5542 states and 7245 transitions. [2019-01-12 04:36:54,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:54,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-01-12 04:36:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:54,280 INFO L225 Difference]: With dead ends: 5542 [2019-01-12 04:36:54,281 INFO L226 Difference]: Without dead ends: 3671 [2019-01-12 04:36:54,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 313 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 04:36:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-01-12 04:36:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 1873. [2019-01-12 04:36:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-01-12 04:36:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-01-12 04:36:54,335 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 313 [2019-01-12 04:36:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:54,336 INFO L480 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-01-12 04:36:54,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-01-12 04:36:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-12 04:36:54,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:54,343 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:54,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1270932647, now seen corresponding path program 1 times [2019-01-12 04:36:54,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:54,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:54,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:54,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:55,002 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:36:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-12 04:36:55,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:55,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:55,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:36:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:36:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:55,325 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 5 states. [2019-01-12 04:36:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:59,488 INFO L93 Difference]: Finished difference Result 4643 states and 5995 transitions. [2019-01-12 04:36:59,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:59,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2019-01-12 04:36:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:59,504 INFO L225 Difference]: With dead ends: 4643 [2019-01-12 04:36:59,505 INFO L226 Difference]: Without dead ends: 2772 [2019-01-12 04:36:59,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-01-12 04:36:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2472. [2019-01-12 04:36:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-01-12 04:36:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3150 transitions. [2019-01-12 04:36:59,557 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3150 transitions. Word has length 320 [2019-01-12 04:36:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:59,557 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3150 transitions. [2019-01-12 04:36:59,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:36:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3150 transitions. [2019-01-12 04:36:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-01-12 04:36:59,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:59,566 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:59,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:59,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1821242183, now seen corresponding path program 1 times [2019-01-12 04:36:59,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:59,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:59,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:37:00,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:00,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:37:00,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:00,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:37:01,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:37:01,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:37:01,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:37:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:37:01,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:37:01,059 INFO L87 Difference]: Start difference. First operand 2472 states and 3150 transitions. Second operand 9 states. [2019-01-12 04:37:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:12,573 INFO L93 Difference]: Finished difference Result 6484 states and 8162 transitions. [2019-01-12 04:37:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:37:12,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 394 [2019-01-12 04:37:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:12,594 INFO L225 Difference]: With dead ends: 6484 [2019-01-12 04:37:12,594 INFO L226 Difference]: Without dead ends: 4014 [2019-01-12 04:37:12,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 397 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:37:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2019-01-12 04:37:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 3374. [2019-01-12 04:37:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3374 states. [2019-01-12 04:37:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4043 transitions. [2019-01-12 04:37:12,667 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4043 transitions. Word has length 394 [2019-01-12 04:37:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:12,668 INFO L480 AbstractCegarLoop]: Abstraction has 3374 states and 4043 transitions. [2019-01-12 04:37:12,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:37:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4043 transitions. [2019-01-12 04:37:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-01-12 04:37:12,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:12,678 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:12,678 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash -908430313, now seen corresponding path program 1 times [2019-01-12 04:37:12,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:12,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:12,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:12,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 04:37:13,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:13,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:13,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:13,084 INFO L87 Difference]: Start difference. First operand 3374 states and 4043 transitions. Second operand 4 states. [2019-01-12 04:37:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:16,691 INFO L93 Difference]: Finished difference Result 7347 states and 8879 transitions. [2019-01-12 04:37:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:16,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-01-12 04:37:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:16,710 INFO L225 Difference]: With dead ends: 7347 [2019-01-12 04:37:16,710 INFO L226 Difference]: Without dead ends: 3975 [2019-01-12 04:37:16,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-01-12 04:37:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3973. [2019-01-12 04:37:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2019-01-12 04:37:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 4669 transitions. [2019-01-12 04:37:16,795 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 4669 transitions. Word has length 412 [2019-01-12 04:37:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:16,796 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 4669 transitions. [2019-01-12 04:37:16,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 4669 transitions. [2019-01-12 04:37:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-01-12 04:37:16,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:16,804 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:16,804 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash -299601891, now seen corresponding path program 1 times [2019-01-12 04:37:16,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:16,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:16,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:16,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:16,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:37:17,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:17,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:37:17,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:37:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:37:17,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:17,339 INFO L87 Difference]: Start difference. First operand 3973 states and 4669 transitions. Second operand 3 states. [2019-01-12 04:37:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:20,988 INFO L93 Difference]: Finished difference Result 9737 states and 11652 transitions. [2019-01-12 04:37:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:20,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-01-12 04:37:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:21,011 INFO L225 Difference]: With dead ends: 9737 [2019-01-12 04:37:21,012 INFO L226 Difference]: Without dead ends: 5766 [2019-01-12 04:37:21,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-01-12 04:37:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5766. [2019-01-12 04:37:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5766 states. [2019-01-12 04:37:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 6845 transitions. [2019-01-12 04:37:21,133 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 6845 transitions. Word has length 507 [2019-01-12 04:37:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:21,134 INFO L480 AbstractCegarLoop]: Abstraction has 5766 states and 6845 transitions. [2019-01-12 04:37:21,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 6845 transitions. [2019-01-12 04:37:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-01-12 04:37:21,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:21,144 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:21,144 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1367354222, now seen corresponding path program 1 times [2019-01-12 04:37:21,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:21,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:21,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:21,964 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:37:22,291 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:37:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 614 proven. 3 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-12 04:37:23,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:23,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:37:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:23,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 578 proven. 39 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-12 04:37:24,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:37:24,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-12 04:37:24,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:37:24,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:37:24,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:37:24,061 INFO L87 Difference]: Start difference. First operand 5766 states and 6845 transitions. Second operand 9 states. [2019-01-12 04:37:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:31,890 INFO L93 Difference]: Finished difference Result 16170 states and 18948 transitions. [2019-01-12 04:37:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:37:31,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 598 [2019-01-12 04:37:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:31,940 INFO L225 Difference]: With dead ends: 16170 [2019-01-12 04:37:31,941 INFO L226 Difference]: Without dead ends: 7559 [2019-01-12 04:37:31,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 595 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:37:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2019-01-12 04:37:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 5465. [2019-01-12 04:37:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2019-01-12 04:37:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 5917 transitions. [2019-01-12 04:37:32,084 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 5917 transitions. Word has length 598 [2019-01-12 04:37:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:32,085 INFO L480 AbstractCegarLoop]: Abstraction has 5465 states and 5917 transitions. [2019-01-12 04:37:32,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:37:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 5917 transitions. [2019-01-12 04:37:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2019-01-12 04:37:32,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:32,182 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:32,183 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1029079268, now seen corresponding path program 1 times [2019-01-12 04:37:32,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:32,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:32,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:32,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:32,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-01-12 04:37:32,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:32,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:37:32,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:37:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:37:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:32,685 INFO L87 Difference]: Start difference. First operand 5465 states and 5917 transitions. Second operand 3 states. [2019-01-12 04:37:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:35,840 INFO L93 Difference]: Finished difference Result 10926 states and 11830 transitions. [2019-01-12 04:37:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:35,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 640 [2019-01-12 04:37:35,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:35,852 INFO L225 Difference]: With dead ends: 10926 [2019-01-12 04:37:35,853 INFO L226 Difference]: Without dead ends: 5463 [2019-01-12 04:37:35,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-01-12 04:37:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5463. [2019-01-12 04:37:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-01-12 04:37:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 5913 transitions. [2019-01-12 04:37:35,941 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 5913 transitions. Word has length 640 [2019-01-12 04:37:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:35,942 INFO L480 AbstractCegarLoop]: Abstraction has 5463 states and 5913 transitions. [2019-01-12 04:37:35,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 5913 transitions. [2019-01-12 04:37:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-01-12 04:37:35,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:35,951 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:35,952 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash 777769454, now seen corresponding path program 1 times [2019-01-12 04:37:35,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:35,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:35,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:35,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:36,572 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 04:37:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:37:37,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:37,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:37,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:37,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:37,031 INFO L87 Difference]: Start difference. First operand 5463 states and 5913 transitions. Second operand 4 states. [2019-01-12 04:37:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:38,950 INFO L93 Difference]: Finished difference Result 11785 states and 12617 transitions. [2019-01-12 04:37:38,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:38,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 668 [2019-01-12 04:37:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:38,965 INFO L225 Difference]: With dead ends: 11785 [2019-01-12 04:37:38,966 INFO L226 Difference]: Without dead ends: 5726 [2019-01-12 04:37:38,972 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 04:37:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2019-01-12 04:37:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 4525. [2019-01-12 04:37:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4525 states. [2019-01-12 04:37:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 4711 transitions. [2019-01-12 04:37:39,045 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 4711 transitions. Word has length 668 [2019-01-12 04:37:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:39,047 INFO L480 AbstractCegarLoop]: Abstraction has 4525 states and 4711 transitions. [2019-01-12 04:37:39,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 4711 transitions. [2019-01-12 04:37:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-01-12 04:37:39,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:39,056 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:39,056 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:39,058 INFO L82 PathProgramCache]: Analyzing trace with hash -694194177, now seen corresponding path program 1 times [2019-01-12 04:37:39,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:39,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:39,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:37:39,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:39,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:39,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:39,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:39,641 INFO L87 Difference]: Start difference. First operand 4525 states and 4711 transitions. Second operand 4 states. [2019-01-12 04:37:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:41,704 INFO L93 Difference]: Finished difference Result 13539 states and 14173 transitions. [2019-01-12 04:37:41,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:41,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 675 [2019-01-12 04:37:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:41,718 INFO L225 Difference]: With dead ends: 13539 [2019-01-12 04:37:41,718 INFO L226 Difference]: Without dead ends: 9315 [2019-01-12 04:37:41,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9315 states. [2019-01-12 04:37:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9315 to 6320. [2019-01-12 04:37:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2019-01-12 04:37:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 6558 transitions. [2019-01-12 04:37:41,838 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 6558 transitions. Word has length 675 [2019-01-12 04:37:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:41,839 INFO L480 AbstractCegarLoop]: Abstraction has 6320 states and 6558 transitions. [2019-01-12 04:37:41,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 6558 transitions. [2019-01-12 04:37:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2019-01-12 04:37:41,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:41,850 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:41,850 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash 591669497, now seen corresponding path program 1 times [2019-01-12 04:37:41,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:41,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:41,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:42,424 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:37:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 41 proven. 552 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-01-12 04:37:43,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:43,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:37:43,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:43,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:44,006 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 17 [2019-01-12 04:37:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-01-12 04:37:44,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:37:44,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:37:44,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:37:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:37:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:37:44,599 INFO L87 Difference]: Start difference. First operand 6320 states and 6558 transitions. Second operand 7 states. [2019-01-12 04:38:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:33,808 INFO L93 Difference]: Finished difference Result 24638 states and 25681 transitions. [2019-01-12 04:38:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:38:33,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 765 [2019-01-12 04:38:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:33,828 INFO L225 Difference]: With dead ends: 24638 [2019-01-12 04:38:33,828 INFO L226 Difference]: Without dead ends: 18320 [2019-01-12 04:38:33,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 768 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:38:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18320 states. [2019-01-12 04:38:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18320 to 11411. [2019-01-12 04:38:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11411 states. [2019-01-12 04:38:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11411 states to 11411 states and 11919 transitions. [2019-01-12 04:38:34,063 INFO L78 Accepts]: Start accepts. Automaton has 11411 states and 11919 transitions. Word has length 765 [2019-01-12 04:38:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:34,066 INFO L480 AbstractCegarLoop]: Abstraction has 11411 states and 11919 transitions. [2019-01-12 04:38:34,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:38:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11411 states and 11919 transitions. [2019-01-12 04:38:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2019-01-12 04:38:34,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:34,102 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-01-12 04:38:34,104 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash -796770808, now seen corresponding path program 1 times [2019-01-12 04:38:34,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:34,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:34,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:34,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-01-12 04:38:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:38:34,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:38:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:38:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:34,819 INFO L87 Difference]: Start difference. First operand 11411 states and 11919 transitions. Second operand 3 states. [2019-01-12 04:38:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:35,913 INFO L93 Difference]: Finished difference Result 21019 states and 21908 transitions. [2019-01-12 04:38:35,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:38:35,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 899 [2019-01-12 04:38:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:35,927 INFO L225 Difference]: With dead ends: 21019 [2019-01-12 04:38:35,928 INFO L226 Difference]: Without dead ends: 9909 [2019-01-12 04:38:35,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9909 states. [2019-01-12 04:38:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9909 to 9012. [2019-01-12 04:38:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9012 states. [2019-01-12 04:38:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 9356 transitions. [2019-01-12 04:38:36,126 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 9356 transitions. Word has length 899 [2019-01-12 04:38:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:36,127 INFO L480 AbstractCegarLoop]: Abstraction has 9012 states and 9356 transitions. [2019-01-12 04:38:36,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:38:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 9356 transitions. [2019-01-12 04:38:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2019-01-12 04:38:36,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:36,240 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:38:36,245 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:36,246 INFO L82 PathProgramCache]: Analyzing trace with hash -180599612, now seen corresponding path program 1 times [2019-01-12 04:38:36,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:36,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:36,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1450 backedges. 996 proven. 266 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-01-12 04:38:37,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:38:37,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:38:37,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:37,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:38:44,447 WARN L181 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 1793 DAG size of output: 36 [2019-01-12 04:38:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1450 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2019-01-12 04:38:45,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:38:45,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-01-12 04:38:45,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:38:45,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:38:45,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:38:45,163 INFO L87 Difference]: Start difference. First operand 9012 states and 9356 transitions. Second operand 11 states. [2019-01-12 04:39:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:39:28,636 INFO L93 Difference]: Finished difference Result 30372 states and 31667 transitions. [2019-01-12 04:39:28,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 04:39:28,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 920 [2019-01-12 04:39:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:39:28,638 INFO L225 Difference]: With dead ends: 30372 [2019-01-12 04:39:28,638 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:39:28,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 973 GetRequests, 942 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2019-01-12 04:39:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:39:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:39:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:39:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:39:28,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 920 [2019-01-12 04:39:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:39:28,654 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:39:28,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:39:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:39:28,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:39:28,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:39:28,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:28,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,451 WARN L181 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 402 DAG size of output: 349 [2019-01-12 04:39:29,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:29,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,038 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 402 DAG size of output: 349 [2019-01-12 04:39:30,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:39:30,352 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 297 [2019-01-12 04:39:33,807 WARN L181 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 339 DAG size of output: 116 [2019-01-12 04:39:36,389 WARN L181 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 339 DAG size of output: 115 [2019-01-12 04:39:40,222 WARN L181 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 290 DAG size of output: 113 [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,225 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,226 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:39:40,227 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,228 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:39:40,229 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,233 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:39:40,234 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,235 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,236 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,238 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,238 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,238 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:39:40,238 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:39:40,238 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,238 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,238 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:39:40,239 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,240 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:39:40,241 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,241 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,246 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,246 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:39:40,247 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,248 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:39:40,249 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:39:40,250 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,251 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:39:40,252 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:39:40,253 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,254 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,255 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,262 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,262 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse17 (+ ~a0~0 44))) (let ((.cse10 (+ ~a0~0 61)) (.cse4 (<= (+ ~a4~0 86) 0)) (.cse16 (<= 0 .cse17)) (.cse3 (= ~a2~0 2))) (let ((.cse9 (let ((.cse21 (not .cse3))) (or (and .cse4 .cse21) (and (< 0 .cse10) .cse4) (and .cse21 .cse16)))) (.cse0 (<= (+ ~a4~0 42) 0))) (let ((.cse1 (<= (+ ~a0~0 99) 0)) (.cse2 (= ~a2~0 3)) (.cse14 (and (not (= 5 ~a2~0)) .cse9 .cse0)) (.cse13 (not (= 4 ~a2~0))) (.cse18 (< 0 (+ ~a29~0 144))) (.cse11 (<= 0 (+ ~a0~0 599999))) (.cse15 (exists ((v_prenex_3 Int)) (let ((.cse19 (* 9 v_prenex_3))) (let ((.cse20 (div .cse19 10))) (and (= 0 (mod .cse19 10)) (<= ~a29~0 (+ (mod .cse20 29) 14)) (<= 0 .cse20)))))) (.cse12 (<= (+ ~a0~0 98) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (exists ((v_prenex_12 Int)) (let ((.cse7 (* 9 v_prenex_12))) (let ((.cse6 (+ (div .cse7 10) 1))) (let ((.cse8 (* 5 (div .cse6 5)))) (let ((.cse5 (mod (+ .cse8 5) 29))) (and (<= ~a29~0 (+ .cse5 42)) (not (= (mod .cse6 5) 0)) (= .cse5 0) (not (= 0 (mod .cse7 10))) (< .cse6 0) (not (= (mod .cse8 29) 0)) (<= (+ v_prenex_12 144) 0) (< .cse8 0) (< .cse7 0)))))))) (and .cse9 (<= .cse10 0)) (and .cse0 .cse1 .cse11) (and (and .cse12 .cse0 .cse13) .cse11) (and .cse9 .cse0 .cse2) (and (= ~a2~0 4) (or (and .cse14 (<= 94 ~a0~0) .cse15) (and .cse14 .cse16 (<= .cse17 0) .cse15))) (and (and .cse14 .cse15) .cse18) (and .cse18 (and .cse9 .cse0 .cse13)) (and .cse0 (and (= ~a2~0 1) .cse18) .cse11 .cse15) (and .cse12 .cse4)))))) [2019-01-12 04:39:40,263 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,266 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,267 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,268 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,268 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,269 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,270 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,270 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse19 (+ ~a0~0 44))) (let ((.cse15 (+ ~a0~0 61)) (.cse8 (<= (+ ~a4~0 86) 0)) (.cse18 (<= 0 .cse19)) (.cse7 (= ~a2~0 2))) (let ((.cse4 (let ((.cse22 (not .cse7))) (or (and .cse8 .cse22) (and (< 0 .cse15) .cse8) (and .cse22 .cse18))))) (let ((.cse0 (<= (+ ~a4~0 42) 0)) (.cse16 (and (not (= 5 ~a2~0)) .cse4))) (let ((.cse3 (not (= 4 ~a2~0))) (.cse2 (= ~a2~0 3)) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse17 (= ~a2~0 1)) (.cse5 (< 0 (+ ~a29~0 144))) (.cse6 (<= 0 (+ ~a0~0 599999))) (.cse13 (and .cse0 .cse16)) (.cse14 (exists ((v_prenex_3 Int)) (let ((.cse20 (* 9 v_prenex_3))) (let ((.cse21 (div .cse20 10))) (and (= 0 (mod .cse20 10)) (<= ~a29~0 (+ (mod .cse21 29) 14)) (<= 0 .cse21))))))) (or (and .cse0 .cse1 .cse2) (and (and .cse0 .cse3 .cse4) .cse5) (and (and (<= (+ ~a0~0 98) 0) .cse0 .cse3) .cse6) (and .cse0 .cse1 .cse6) (and (and .cse7 .cse8) (exists ((v_prenex_12 Int)) (let ((.cse11 (* 9 v_prenex_12))) (let ((.cse10 (+ (div .cse11 10) 1))) (let ((.cse12 (* 5 (div .cse10 5)))) (let ((.cse9 (mod (+ .cse12 5) 29))) (and (<= ~a29~0 (+ .cse9 42)) (not (= (mod .cse10 5) 0)) (= .cse9 0) (not (= 0 (mod .cse11 10))) (< .cse10 0) (not (= (mod .cse12 29) 0)) (<= (+ v_prenex_12 144) 0) (< .cse12 0) (< .cse11 0)))))))) (and (and .cse13 .cse14) .cse5) (and (<= .cse15 0) .cse4) (and .cse0 .cse2 .cse16) (and .cse1 .cse8) (and .cse8 .cse17) (and (and .cse17 .cse5) .cse0 .cse6 .cse14) (and (or (and .cse13 (<= 94 ~a0~0) .cse14) (and .cse13 .cse18 (<= .cse19 0) .cse14)) (= ~a2~0 4)))))))) [2019-01-12 04:39:40,270 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,270 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:39:40,270 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:39:40,270 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,270 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,271 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,272 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,275 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,275 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,276 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,277 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,278 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,279 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,279 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:39:40,281 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,282 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse16 (+ ~a0~0 44))) (let ((.cse11 (+ ~a0~0 61)) (.cse8 (<= (+ ~a4~0 86) 0)) (.cse15 (<= 0 .cse16)) (.cse7 (= ~a2~0 2))) (let ((.cse4 (let ((.cse23 (not .cse7))) (or (and .cse8 .cse23) (and (< 0 .cse11) .cse8) (and .cse23 .cse15))))) (let ((.cse0 (<= (+ ~a4~0 42) 0)) (.cse12 (and (not (= 5 ~a2~0)) .cse4))) (let ((.cse3 (not (= 4 ~a2~0))) (.cse9 (exists ((v_prenex_12 Int)) (let ((.cse21 (* 9 v_prenex_12))) (let ((.cse20 (+ (div .cse21 10) 1))) (let ((.cse22 (* 5 (div .cse20 5)))) (let ((.cse19 (mod (+ .cse22 5) 29))) (and (<= ~a29~0 (+ .cse19 42)) (not (= (mod .cse20 5) 0)) (= .cse19 0) (not (= 0 (mod .cse21 10))) (< .cse20 0) (not (= (mod .cse22 29) 0)) (<= (+ v_prenex_12 144) 0) (< .cse22 0) (< .cse21 0)))))))) (.cse2 (= ~a2~0 3)) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse13 (= ~a2~0 1)) (.cse5 (< 0 (+ ~a29~0 144))) (.cse6 (<= 0 (+ ~a0~0 599999))) (.cse10 (and .cse0 .cse12)) (.cse14 (exists ((v_prenex_3 Int)) (let ((.cse17 (* 9 v_prenex_3))) (let ((.cse18 (div .cse17 10))) (and (= 0 (mod .cse17 10)) (<= ~a29~0 (+ (mod .cse18 29) 14)) (<= 0 .cse18))))))) (or (and .cse0 .cse1 .cse2) (and (and .cse0 .cse3 .cse4) .cse5) (and (and (<= (+ ~a0~0 98) 0) .cse0 .cse3) .cse6) (and .cse0 .cse1 .cse6) (and (and .cse7 .cse8) .cse9) (and .cse10 .cse5 .cse9) (and (<= .cse11 0) .cse4) (and .cse0 .cse2 .cse12) (and .cse1 .cse8) (and .cse8 .cse13) (and (and .cse13 .cse5) .cse0 .cse6 .cse14) (and (or (and .cse10 (<= 94 ~a0~0) .cse14) (and .cse10 .cse15 (<= .cse16 0) .cse14)) (= ~a2~0 4)))))))) [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,283 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,284 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,285 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:39:40,285 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:39:40,285 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,285 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:39:40,285 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:39:40,285 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:39:40,286 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:39:40,287 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,288 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,289 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,290 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,291 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:39:40,291 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,292 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,293 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:39:40,294 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:39:40,295 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:39:40,317 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,353 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,354 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:39:40 BoogieIcfgContainer [2019-01-12 04:39:40,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:39:40,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:39:40,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:39:40,420 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:39:40,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:36:33" (3/4) ... [2019-01-12 04:39:40,427 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:39:40,480 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:39:40,484 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:39:40,524 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3) || (((a4 + 42 <= 0 && !(4 == a2)) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 599999)) || ((a2 == 2 && a4 + 86 <= 0) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || (((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) && 0 < a29 + 144)) || (a0 + 61 <= 0 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || ((a4 + 42 <= 0 && a2 == 3) && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || (a0 + 99 <= 0 && a4 + 86 <= 0)) || (a4 + 86 <= 0 && a2 == 1)) || ((((a2 == 1 && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 94 <= a0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) || ((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) && a2 == 4) [2019-01-12 04:39:40,533 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3) || (((a4 + 42 <= 0 && !(4 == a2)) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 599999)) || ((a2 == 2 && a4 + 86 <= 0) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || (((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 < a29 + 144) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || (a0 + 61 <= 0 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || ((a4 + 42 <= 0 && a2 == 3) && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || (a0 + 99 <= 0 && a4 + 86 <= 0)) || (a4 + 86 <= 0 && a2 == 1)) || ((((a2 == 1 && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 94 <= a0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) || ((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) && a2 == 4) [2019-01-12 04:39:40,551 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3) || ((a2 == 2 && a4 + 86 <= 0) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 599999)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && 0 <= a0 + 599999)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 3)) || (a2 == 4 && (((((!(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && a4 + 42 <= 0) && 94 <= a0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) || (((((!(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && a4 + 42 <= 0) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))))) || ((((!(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && a4 + 42 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) && 0 < a29 + 144)) || (0 < a29 + 144 && ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && !(4 == a2))) || (((a4 + 42 <= 0 && a2 == 1 && 0 < a29 + 144) && 0 <= a0 + 599999) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (a0 + 98 <= 0 && a4 + 86 <= 0) [2019-01-12 04:39:40,801 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:39:40,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:39:40,802 INFO L168 Benchmark]: Toolchain (without parser) took 196504.33 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 946.0 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 891.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:40,804 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:39:40,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1379.50 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 849.0 MB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:40,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 314.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 849.0 MB in the beginning and 1.1 GB in the end (delta: -265.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:40,805 INFO L168 Benchmark]: Boogie Preprocessor took 197.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:40,807 INFO L168 Benchmark]: RCFGBuilder took 7392.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.8 MB). Peak memory consumption was 294.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:40,807 INFO L168 Benchmark]: TraceAbstraction took 186831.86 ms. Allocated memory was 1.3 GB in the beginning and 2.9 GB in the end (delta: 1.6 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -843.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-12 04:39:40,809 INFO L168 Benchmark]: Witness Printer took 381.77 ms. Allocated memory is still 2.9 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 81.2 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:39:40,813 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1379.50 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 849.0 MB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 314.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 849.0 MB in the beginning and 1.1 GB in the end (delta: -265.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 197.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7392.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.8 MB). Peak memory consumption was 294.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 186831.86 ms. Allocated memory was 1.3 GB in the beginning and 2.9 GB in the end (delta: 1.6 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -843.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 381.77 ms. Allocated memory is still 2.9 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 81.2 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-01-12 04:39:40,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3) || (((a4 + 42 <= 0 && !(4 == a2)) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 599999)) || ((a2 == 2 && a4 + 86 <= 0) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || (((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) && 0 < a29 + 144)) || (a0 + 61 <= 0 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || ((a4 + 42 <= 0 && a2 == 3) && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || (a0 + 99 <= 0 && a4 + 86 <= 0)) || (a4 + 86 <= 0 && a2 == 1)) || ((((a2 == 1 && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 94 <= a0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) || ((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) && a2 == 4) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:39:40,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3) || (((a4 + 42 <= 0 && !(4 == a2)) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 599999)) || ((a2 == 2 && a4 + 86 <= 0) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || (((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 < a29 + 144) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || (a0 + 61 <= 0 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || ((a4 + 42 <= 0 && a2 == 3) && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)))) || (a0 + 99 <= 0 && a4 + 86 <= 0)) || (a4 + 86 <= 0 && a2 == 1)) || ((((a2 == 1 && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 94 <= a0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) || ((((a4 + 42 <= 0 && !(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) && a2 == 4) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:39:40,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:39:40,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-01-12 04:39:40,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: (((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3) || ((a2 == 2 && a4 + 86 <= 0) && (\exists v_prenex_12 : int :: (((((((a29 <= (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 + 42 && !((9 * v_prenex_12 / 10 + 1) % 5 == 0)) && (5 * ((9 * v_prenex_12 / 10 + 1) / 5) + 5) % 29 == 0) && !(0 == 9 * v_prenex_12 % 10)) && 9 * v_prenex_12 / 10 + 1 < 0) && !(5 * ((9 * v_prenex_12 / 10 + 1) / 5) % 29 == 0)) && v_prenex_12 + 144 <= 0) && 5 * ((9 * v_prenex_12 / 10 + 1) / 5) < 0) && 9 * v_prenex_12 < 0))) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 599999)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && 0 <= a0 + 599999)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 3)) || (a2 == 4 && (((((!(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && a4 + 42 <= 0) && 94 <= a0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) || (((((!(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && a4 + 42 <= 0) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))))) || ((((!(5 == a2) && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44))) && a4 + 42 <= 0) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10)) && 0 < a29 + 144)) || (0 < a29 + 144 && ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && !(4 == a2))) || (((a4 + 42 <= 0 && a2 == 1 && 0 < a29 + 144) && 0 <= a0 + 599999) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || (a0 + 98 <= 0 && a4 + 86 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 186.6s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 150.6s AutomataDifference, 0.0s DeadEndRemovalTime, 11.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2767 SDtfs, 20243 SDslu, 1211 SDs, 0 SdLazy, 36648 SolverSat, 5429 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 138.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3121 GetRequests, 3030 SyntacticMatches, 13 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11411occurred in iteration=12, 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, 14 MinimizatonAttempts, 17743 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 291 NumberOfFragments, 1873 HoareAnnotationTreeSize, 4 FomulaSimplifications, 107613 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 102995 FormulaSimplificationTreeSizeReductionInter, 9.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 10306 NumberOfCodeBlocks, 10306 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 10287 ConstructedInterpolants, 82 QuantifiedInterpolants, 25225820 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3535 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 10260/11196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...