./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label51_true-unreach-call_false-termination.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/Problem14_label51_true-unreach-call_false-termination.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 82f1252cdfefb15e293400630c3df24cee2c679c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28:05,466 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:28:05,468 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:28:05,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:28:05,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:28:05,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:28:05,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:28:05,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:28:05,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:28:05,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:28:05,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:28:05,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:28:05,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:28:05,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:28:05,495 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:28:05,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:28:05,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:28:05,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:28:05,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:28:05,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:28:05,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:28:05,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:28:05,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:28:05,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:28:05,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:28:05,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:28:05,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:28:05,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:28:05,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:28:05,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:28:05,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:28:05,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:28:05,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:28:05,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:28:05,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:28:05,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:28:05,536 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:28:05,564 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:28:05,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:28:05,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:28:05,566 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:28:05,566 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:28:05,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:28:05,567 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:28:05,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:28:05,567 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:28:05,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:28:05,567 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:28:05,567 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:28:05,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:28:05,568 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:28:05,568 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:28:05,568 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:28:05,568 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:28:05,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:28:05,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:28:05,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:28:05,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:28:05,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:28:05,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:28:05,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:28:05,571 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:28:05,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:28:05,573 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:28:05,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:28:05,573 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 -> 82f1252cdfefb15e293400630c3df24cee2c679c [2019-01-12 04:28:05,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:28:05,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:28:05,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:28:05,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:28:05,643 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:28:05,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label51_true-unreach-call_false-termination.c [2019-01-12 04:28:05,701 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f5e4fe/b8a120b0134041ce8ffeb5844dc1f0e8/FLAGdd97b83d7 [2019-01-12 04:28:06,238 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:28:06,239 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label51_true-unreach-call_false-termination.c [2019-01-12 04:28:06,257 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f5e4fe/b8a120b0134041ce8ffeb5844dc1f0e8/FLAGdd97b83d7 [2019-01-12 04:28:06,462 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f5e4fe/b8a120b0134041ce8ffeb5844dc1f0e8 [2019-01-12 04:28:06,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:28:06,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:28:06,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:28:06,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:28:06,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:28:06,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:28:06" (1/1) ... [2019-01-12 04:28:06,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc1f183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:06, skipping insertion in model container [2019-01-12 04:28:06,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:28:06" (1/1) ... [2019-01-12 04:28:06,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:28:06,554 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:28:07,057 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:28:07,066 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:28:07,321 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:28:07,346 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:28:07,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07 WrapperNode [2019-01-12 04:28:07,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:28:07,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:28:07,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:28:07,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:28:07,365 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:28:07" (1/1) ... [2019-01-12 04:28:07,489 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:28:07" (1/1) ... [2019-01-12 04:28:07,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:28:07,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:28:07,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:28:07,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:28:07,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (1/1) ... [2019-01-12 04:28:07,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (1/1) ... [2019-01-12 04:28:07,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (1/1) ... [2019-01-12 04:28:07,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (1/1) ... [2019-01-12 04:28:07,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (1/1) ... [2019-01-12 04:28:07,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (1/1) ... [2019-01-12 04:28:07,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (1/1) ... [2019-01-12 04:28:07,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:28:07,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:28:07,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:28:07,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:28:07,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (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:28:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:28:07,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:28:11,355 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:28:11,356 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 04:28:11,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:11 BoogieIcfgContainer [2019-01-12 04:28:11,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:28:11,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:28:11,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:28:11,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:28:11,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:28:06" (1/3) ... [2019-01-12 04:28:11,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0398be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:28:11, skipping insertion in model container [2019-01-12 04:28:11,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:07" (2/3) ... [2019-01-12 04:28:11,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0398be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:28:11, skipping insertion in model container [2019-01-12 04:28:11,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:11" (3/3) ... [2019-01-12 04:28:11,365 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label51_true-unreach-call_false-termination.c [2019-01-12 04:28:11,376 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:28:11,385 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:28:11,402 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:28:11,435 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:28:11,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:28:11,436 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:28:11,436 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:28:11,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:28:11,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:28:11,437 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:28:11,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:28:11,437 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:28:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-01-12 04:28:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 04:28:11,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:11,474 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] [2019-01-12 04:28:11,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times [2019-01-12 04:28:11,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:11,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:11,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:11,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:11,831 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:28:11,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:11,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:11,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:11,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:11,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:11,862 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-01-12 04:28:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:14,813 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-01-12 04:28:14,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:14,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-12 04:28:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:14,837 INFO L225 Difference]: With dead ends: 866 [2019-01-12 04:28:14,838 INFO L226 Difference]: Without dead ends: 538 [2019-01-12 04:28:14,843 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:28:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-12 04:28:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-01-12 04:28:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-01-12 04:28:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2019-01-12 04:28:14,960 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 35 [2019-01-12 04:28:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:14,962 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2019-01-12 04:28:14,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2019-01-12 04:28:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-01-12 04:28:14,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:14,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:14,975 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:14,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:14,975 INFO L82 PathProgramCache]: Analyzing trace with hash -545911462, now seen corresponding path program 1 times [2019-01-12 04:28:14,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:14,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:14,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:28:15,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:15,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:28:15,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:15,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:15,570 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 6 states. [2019-01-12 04:28:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:18,415 INFO L93 Difference]: Finished difference Result 1964 states and 2764 transitions. [2019-01-12 04:28:18,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:18,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-01-12 04:28:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:18,425 INFO L225 Difference]: With dead ends: 1964 [2019-01-12 04:28:18,425 INFO L226 Difference]: Without dead ends: 1428 [2019-01-12 04:28:18,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-01-12 04:28:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-01-12 04:28:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-01-12 04:28:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1849 transitions. [2019-01-12 04:28:18,477 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1849 transitions. Word has length 143 [2019-01-12 04:28:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:18,478 INFO L480 AbstractCegarLoop]: Abstraction has 1428 states and 1849 transitions. [2019-01-12 04:28:18,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1849 transitions. [2019-01-12 04:28:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-12 04:28:18,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:18,485 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:28:18,485 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:18,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1795619338, now seen corresponding path program 1 times [2019-01-12 04:28:18,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:18,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-12 04:28:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:18,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:18,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:18,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:18,660 INFO L87 Difference]: Start difference. First operand 1428 states and 1849 transitions. Second operand 4 states. [2019-01-12 04:28:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:21,264 INFO L93 Difference]: Finished difference Result 3922 states and 5314 transitions. [2019-01-12 04:28:21,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:21,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2019-01-12 04:28:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:21,280 INFO L225 Difference]: With dead ends: 3922 [2019-01-12 04:28:21,281 INFO L226 Difference]: Without dead ends: 2674 [2019-01-12 04:28:21,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-01-12 04:28:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-01-12 04:28:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-01-12 04:28:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2951 transitions. [2019-01-12 04:28:21,338 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2951 transitions. Word has length 209 [2019-01-12 04:28:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:21,339 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2951 transitions. [2019-01-12 04:28:21,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2951 transitions. [2019-01-12 04:28:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-01-12 04:28:21,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:21,347 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:28:21,347 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash -853230355, now seen corresponding path program 1 times [2019-01-12 04:28:21,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:21,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:21,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 136 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 04:28:21,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:21,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:21,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-12 04:28:21,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:21,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:28:21,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:21,966 INFO L87 Difference]: Start difference. First operand 2318 states and 2951 transitions. Second operand 6 states. [2019-01-12 04:28:22,909 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-12 04:28:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:27,922 INFO L93 Difference]: Finished difference Result 5313 states and 6711 transitions. [2019-01-12 04:28:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:28:27,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-01-12 04:28:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:27,940 INFO L225 Difference]: With dead ends: 5313 [2019-01-12 04:28:27,940 INFO L226 Difference]: Without dead ends: 3030 [2019-01-12 04:28:27,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-01-12 04:28:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2318. [2019-01-12 04:28:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-01-12 04:28:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2504 transitions. [2019-01-12 04:28:27,998 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2504 transitions. Word has length 223 [2019-01-12 04:28:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:28,000 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2504 transitions. [2019-01-12 04:28:28,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2504 transitions. [2019-01-12 04:28:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-01-12 04:28:28,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:28,007 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:28:28,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1484675231, now seen corresponding path program 1 times [2019-01-12 04:28:28,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:28,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:28,644 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-12 04:28:29,008 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-12 04:28:29,433 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2019-01-12 04:28:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 303 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-12 04:28:29,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:29,734 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:28:29,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:29,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-01-12 04:28:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:29,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:28:29,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:28:29,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:28:29,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:29,960 INFO L87 Difference]: Start difference. First operand 2318 states and 2504 transitions. Second operand 7 states. [2019-01-12 04:28:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:35,199 INFO L93 Difference]: Finished difference Result 6242 states and 6731 transitions. [2019-01-12 04:28:35,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:28:35,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2019-01-12 04:28:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:35,216 INFO L225 Difference]: With dead ends: 6242 [2019-01-12 04:28:35,216 INFO L226 Difference]: Without dead ends: 3926 [2019-01-12 04:28:35,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2019-01-12 04:28:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3386. [2019-01-12 04:28:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-01-12 04:28:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3618 transitions. [2019-01-12 04:28:35,286 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3618 transitions. Word has length 339 [2019-01-12 04:28:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:35,287 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3618 transitions. [2019-01-12 04:28:35,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:28:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3618 transitions. [2019-01-12 04:28:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-01-12 04:28:35,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:35,301 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:35,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash 379242444, now seen corresponding path program 1 times [2019-01-12 04:28:35,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:35,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:35,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2019-01-12 04:28:35,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:35,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:35,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:35,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:35,771 INFO L87 Difference]: Start difference. First operand 3386 states and 3618 transitions. Second operand 4 states. [2019-01-12 04:28:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:37,172 INFO L93 Difference]: Finished difference Result 8372 states and 9031 transitions. [2019-01-12 04:28:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:37,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-01-12 04:28:37,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:37,192 INFO L225 Difference]: With dead ends: 8372 [2019-01-12 04:28:37,192 INFO L226 Difference]: Without dead ends: 4988 [2019-01-12 04:28:37,197 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:28:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-01-12 04:28:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2019-01-12 04:28:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-01-12 04:28:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4976 transitions. [2019-01-12 04:28:37,277 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4976 transitions. Word has length 505 [2019-01-12 04:28:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:37,278 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4976 transitions. [2019-01-12 04:28:37,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4976 transitions. [2019-01-12 04:28:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-01-12 04:28:37,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:37,291 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:37,291 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash 139622368, now seen corresponding path program 1 times [2019-01-12 04:28:37,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:37,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2019-01-12 04:28:37,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:37,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:28:37,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:37,884 INFO L87 Difference]: Start difference. First operand 4632 states and 4976 transitions. Second operand 6 states. [2019-01-12 04:28:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:38,947 INFO L93 Difference]: Finished difference Result 9283 states and 9967 transitions. [2019-01-12 04:28:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:28:38,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 513 [2019-01-12 04:28:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:38,966 INFO L225 Difference]: With dead ends: 9283 [2019-01-12 04:28:38,966 INFO L226 Difference]: Without dead ends: 4632 [2019-01-12 04:28:38,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-01-12 04:28:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2019-01-12 04:28:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:28:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4780 transitions. [2019-01-12 04:28:39,042 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4780 transitions. Word has length 513 [2019-01-12 04:28:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:39,043 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4780 transitions. [2019-01-12 04:28:39,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4780 transitions. [2019-01-12 04:28:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2019-01-12 04:28:39,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:39,056 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:39,056 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash 127003364, now seen corresponding path program 1 times [2019-01-12 04:28:39,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:39,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:39,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:39,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:39,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2019-01-12 04:28:39,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:39,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:28:39,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:39,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:39,474 INFO L87 Difference]: Start difference. First operand 4454 states and 4780 transitions. Second operand 6 states. [2019-01-12 04:28:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:41,119 INFO L93 Difference]: Finished difference Result 9182 states and 9872 transitions. [2019-01-12 04:28:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:28:41,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 518 [2019-01-12 04:28:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:41,140 INFO L225 Difference]: With dead ends: 9182 [2019-01-12 04:28:41,140 INFO L226 Difference]: Without dead ends: 4730 [2019-01-12 04:28:41,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2019-01-12 04:28:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4632. [2019-01-12 04:28:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-01-12 04:28:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4977 transitions. [2019-01-12 04:28:41,232 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4977 transitions. Word has length 518 [2019-01-12 04:28:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:41,233 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4977 transitions. [2019-01-12 04:28:41,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4977 transitions. [2019-01-12 04:28:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-01-12 04:28:41,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:41,242 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:41,242 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1311309651, now seen corresponding path program 1 times [2019-01-12 04:28:41,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:41,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:41,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 758 proven. 130 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-01-12 04:28:41,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:41,954 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:28:41,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:42,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-12 04:28:42,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:42,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-12 04:28:42,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 04:28:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 04:28:42,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:28:42,686 INFO L87 Difference]: Start difference. First operand 4632 states and 4977 transitions. Second operand 14 states. [2019-01-12 04:28:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:45,747 INFO L93 Difference]: Finished difference Result 9905 states and 10630 transitions. [2019-01-12 04:28:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 04:28:45,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 524 [2019-01-12 04:28:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:45,787 INFO L225 Difference]: With dead ends: 9905 [2019-01-12 04:28:45,790 INFO L226 Difference]: Without dead ends: 4994 [2019-01-12 04:28:45,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-01-12 04:28:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-01-12 04:28:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4098. [2019-01-12 04:28:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:28:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4326 transitions. [2019-01-12 04:28:45,902 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4326 transitions. Word has length 524 [2019-01-12 04:28:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:45,904 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4326 transitions. [2019-01-12 04:28:45,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 04:28:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4326 transitions. [2019-01-12 04:28:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2019-01-12 04:28:45,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:45,922 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:28:45,923 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1233217796, now seen corresponding path program 1 times [2019-01-12 04:28:45,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1452 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2019-01-12 04:28:47,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:47,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:47,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:47,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:47,106 INFO L87 Difference]: Start difference. First operand 4098 states and 4326 transitions. Second operand 4 states. [2019-01-12 04:28:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:49,414 INFO L93 Difference]: Finished difference Result 8550 states and 9025 transitions. [2019-01-12 04:28:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:49,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 856 [2019-01-12 04:28:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:49,426 INFO L225 Difference]: With dead ends: 8550 [2019-01-12 04:28:49,426 INFO L226 Difference]: Without dead ends: 4454 [2019-01-12 04:28:49,434 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:28:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-01-12 04:28:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2019-01-12 04:28:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:28:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4632 transitions. [2019-01-12 04:28:49,503 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4632 transitions. Word has length 856 [2019-01-12 04:28:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:49,504 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4632 transitions. [2019-01-12 04:28:49,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4632 transitions. [2019-01-12 04:28:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2019-01-12 04:28:49,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:49,515 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:28:49,515 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2049858615, now seen corresponding path program 1 times [2019-01-12 04:28:49,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:49,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:49,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:49,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:49,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1616 proven. 199 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-01-12 04:28:51,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:51,216 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:28:51,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:51,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:51,827 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 04:28:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 2038 trivial. 0 not checked. [2019-01-12 04:28:52,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:52,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:28:52,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:28:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:28:52,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:28:52,868 INFO L87 Difference]: Start difference. First operand 4454 states and 4632 transitions. Second operand 9 states. [2019-01-12 04:28:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:55,774 INFO L93 Difference]: Finished difference Result 10352 states and 10757 transitions. [2019-01-12 04:28:55,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:28:55,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 874 [2019-01-12 04:28:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:55,786 INFO L225 Difference]: With dead ends: 10352 [2019-01-12 04:28:55,786 INFO L226 Difference]: Without dead ends: 6059 [2019-01-12 04:28:55,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2019-01-12 04:28:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 4810. [2019-01-12 04:28:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-01-12 04:28:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4973 transitions. [2019-01-12 04:28:55,868 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4973 transitions. Word has length 874 [2019-01-12 04:28:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:55,869 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 4973 transitions. [2019-01-12 04:28:55,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:28:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4973 transitions. [2019-01-12 04:28:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-01-12 04:28:55,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:55,882 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:55,882 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash 538441961, now seen corresponding path program 1 times [2019-01-12 04:28:55,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:55,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3493 backedges. 2157 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-01-12 04:28:56,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:56,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:28:56,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:28:56,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:28:56,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:56,940 INFO L87 Difference]: Start difference. First operand 4810 states and 4973 transitions. Second operand 5 states. [2019-01-12 04:28:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:58,114 INFO L93 Difference]: Finished difference Result 10864 states and 11230 transitions. [2019-01-12 04:28:58,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:28:58,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1032 [2019-01-12 04:28:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:58,129 INFO L225 Difference]: With dead ends: 10864 [2019-01-12 04:28:58,129 INFO L226 Difference]: Without dead ends: 6234 [2019-01-12 04:28:58,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-01-12 04:28:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 4988. [2019-01-12 04:28:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-01-12 04:28:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5152 transitions. [2019-01-12 04:28:58,215 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5152 transitions. Word has length 1032 [2019-01-12 04:28:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:58,216 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 5152 transitions. [2019-01-12 04:28:58,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:28:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5152 transitions. [2019-01-12 04:28:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2019-01-12 04:28:58,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:58,243 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:58,243 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash -172671030, now seen corresponding path program 1 times [2019-01-12 04:28:58,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:58,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:58,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:58,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 4706 proven. 728 refuted. 0 times theorem prover too weak. 3108 trivial. 0 not checked. [2019-01-12 04:29:02,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:02,717 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:29:02,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:03,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:04,030 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 15 [2019-01-12 04:29:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8542 backedges. 5716 proven. 514 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2019-01-12 04:29:07,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:29:07,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2019-01-12 04:29:07,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 04:29:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 04:29:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-01-12 04:29:07,579 INFO L87 Difference]: Start difference. First operand 4988 states and 5152 transitions. Second operand 18 states. [2019-01-12 04:29:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:18,849 INFO L93 Difference]: Finished difference Result 11941 states and 12374 transitions. [2019-01-12 04:29:18,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 04:29:18,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1646 [2019-01-12 04:29:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:18,864 INFO L225 Difference]: With dead ends: 11941 [2019-01-12 04:29:18,864 INFO L226 Difference]: Without dead ends: 6421 [2019-01-12 04:29:18,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1664 GetRequests, 1640 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-01-12 04:29:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2019-01-12 04:29:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 4454. [2019-01-12 04:29:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:29:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4560 transitions. [2019-01-12 04:29:18,962 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4560 transitions. Word has length 1646 [2019-01-12 04:29:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:18,963 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4560 transitions. [2019-01-12 04:29:18,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 04:29:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4560 transitions. [2019-01-12 04:29:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2019-01-12 04:29:19,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:19,002 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:29:19,003 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:19,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1952577186, now seen corresponding path program 1 times [2019-01-12 04:29:19,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:19,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:19,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:19,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:19,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:19,733 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 04:29:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9519 backedges. 3801 proven. 0 refuted. 0 times theorem prover too weak. 5718 trivial. 0 not checked. [2019-01-12 04:29:20,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:20,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:20,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:20,835 INFO L87 Difference]: Start difference. First operand 4454 states and 4560 transitions. Second operand 4 states. [2019-01-12 04:29:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:21,708 INFO L93 Difference]: Finished difference Result 9974 states and 10200 transitions. [2019-01-12 04:29:21,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:21,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1742 [2019-01-12 04:29:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:21,718 INFO L225 Difference]: With dead ends: 9974 [2019-01-12 04:29:21,718 INFO L226 Difference]: Without dead ends: 3564 [2019-01-12 04:29:21,724 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:29:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-01-12 04:29:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2019-01-12 04:29:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-01-12 04:29:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3609 transitions. [2019-01-12 04:29:21,772 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3609 transitions. Word has length 1742 [2019-01-12 04:29:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:21,774 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3609 transitions. [2019-01-12 04:29:21,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3609 transitions. [2019-01-12 04:29:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1814 [2019-01-12 04:29:21,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:21,806 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:29:21,806 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash -354861792, now seen corresponding path program 1 times [2019-01-12 04:29:21,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:21,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:21,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 5597 proven. 627 refuted. 0 times theorem prover too weak. 4651 trivial. 0 not checked. [2019-01-12 04:29:24,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:24,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:29:24,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:24,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:25,989 WARN L181 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 32 [2019-01-12 04:29:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10875 backedges. 3815 proven. 209 refuted. 0 times theorem prover too weak. 6851 trivial. 0 not checked. [2019-01-12 04:29:27,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:29:27,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-01-12 04:29:27,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 04:29:27,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 04:29:27,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:29:27,681 INFO L87 Difference]: Start difference. First operand 3564 states and 3609 transitions. Second operand 10 states. [2019-01-12 04:29:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:35,259 INFO L93 Difference]: Finished difference Result 8550 states and 8674 transitions. [2019-01-12 04:29:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:29:35,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1813 [2019-01-12 04:29:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:35,270 INFO L225 Difference]: With dead ends: 8550 [2019-01-12 04:29:35,271 INFO L226 Difference]: Without dead ends: 4810 [2019-01-12 04:29:35,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1834 GetRequests, 1817 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-01-12 04:29:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-01-12 04:29:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3920. [2019-01-12 04:29:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-01-12 04:29:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3967 transitions. [2019-01-12 04:29:35,343 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3967 transitions. Word has length 1813 [2019-01-12 04:29:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:35,344 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3967 transitions. [2019-01-12 04:29:35,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 04:29:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3967 transitions. [2019-01-12 04:29:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1940 [2019-01-12 04:29:35,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:35,386 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:29:35,386 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:35,387 INFO L82 PathProgramCache]: Analyzing trace with hash -412541850, now seen corresponding path program 1 times [2019-01-12 04:29:35,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:35,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:35,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12527 backedges. 7300 proven. 1392 refuted. 0 times theorem prover too weak. 3835 trivial. 0 not checked. [2019-01-12 04:29:40,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:40,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:29:40,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:40,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12527 backedges. 8692 proven. 0 refuted. 0 times theorem prover too weak. 3835 trivial. 0 not checked. [2019-01-12 04:29:44,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:29:44,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-01-12 04:29:44,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:29:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:29:44,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:29:44,282 INFO L87 Difference]: Start difference. First operand 3920 states and 3967 transitions. Second operand 8 states. [2019-01-12 04:29:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:47,137 INFO L93 Difference]: Finished difference Result 5551 states and 5630 transitions. [2019-01-12 04:29:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:29:47,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1939 [2019-01-12 04:29:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:47,142 INFO L225 Difference]: With dead ends: 5551 [2019-01-12 04:29:47,142 INFO L226 Difference]: Without dead ends: 3947 [2019-01-12 04:29:47,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1947 GetRequests, 1938 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:29:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2019-01-12 04:29:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3564. [2019-01-12 04:29:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-01-12 04:29:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3599 transitions. [2019-01-12 04:29:47,184 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3599 transitions. Word has length 1939 [2019-01-12 04:29:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:47,185 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3599 transitions. [2019-01-12 04:29:47,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:29:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3599 transitions. [2019-01-12 04:29:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2116 [2019-01-12 04:29:47,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:47,215 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 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:29:47,215 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:47,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash 58677289, now seen corresponding path program 1 times [2019-01-12 04:29:47,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:47,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:47,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:47,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:47,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 4502 proven. 209 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2019-01-12 04:29:49,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:49,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:29:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:50,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:50,879 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 32 [2019-01-12 04:29:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14461 backedges. 4502 proven. 209 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2019-01-12 04:29:53,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:29:53,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 04:29:53,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:29:53,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:29:53,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:53,017 INFO L87 Difference]: Start difference. First operand 3564 states and 3599 transitions. Second operand 6 states. [2019-01-12 04:29:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:56,119 INFO L93 Difference]: Finished difference Result 3564 states and 3599 transitions. [2019-01-12 04:29:56,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:29:56,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2115 [2019-01-12 04:29:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:56,122 INFO L225 Difference]: With dead ends: 3564 [2019-01-12 04:29:56,122 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:29:56,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2122 GetRequests, 2116 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:29:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:29:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:29:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:29:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:29:56,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2115 [2019-01-12 04:29:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:56,126 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:29:56,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:29:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:29:56,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:29:56,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:29:56,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:56,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:56,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:56,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:56,616 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 355 [2019-01-12 04:29:56,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:56,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:56,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:57,029 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 437 DAG size of output: 355 [2019-01-12 04:30:02,787 WARN L181 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 327 DAG size of output: 165 [2019-01-12 04:30:06,731 WARN L181 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 327 DAG size of output: 165 [2019-01-12 04:30:06,735 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-01-12 04:30:06,735 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-01-12 04:30:06,736 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-01-12 04:30:06,737 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-01-12 04:30:06,738 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,739 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-01-12 04:30:06,740 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,741 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,742 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,743 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,744 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,745 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,746 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:30:06,747 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-01-12 04:30:06,748 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-01-12 04:30:06,749 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,749 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,749 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse13 (= ~a15~0 8)) (.cse3 (= ~a24~0 1)) (.cse31 (not (= 8 ~a21~0))) (.cse21 (= ~a21~0 10)) (.cse10 (= ~a15~0 5)) (.cse1 (<= ~a12~0 11)) (.cse23 (<= ~a15~0 8))) (let ((.cse15 (<= (+ ~a12~0 49) 0)) (.cse35 (+ ~a12~0 43)) (.cse34 (and (not .cse10) .cse1 .cse23)) (.cse11 (<= ~a12~0 80)) (.cse12 (< 11 ~a12~0)) (.cse22 (let ((.cse38 (not .cse21))) (or (and .cse13 .cse38) (and .cse3 .cse31 .cse23 .cse38)))) (.cse14 (= ~a21~0 7))) (let ((.cse6 (<= (+ ~a12~0 3) 0)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= 17760 ~a12~0)) (.cse30 (exists ((v_prenex_15 Int)) (let ((.cse36 (div (+ v_prenex_15 (- 600066)) 5))) (let ((.cse37 (+ (* 34 .cse36) 34))) (and (not (= (mod (+ v_prenex_15 4) 5) 0)) (<= v_prenex_15 599999) (not (= 0 (mod (+ (* 4 .cse36) 4) 10))) (< .cse37 0) (< v_prenex_15 600066) (<= ~a12~0 (+ (div .cse37 10) 1))))))) (.cse0 (and .cse3 .cse14 .cse23)) (.cse16 (and .cse3 .cse21 .cse23)) (.cse28 (and .cse11 (or .cse12 .cse13) .cse3 .cse22)) (.cse7 (<= ~a12~0 586307)) (.cse26 (or (and .cse23 .cse15) (and (<= .cse35 0) .cse34))) (.cse19 (<= ~a12~0 599999)) (.cse2 (< 0 .cse35)) (.cse18 (= ~a21~0 9)) (.cse29 (and .cse34 .cse3 .cse31)) (.cse27 (<= ~a21~0 6)) (.cse20 (exists ((v_~a12~0_438 Int)) (let ((.cse33 (div (+ v_~a12~0_438 (- 600066)) 5))) (let ((.cse32 (+ (* 34 .cse33) 34))) (and (<= v_~a12~0_438 586307) (< .cse32 0) (< v_~a12~0_438 600066) (<= ~a12~0 (+ (div .cse32 10) 1)) (not (= 0 (mod (+ (* 4 .cse33) 4) 10))) (not (= (mod (+ v_~a12~0_438 4) 5) 0))))))) (.cse25 (not .cse13)) (.cse4 (= ~a21~0 8)) (.cse5 (= ~a15~0 9)) (.cse9 (= ~a21~0 6)) (.cse17 (< 80 ~a12~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and .cse3 .cse7 .cse4 .cse5 .cse8) (and .cse9 .cse3 .cse10) (and .cse11 .cse12 .cse3 .cse10) (and .cse13 .cse3 .cse14 .cse15) (and .cse16 .cse1 .cse2) (and .cse16 .cse17) (and (and .cse3 .cse18 .cse5) .cse19 .cse17) (and .cse20 .cse3 .cse5 .cse21) (and .cse3 .cse21 .cse5 .cse6 .cse2) (and (or (and .cse22 .cse17) (and .cse3 .cse23 .cse24)) .cse25) (and .cse11 .cse12 .cse3 (= ~a15~0 6)) (and .cse26 .cse3 .cse27) (and .cse28 .cse8) (and .cse25 .cse29) (and (or (and .cse3 .cse14 .cse5) (and .cse3 .cse4 .cse5)) .cse19 .cse17) (and .cse21 .cse13 .cse3 .cse30) (and (<= ~a12~0 73282) .cse3 .cse22 .cse4 .cse24) (and (= ~a15~0 7) .cse3 .cse30) (and .cse0 .cse25) (and .cse16 .cse25) (and .cse28 .cse25) (and .cse9 (<= 95381 ~a12~0) .cse3 .cse7 .cse5) (and (and .cse26 .cse3 .cse31) .cse25) (and (and .cse21 .cse3 .cse5) .cse19 .cse17) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse2 .cse18 .cse29) (and (and .cse23 .cse27) .cse20 .cse25) (and .cse3 .cse4 (<= (+ ~a12~0 526767) 0) .cse5) (and .cse9 .cse3 .cse17 .cse13))))) [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,750 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-01-12 04:30:06,751 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,752 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-01-12 04:30:06,753 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse17 (= ~a15~0 8)) (.cse3 (= ~a24~0 1)) (.cse31 (not (= 8 ~a21~0))) (.cse21 (= ~a21~0 10)) (.cse10 (= ~a15~0 5)) (.cse1 (<= ~a12~0 11)) (.cse23 (<= ~a15~0 8))) (let ((.cse19 (<= (+ ~a12~0 49) 0)) (.cse35 (+ ~a12~0 43)) (.cse34 (and (not .cse10) .cse1 .cse23)) (.cse11 (<= ~a12~0 80)) (.cse12 (< 11 ~a12~0)) (.cse22 (let ((.cse38 (not .cse21))) (or (and .cse17 .cse38) (and .cse3 .cse31 .cse23 .cse38)))) (.cse18 (= ~a21~0 7))) (let ((.cse6 (<= (+ ~a12~0 3) 0)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= 17760 ~a12~0)) (.cse30 (exists ((v_prenex_15 Int)) (let ((.cse36 (div (+ v_prenex_15 (- 600066)) 5))) (let ((.cse37 (+ (* 34 .cse36) 34))) (and (not (= (mod (+ v_prenex_15 4) 5) 0)) (<= v_prenex_15 599999) (not (= 0 (mod (+ (* 4 .cse36) 4) 10))) (< .cse37 0) (< v_prenex_15 600066) (<= ~a12~0 (+ (div .cse37 10) 1))))))) (.cse0 (and .cse3 .cse18 .cse23)) (.cse13 (and .cse3 .cse21 .cse23)) (.cse28 (and .cse11 (or .cse12 .cse17) .cse3 .cse22)) (.cse7 (<= ~a12~0 586307)) (.cse26 (or (and .cse23 .cse19) (and (<= .cse35 0) .cse34))) (.cse16 (<= ~a12~0 599999)) (.cse2 (< 0 .cse35)) (.cse15 (= ~a21~0 9)) (.cse29 (and .cse34 .cse3 .cse31)) (.cse27 (<= ~a21~0 6)) (.cse20 (exists ((v_~a12~0_438 Int)) (let ((.cse33 (div (+ v_~a12~0_438 (- 600066)) 5))) (let ((.cse32 (+ (* 34 .cse33) 34))) (and (<= v_~a12~0_438 586307) (< .cse32 0) (< v_~a12~0_438 600066) (<= ~a12~0 (+ (div .cse32 10) 1)) (not (= 0 (mod (+ (* 4 .cse33) 4) 10))) (not (= (mod (+ v_~a12~0_438 4) 5) 0))))))) (.cse25 (not .cse17)) (.cse4 (= ~a21~0 8)) (.cse5 (= ~a15~0 9)) (.cse9 (= ~a21~0 6)) (.cse14 (< 80 ~a12~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2) (and .cse3 .cse7 .cse4 .cse5 .cse8) (and .cse9 .cse3 .cse10) (and .cse11 .cse12 .cse3 .cse10) (and .cse13 .cse1 .cse2) (and .cse13 .cse14) (and (and .cse3 .cse15 .cse5) .cse16 .cse14) (and .cse17 .cse3 .cse18 .cse19) (and .cse20 .cse3 .cse5 .cse21) (and .cse3 .cse21 .cse5 .cse6 .cse2) (and (or (and .cse22 .cse14) (and .cse3 .cse23 .cse24)) .cse25) (and .cse11 .cse12 .cse3 (= ~a15~0 6)) (and .cse26 .cse3 .cse27) (and .cse28 .cse8) (and .cse25 .cse29) (and (or (and .cse3 .cse18 .cse5) (and .cse3 .cse4 .cse5)) .cse16 .cse14) (and .cse21 .cse17 .cse3 .cse30) (and (<= ~a12~0 73282) .cse3 .cse22 .cse4 .cse24) (and (= ~a15~0 7) .cse3 .cse30) (and .cse0 .cse25) (and .cse13 .cse25) (and .cse28 .cse25) (and .cse9 (<= 95381 ~a12~0) .cse3 .cse7 .cse5) (and (and .cse26 .cse3 .cse31) .cse25) (and (and .cse21 .cse3 .cse5) .cse16 .cse14) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse2 .cse15 .cse29) (and (and .cse23 .cse27) .cse20 .cse25) (and .cse3 .cse4 (<= (+ ~a12~0 526767) 0) .cse5) (and .cse9 .cse3 .cse14 .cse17))))) [2019-01-12 04:30:06,753 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-01-12 04:30:06,753 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-01-12 04:30:06,753 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:30:06,753 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:30:06,753 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 04:30:06,753 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-01-12 04:30:06,753 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-01-12 04:30:06,754 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:30:06,755 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-01-12 04:30:06,756 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:30:06,757 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-01-12 04:30:06,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:06,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:06,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:30:06 BoogieIcfgContainer [2019-01-12 04:30:06,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:30:06,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:30:06,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:30:06,885 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:30:06,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:11" (3/4) ... [2019-01-12 04:30:06,893 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:30:06,946 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 04:30:06,948 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:30:06,991 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) [2019-01-12 04:30:06,997 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) [2019-01-12 04:30:07,156 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:30:07,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:30:07,158 INFO L168 Benchmark]: Toolchain (without parser) took 120690.87 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 947.3 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 315.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:07,158 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:30:07,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:07,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 247.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:07,159 INFO L168 Benchmark]: Boogie Preprocessor took 128.39 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:07,160 INFO L168 Benchmark]: RCFGBuilder took 3631.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.6 MB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:07,160 INFO L168 Benchmark]: TraceAbstraction took 115520.62 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 982.6 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:30:07,161 INFO L168 Benchmark]: Witness Printer took 277.35 ms. Allocated memory is still 5.1 GB. Free memory is still 4.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:30:07,167 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 880.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 247.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.39 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3631.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.6 MB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 115520.62 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 982.6 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 277.35 ms. Allocated memory is still 5.1 GB. Free memory is still 4.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: 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: 880]: Loop Invariant [2019-01-12 04:30:07,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 04:30:07,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_15,QUANTIFIED] [2019-01-12 04:30:07,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2019-01-12 04:30:07,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a24 == 1 && a21 == 7) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 5)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((((a24 == 1 && a21 == 9) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0)) && a24 == 1) && a15 == 9) && a21 == 10)) || ((((a24 == 1 && a21 == 10) && a15 == 9) && a12 + 3 <= 0) && 0 < a12 + 43)) || (((((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10))) && 80 < a12) || ((a24 == 1 && a15 <= 8) && 17760 <= a12)) && !(a15 == 8))) || (((a12 <= 80 && 11 < a12) && a24 == 1) && a15 == 6)) || ((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && a21 <= 6)) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && 19 <= a12)) || (!(a15 == 8) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((((a24 == 1 && a21 == 7) && a15 == 9) || ((a24 == 1 && a21 == 8) && a15 == 9)) && a12 <= 599999) && 80 < a12)) || (((a21 == 10 && a15 == 8) && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || ((((a12 <= 73282 && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && a21 == 8) && 17760 <= a12)) || ((a15 == 7 && a24 == 1) && (\exists v_prenex_15 : int :: ((((!((v_prenex_15 + 4) % 5 == 0) && v_prenex_15 <= 599999) && !(0 == (4 * ((v_prenex_15 + -600066) / 5) + 4) % 10)) && 34 * ((v_prenex_15 + -600066) / 5) + 34 < 0) && v_prenex_15 < 600066) && a12 <= (34 * ((v_prenex_15 + -600066) / 5) + 34) / 10 + 1))) || (((a24 == 1 && a21 == 7) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && !(a15 == 8))) || ((((a12 <= 80 && (11 < a12 || a15 == 8)) && a24 == 1) && ((a15 == 8 && !(a21 == 10)) || (((a24 == 1 && !(8 == a21)) && a15 <= 8) && !(a21 == 10)))) && !(a15 == 8))) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a24 == 1) && !(8 == a21)) && !(a15 == 8))) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (((!(input == 5) && 0 < a12 + 43) && a21 == 9) && (((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && !(8 == a21))) || (((a15 <= 8 && a21 <= 6) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((a21 == 6 && a24 == 1) && 80 < a12) && a15 == 8) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 115.3s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 59.2s AutomataDifference, 0.0s DeadEndRemovalTime, 10.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 996 SDtfs, 10705 SDslu, 582 SDs, 0 SdLazy, 40521 SolverSat, 2094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9614 GetRequests, 9484 SyntacticMatches, 10 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 8871 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 102 NumberOfFragments, 1711 HoareAnnotationTreeSize, 3 FomulaSimplifications, 28820 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 26154 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 24499 NumberOfCodeBlocks, 24499 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 24474 ConstructedInterpolants, 99 QuantifiedInterpolants, 119977471 SizeOfPredicates, 17 NumberOfNonLiveVariables, 11551 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 114680/118905 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...