./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label10_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label10_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 493bf8cee78cb31244d4d228e02bcd932957f60a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:36:01,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:36:01,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:36:01,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:36:01,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:36:01,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:36:01,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:36:01,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:36:01,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:36:01,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:36:01,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:36:01,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:36:01,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:36:01,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:36:01,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:36:01,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:36:01,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:36:01,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:36:01,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:36:01,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:36:01,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:36:01,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:36:01,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:36:01,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:36:01,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:36:01,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:36:01,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:36:01,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:36:01,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:36:01,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:36:01,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:36:01,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:36:01,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:36:01,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:36:01,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:36:01,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:36:01,348 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:36:01,375 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:36:01,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:36:01,378 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:36:01,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:36:01,380 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:36:01,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:36:01,381 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:36:01,382 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:36:01,382 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:36:01,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:36:01,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:36:01,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:36:01,383 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:36:01,383 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:36:01,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:36:01,384 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:36:01,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:36:01,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:36:01,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:36:01,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:36:01,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:36:01,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:36:01,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:36:01,387 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:36:01,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:36:01,388 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:36:01,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:36:01,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:36:01,389 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 -> 493bf8cee78cb31244d4d228e02bcd932957f60a [2019-01-12 03:36:01,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:36:01,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:36:01,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:36:01,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:36:01,500 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:36:01,501 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label10_true-unreach-call.c [2019-01-12 03:36:01,574 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d918c858a/ac57ee818ca24bad9e6df40e3661e247/FLAGe3a1a58a8 [2019-01-12 03:36:02,215 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:36:02,217 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label10_true-unreach-call.c [2019-01-12 03:36:02,240 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d918c858a/ac57ee818ca24bad9e6df40e3661e247/FLAGe3a1a58a8 [2019-01-12 03:36:02,395 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d918c858a/ac57ee818ca24bad9e6df40e3661e247 [2019-01-12 03:36:02,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:36:02,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:36:02,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:36:02,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:36:02,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:36:02,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:36:02" (1/1) ... [2019-01-12 03:36:02,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6faba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:02, skipping insertion in model container [2019-01-12 03:36:02,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:36:02" (1/1) ... [2019-01-12 03:36:02,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:36:02,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:36:03,080 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:36:03,092 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:36:03,375 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:36:03,398 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:36:03,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03 WrapperNode [2019-01-12 03:36:03,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:36:03,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:36:03,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:36:03,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:36:03,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:36:03,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:36:03,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:36:03,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:36:03,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... [2019-01-12 03:36:03,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:36:03,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:36:03,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:36:03,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:36:03,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:36:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:36:03,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:36:08,587 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:36:08,587 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:36:08,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:36:08 BoogieIcfgContainer [2019-01-12 03:36:08,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:36:08,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:36:08,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:36:08,595 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:36:08,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:36:02" (1/3) ... [2019-01-12 03:36:08,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36303a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:36:08, skipping insertion in model container [2019-01-12 03:36:08,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:03" (2/3) ... [2019-01-12 03:36:08,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36303a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:36:08, skipping insertion in model container [2019-01-12 03:36:08,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:36:08" (3/3) ... [2019-01-12 03:36:08,599 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label10_true-unreach-call.c [2019-01-12 03:36:08,612 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:36:08,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:36:08,642 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:36:08,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:36:08,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:36:08,691 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:36:08,691 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:36:08,691 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:36:08,691 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:36:08,692 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:36:08,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:36:08,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:36:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:36:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 03:36:08,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:08,729 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] [2019-01-12 03:36:08,732 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-01-12 03:36:08,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:08,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:08,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:08,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:08,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:09,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:09,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:36:09,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:09,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:09,154 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:36:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:12,952 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-01-12 03:36:12,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:12,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-12 03:36:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:12,977 INFO L225 Difference]: With dead ends: 973 [2019-01-12 03:36:12,977 INFO L226 Difference]: Without dead ends: 607 [2019-01-12 03:36:12,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-01-12 03:36:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-01-12 03:36:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-01-12 03:36:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-01-12 03:36:13,077 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 22 [2019-01-12 03:36:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:13,078 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-01-12 03:36:13,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-01-12 03:36:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-12 03:36:13,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:13,083 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 03:36:13,083 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1871415266, now seen corresponding path program 1 times [2019-01-12 03:36:13,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:13,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:13,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:13,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:13,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:36:13,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:13,359 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-01-12 03:36:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:16,326 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-01-12 03:36:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:16,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-12 03:36:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:16,346 INFO L225 Difference]: With dead ends: 2328 [2019-01-12 03:36:16,346 INFO L226 Difference]: Without dead ends: 1726 [2019-01-12 03:36:16,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-01-12 03:36:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-01-12 03:36:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-01-12 03:36:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-01-12 03:36:16,481 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 90 [2019-01-12 03:36:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:16,482 INFO L480 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-01-12 03:36:16,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-01-12 03:36:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 03:36:16,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:16,497 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 03:36:16,498 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 488148353, now seen corresponding path program 1 times [2019-01-12 03:36:16,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:16,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:16,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:16,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:16,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:16,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:36:16,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:36:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:36:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:36:16,863 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-01-12 03:36:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:18,851 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-01-12 03:36:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:36:18,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-12 03:36:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:18,871 INFO L225 Difference]: With dead ends: 4707 [2019-01-12 03:36:18,871 INFO L226 Difference]: Without dead ends: 2999 [2019-01-12 03:36:18,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:36:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-01-12 03:36:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-01-12 03:36:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-01-12 03:36:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-01-12 03:36:18,947 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 116 [2019-01-12 03:36:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:18,948 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-01-12 03:36:18,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:36:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-01-12 03:36:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-12 03:36:18,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:18,951 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:18,951 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash 251283053, now seen corresponding path program 1 times [2019-01-12 03:36:18,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:18,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:18,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:18,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:18,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 03:36:19,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:19,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:36:19,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:19,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:36:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-12 03:36:19,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:36:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 03:36:19,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:19,615 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 4 states. [2019-01-12 03:36:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:23,443 INFO L93 Difference]: Finished difference Result 9866 states and 12121 transitions. [2019-01-12 03:36:23,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:23,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-01-12 03:36:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:23,479 INFO L225 Difference]: With dead ends: 9866 [2019-01-12 03:36:23,480 INFO L226 Difference]: Without dead ends: 6869 [2019-01-12 03:36:23,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2019-01-12 03:36:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 6500. [2019-01-12 03:36:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6500 states. [2019-01-12 03:36:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 7818 transitions. [2019-01-12 03:36:23,648 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 7818 transitions. Word has length 144 [2019-01-12 03:36:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:23,649 INFO L480 AbstractCegarLoop]: Abstraction has 6500 states and 7818 transitions. [2019-01-12 03:36:23,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 7818 transitions. [2019-01-12 03:36:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 03:36:23,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:23,652 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:23,652 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2122268031, now seen corresponding path program 1 times [2019-01-12 03:36:23,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:23,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:23,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:24,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:24,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:36:24,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:24,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:24,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:24,071 INFO L87 Difference]: Start difference. First operand 6500 states and 7818 transitions. Second operand 4 states. [2019-01-12 03:36:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:26,839 INFO L93 Difference]: Finished difference Result 15044 states and 18193 transitions. [2019-01-12 03:36:26,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:26,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-01-12 03:36:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:26,882 INFO L225 Difference]: With dead ends: 15044 [2019-01-12 03:36:26,882 INFO L226 Difference]: Without dead ends: 8730 [2019-01-12 03:36:26,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8730 states. [2019-01-12 03:36:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8730 to 8340. [2019-01-12 03:36:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8340 states. [2019-01-12 03:36:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8340 states to 8340 states and 9883 transitions. [2019-01-12 03:36:27,074 INFO L78 Accepts]: Start accepts. Automaton has 8340 states and 9883 transitions. Word has length 149 [2019-01-12 03:36:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:27,074 INFO L480 AbstractCegarLoop]: Abstraction has 8340 states and 9883 transitions. [2019-01-12 03:36:27,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8340 states and 9883 transitions. [2019-01-12 03:36:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-01-12 03:36:27,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:27,086 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:27,086 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:27,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash -205904018, now seen corresponding path program 1 times [2019-01-12 03:36:27,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:27,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:27,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:27,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:27,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 89 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:27,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:27,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:36:27,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:28,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:36:28,640 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2019-01-12 03:36:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 39 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:29,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:36:29,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2019-01-12 03:36:29,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:36:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:36:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:36:29,105 INFO L87 Difference]: Start difference. First operand 8340 states and 9883 transitions. Second operand 8 states. [2019-01-12 03:36:29,434 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-01-12 03:36:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:39,307 INFO L93 Difference]: Finished difference Result 24426 states and 29098 transitions. [2019-01-12 03:36:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 03:36:39,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 234 [2019-01-12 03:36:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:39,370 INFO L225 Difference]: With dead ends: 24426 [2019-01-12 03:36:39,372 INFO L226 Difference]: Without dead ends: 16272 [2019-01-12 03:36:39,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-12 03:36:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2019-01-12 03:36:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 13502. [2019-01-12 03:36:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13502 states. [2019-01-12 03:36:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13502 states to 13502 states and 15921 transitions. [2019-01-12 03:36:39,671 INFO L78 Accepts]: Start accepts. Automaton has 13502 states and 15921 transitions. Word has length 234 [2019-01-12 03:36:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:39,672 INFO L480 AbstractCegarLoop]: Abstraction has 13502 states and 15921 transitions. [2019-01-12 03:36:39,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:36:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13502 states and 15921 transitions. [2019-01-12 03:36:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-12 03:36:39,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:39,684 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:39,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash 947970210, now seen corresponding path program 1 times [2019-01-12 03:36:39,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:39,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 19 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:40,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:40,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:36:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:40,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:36:41,246 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 03:36:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:41,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:36:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-01-12 03:36:41,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 03:36:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 03:36:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 03:36:41,423 INFO L87 Difference]: Start difference. First operand 13502 states and 15921 transitions. Second operand 11 states. [2019-01-12 03:36:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:50,214 INFO L93 Difference]: Finished difference Result 30438 states and 35733 transitions. [2019-01-12 03:36:50,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 03:36:50,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2019-01-12 03:36:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:50,248 INFO L225 Difference]: With dead ends: 30438 [2019-01-12 03:36:50,248 INFO L226 Difference]: Without dead ends: 17306 [2019-01-12 03:36:50,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 232 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-12 03:36:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17306 states. [2019-01-12 03:36:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17306 to 15151. [2019-01-12 03:36:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15151 states. [2019-01-12 03:36:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15151 states to 15151 states and 17168 transitions. [2019-01-12 03:36:50,536 INFO L78 Accepts]: Start accepts. Automaton has 15151 states and 17168 transitions. Word has length 236 [2019-01-12 03:36:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:50,539 INFO L480 AbstractCegarLoop]: Abstraction has 15151 states and 17168 transitions. [2019-01-12 03:36:50,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 03:36:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15151 states and 17168 transitions. [2019-01-12 03:36:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-12 03:36:50,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:50,545 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:50,546 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1148903582, now seen corresponding path program 1 times [2019-01-12 03:36:50,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:50,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:50,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:50,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:50,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:50,909 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 03:36:50,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:50,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:36:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:51,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:36:51,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 03:36:51,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:36:51,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:36:51,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:36:51,372 INFO L87 Difference]: Start difference. First operand 15151 states and 17168 transitions. Second operand 7 states. [2019-01-12 03:36:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:55,679 INFO L93 Difference]: Finished difference Result 34541 states and 38984 transitions. [2019-01-12 03:36:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 03:36:55,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 255 [2019-01-12 03:36:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:55,725 INFO L225 Difference]: With dead ends: 34541 [2019-01-12 03:36:55,725 INFO L226 Difference]: Without dead ends: 19576 [2019-01-12 03:36:55,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 03:36:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19576 states. [2019-01-12 03:36:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19576 to 14413. [2019-01-12 03:36:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14413 states. [2019-01-12 03:36:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14413 states to 14413 states and 16290 transitions. [2019-01-12 03:36:56,029 INFO L78 Accepts]: Start accepts. Automaton has 14413 states and 16290 transitions. Word has length 255 [2019-01-12 03:36:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:56,031 INFO L480 AbstractCegarLoop]: Abstraction has 14413 states and 16290 transitions. [2019-01-12 03:36:56,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:36:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 14413 states and 16290 transitions. [2019-01-12 03:36:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-01-12 03:36:56,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:56,045 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:56,045 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:56,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1477636383, now seen corresponding path program 1 times [2019-01-12 03:36:56,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:56,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:56,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:56,758 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 03:36:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-12 03:36:56,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:56,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:36:56,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:56,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:56,851 INFO L87 Difference]: Start difference. First operand 14413 states and 16290 transitions. Second operand 4 states. [2019-01-12 03:36:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:59,177 INFO L93 Difference]: Finished difference Result 30687 states and 34605 transitions. [2019-01-12 03:36:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:59,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-01-12 03:36:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:59,196 INFO L225 Difference]: With dead ends: 30687 [2019-01-12 03:36:59,197 INFO L226 Difference]: Without dead ends: 16644 [2019-01-12 03:36:59,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16644 states. [2019-01-12 03:36:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16644 to 12385. [2019-01-12 03:36:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12385 states. [2019-01-12 03:36:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12385 states to 12385 states and 13856 transitions. [2019-01-12 03:36:59,442 INFO L78 Accepts]: Start accepts. Automaton has 12385 states and 13856 transitions. Word has length 304 [2019-01-12 03:36:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:59,442 INFO L480 AbstractCegarLoop]: Abstraction has 12385 states and 13856 transitions. [2019-01-12 03:36:59,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 12385 states and 13856 transitions. [2019-01-12 03:36:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-01-12 03:36:59,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:59,464 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:59,465 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 56979324, now seen corresponding path program 1 times [2019-01-12 03:36:59,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:59,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:59,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:59,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 59 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:36:59,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:59,901 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 03:36:59,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:59,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:00,307 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 483 DAG size of output: 28 [2019-01-12 03:37:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 59 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:37:00,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:00,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-12 03:37:00,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:37:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:37:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:37:00,803 INFO L87 Difference]: Start difference. First operand 12385 states and 13856 transitions. Second operand 7 states. [2019-01-12 03:37:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:03,454 INFO L93 Difference]: Finished difference Result 27350 states and 30544 transitions. [2019-01-12 03:37:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:37:03,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 331 [2019-01-12 03:37:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:03,466 INFO L225 Difference]: With dead ends: 27350 [2019-01-12 03:37:03,466 INFO L226 Difference]: Without dead ends: 14596 [2019-01-12 03:37:03,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:37:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14596 states. [2019-01-12 03:37:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14596 to 12199. [2019-01-12 03:37:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12199 states. [2019-01-12 03:37:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12199 states to 12199 states and 13519 transitions. [2019-01-12 03:37:03,651 INFO L78 Accepts]: Start accepts. Automaton has 12199 states and 13519 transitions. Word has length 331 [2019-01-12 03:37:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:03,653 INFO L480 AbstractCegarLoop]: Abstraction has 12199 states and 13519 transitions. [2019-01-12 03:37:03,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:37:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 12199 states and 13519 transitions. [2019-01-12 03:37:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-01-12 03:37:03,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:03,672 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:37:03,672 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:03,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1891793115, now seen corresponding path program 1 times [2019-01-12 03:37:03,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:03,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:03,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:04,734 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-12 03:37:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 148 proven. 214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:37:05,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:05,244 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 03:37:05,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:05,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 157 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:37:06,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:06,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-01-12 03:37:06,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 03:37:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 03:37:06,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:37:06,134 INFO L87 Difference]: Start difference. First operand 12199 states and 13519 transitions. Second operand 13 states. [2019-01-12 03:37:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:12,222 INFO L93 Difference]: Finished difference Result 24172 states and 26730 transitions. [2019-01-12 03:37:12,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 03:37:12,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 373 [2019-01-12 03:37:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:12,234 INFO L225 Difference]: With dead ends: 24172 [2019-01-12 03:37:12,234 INFO L226 Difference]: Without dead ends: 12343 [2019-01-12 03:37:12,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2019-01-12 03:37:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12343 states. [2019-01-12 03:37:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12343 to 10713. [2019-01-12 03:37:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10713 states. [2019-01-12 03:37:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10713 states to 10713 states and 11730 transitions. [2019-01-12 03:37:12,386 INFO L78 Accepts]: Start accepts. Automaton has 10713 states and 11730 transitions. Word has length 373 [2019-01-12 03:37:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:12,387 INFO L480 AbstractCegarLoop]: Abstraction has 10713 states and 11730 transitions. [2019-01-12 03:37:12,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 03:37:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10713 states and 11730 transitions. [2019-01-12 03:37:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-01-12 03:37:12,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:12,406 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:37:12,407 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1552182285, now seen corresponding path program 1 times [2019-01-12 03:37:12,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:12,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:12,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 110 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:37:12,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:12,996 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 03:37:13,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:13,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 149 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:37:13,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:13,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-12 03:37:13,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:37:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:37:13,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:37:13,931 INFO L87 Difference]: Start difference. First operand 10713 states and 11730 transitions. Second operand 10 states. [2019-01-12 03:37:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:21,567 INFO L93 Difference]: Finished difference Result 23279 states and 25446 transitions. [2019-01-12 03:37:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 03:37:21,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 417 [2019-01-12 03:37:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:21,578 INFO L225 Difference]: With dead ends: 23279 [2019-01-12 03:37:21,578 INFO L226 Difference]: Without dead ends: 12752 [2019-01-12 03:37:21,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-01-12 03:37:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12752 states. [2019-01-12 03:37:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12752 to 11081. [2019-01-12 03:37:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11081 states. [2019-01-12 03:37:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11081 states to 11081 states and 12068 transitions. [2019-01-12 03:37:21,710 INFO L78 Accepts]: Start accepts. Automaton has 11081 states and 12068 transitions. Word has length 417 [2019-01-12 03:37:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:21,711 INFO L480 AbstractCegarLoop]: Abstraction has 11081 states and 12068 transitions. [2019-01-12 03:37:21,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:37:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 11081 states and 12068 transitions. [2019-01-12 03:37:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-01-12 03:37:21,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:21,738 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:37:21,738 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1498430217, now seen corresponding path program 1 times [2019-01-12 03:37:21,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 262 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:37:23,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:23,120 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 03:37:23,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:23,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 697 proven. 440 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-12 03:37:25,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:25,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-01-12 03:37:25,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 03:37:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 03:37:25,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-12 03:37:25,356 INFO L87 Difference]: Start difference. First operand 11081 states and 12068 transitions. Second operand 15 states. [2019-01-12 03:37:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:40,920 INFO L93 Difference]: Finished difference Result 27338 states and 29545 transitions. [2019-01-12 03:37:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 03:37:40,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 701 [2019-01-12 03:37:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:40,923 INFO L225 Difference]: With dead ends: 27338 [2019-01-12 03:37:40,923 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:37:40,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=529, Invalid=1921, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 03:37:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:37:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:37:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:37:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:37:40,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 701 [2019-01-12 03:37:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:40,940 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:37:40,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 03:37:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:37:40,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:37:40,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:37:41,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:41,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,635 WARN L181 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 707 DAG size of output: 455 [2019-01-12 03:37:42,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:42,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:37:43,935 WARN L181 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 701 DAG size of output: 455 [2019-01-12 03:37:48,393 WARN L181 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 392 DAG size of output: 146 [2019-01-12 03:37:52,142 WARN L181 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 392 DAG size of output: 146 [2019-01-12 03:37:52,145 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:37:52,145 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:37:52,145 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:37:52,146 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:37:52,147 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:37:52,148 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,148 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse21 (+ ~a23~0 43)) (.cse22 (= ~a4~0 1)) (.cse9 (= ~a25~0 13))) (let ((.cse15 (<= ~a23~0 262)) (.cse2 (<= ~a25~0 12)) (.cse16 (= ~a25~0 9)) (.cse7 (<= ~a29~0 245)) (.cse1 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499)))) (.cse17 (not .cse9)) (.cse5 (= 1 ~a4~0)) (.cse8 (exists ((v_prenex_42 Int)) (let ((.cse23 (+ v_prenex_42 69157))) (and (<= 0 .cse23) (<= 130 v_prenex_42) (<= ~a29~0 (+ (mod .cse23 299861) 300138)))))) (.cse18 (= ~a25~0 12)) (.cse3 (< 140 ~a29~0)) (.cse14 (not .cse22)) (.cse12 (<= ~a29~0 599998)) (.cse19 (<= ~a29~0 130)) (.cse11 (= ~a25~0 10)) (.cse0 (= ~a8~0 15)) (.cse10 (exists ((v_prenex_44 Int)) (and (<= ~a29~0 (+ (mod v_prenex_44 299861) 300139)) (<= 0 v_prenex_44) (< 277 v_prenex_44)))) (.cse6 (= ~a3~0 1)) (.cse4 (< 0 .cse21)) (.cse13 (= ~a25~0 11))) (or (and .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6) (and .cse0 (<= 13 ~a25~0) .cse3 .cse7 .cse5 .cse6) (and .cse8 .cse0 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse10 (or (and (<= ~a25~0 9) (< 277 ~a29~0)) (and (<= 214883 ~a29~0) .cse11)) .cse5 .cse6) (and .cse0 .cse12 .cse13 .cse14 .cse6) (and .cse9 (and (and .cse0 .cse4 .cse6) .cse5) .cse15) (and .cse10 (or (and .cse0 .cse4 .cse11) (and .cse16 .cse0 .cse4)) .cse5 .cse6) (and .cse9 .cse0 .cse4 .cse7 .cse6 .cse15) (and (and .cse0 .cse17 .cse6) (<= (+ ~a29~0 275923) 0)) (and (and (and .cse3 .cse18) .cse0 .cse6) .cse7) (and (and .cse0 (or (and .cse18 .cse19) (and (and .cse4 .cse19) .cse2)) .cse6) .cse5) (and (<= (+ ~a29~0 22) 0) (and .cse18 .cse0 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse4) (or .cse4 (not (= ULTIMATE.start_calculate_output_~input 1))) .cse6)) (and (and .cse0 .cse11 .cse6) .cse7 .cse5) (and .cse16 .cse0 .cse4 .cse7 .cse6) (and .cse0 .cse4 .cse7 .cse11 .cse6) (and (and .cse0 .cse1 .cse13) .cse6) (and .cse0 .cse17 .cse12 (exists ((v_prenex_37 Int)) (let ((.cse20 (mod v_prenex_37 299861))) (and (< 140 v_prenex_37) (<= (+ .cse20 10250) ~a29~0) (= 0 .cse20)))) (not .cse5) .cse6 (<= .cse21 0) (not .cse11)) (and .cse8 (and .cse3 .cse18 .cse0 .cse4) .cse6) (and (and .cse18 .cse0 .cse3 .cse14 .cse6) .cse12) (and .cse0 .cse19 .cse11 .cse6) (and .cse0 .cse10 .cse6 (and .cse4 .cse22 .cse13))))) [2019-01-12 03:37:52,148 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,148 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,148 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,148 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:37:52,149 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:37:52,150 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,151 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:37:52,152 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,153 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:37:52,154 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,155 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,156 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,157 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:37:52,158 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:37:52,159 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,160 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:37:52,161 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:37:52,162 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:37:52,163 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,164 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:37:52,165 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:37:52,166 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,167 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,168 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,169 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,169 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:37:52,169 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:37:52,169 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:37:52,169 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,169 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,169 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,170 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse21 (+ ~a23~0 43)) (.cse22 (= ~a4~0 1)) (.cse9 (= ~a25~0 13))) (let ((.cse15 (<= ~a23~0 262)) (.cse2 (<= ~a25~0 12)) (.cse16 (= ~a25~0 9)) (.cse7 (<= ~a29~0 245)) (.cse1 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499)))) (.cse17 (not .cse9)) (.cse5 (= 1 ~a4~0)) (.cse8 (exists ((v_prenex_42 Int)) (let ((.cse23 (+ v_prenex_42 69157))) (and (<= 0 .cse23) (<= 130 v_prenex_42) (<= ~a29~0 (+ (mod .cse23 299861) 300138)))))) (.cse18 (= ~a25~0 12)) (.cse3 (< 140 ~a29~0)) (.cse14 (not .cse22)) (.cse12 (<= ~a29~0 599998)) (.cse19 (<= ~a29~0 130)) (.cse11 (= ~a25~0 10)) (.cse0 (= ~a8~0 15)) (.cse10 (exists ((v_prenex_44 Int)) (and (<= ~a29~0 (+ (mod v_prenex_44 299861) 300139)) (<= 0 v_prenex_44) (< 277 v_prenex_44)))) (.cse6 (= ~a3~0 1)) (.cse4 (< 0 .cse21)) (.cse13 (= ~a25~0 11))) (or (and .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6) (and .cse0 (<= 13 ~a25~0) .cse3 .cse7 .cse5 .cse6) (and .cse8 .cse0 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse10 (or (and (<= ~a25~0 9) (< 277 ~a29~0)) (and (<= 214883 ~a29~0) .cse11)) .cse5 .cse6) (and .cse0 .cse12 .cse13 .cse14 .cse6) (and .cse9 (and (and .cse0 .cse4 .cse6) .cse5) .cse15) (and .cse10 (or (and .cse0 .cse4 .cse11) (and .cse16 .cse0 .cse4)) .cse5 .cse6) (and .cse9 .cse0 .cse4 .cse7 .cse6 .cse15) (and (and .cse0 .cse17 .cse6) (<= (+ ~a29~0 275923) 0)) (and (and (and .cse3 .cse18) .cse0 .cse6) .cse7) (and (and .cse0 (or (and .cse18 .cse19) (and (and .cse4 .cse19) .cse2)) .cse6) .cse5) (and (<= (+ ~a29~0 22) 0) (and .cse18 .cse0 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse4) (or .cse4 (not (= ULTIMATE.start_calculate_output_~input 1))) .cse6)) (and (and .cse0 .cse11 .cse6) .cse7 .cse5) (and .cse16 .cse0 .cse4 .cse7 .cse6) (and .cse0 .cse4 .cse7 .cse11 .cse6) (and (and .cse0 .cse1 .cse13) .cse6) (and .cse0 .cse17 .cse12 (exists ((v_prenex_37 Int)) (let ((.cse20 (mod v_prenex_37 299861))) (and (< 140 v_prenex_37) (<= (+ .cse20 10250) ~a29~0) (= 0 .cse20)))) (not .cse5) .cse6 (<= .cse21 0) (not .cse11)) (and .cse8 (and .cse3 .cse18 .cse0 .cse4) .cse6) (and (and .cse18 .cse0 .cse3 .cse14 .cse6) .cse12) (and .cse0 .cse19 .cse11 .cse6) (and .cse0 .cse10 .cse6 (and .cse4 .cse22 .cse13))))) [2019-01-12 03:37:52,170 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,170 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:37:52,170 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:37:52,170 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,170 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,170 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:37:52,170 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,171 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,171 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:37:52,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:37:52 BoogieIcfgContainer [2019-01-12 03:37:52,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:37:52,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:37:52,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:37:52,233 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:37:52,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:36:08" (3/4) ... [2019-01-12 03:37:52,238 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:37:52,292 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:37:52,294 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:37:52,344 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((a8 == 15 && ((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 <= 12) && 140 < a29) && 0 < a23 + 43) && 1 == a4) && a3 == 1) || (((((a8 == 15 && 13 <= a25) && 140 < a29) && a29 <= 245) && 1 == a4) && a3 == 1)) || ((((((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && a8 == 15) && a25 == 13) && 0 < a23 + 43) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && ((a25 <= 9 && 277 < a29) || (214883 <= a29 && a25 == 10))) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || ((a25 == 13 && ((a8 == 15 && 0 < a23 + 43) && a3 == 1) && 1 == a4) && a23 <= 262)) || ((((\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44) && (((a8 == 15 && 0 < a23 + 43) && a25 == 10) || ((a25 == 9 && a8 == 15) && 0 < a23 + 43))) && 1 == a4) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1) && a23 <= 262)) || (((a8 == 15 && !(a25 == 13)) && a3 == 1) && a29 + 275923 <= 0)) || ((((140 < a29 && a25 == 12) && a8 == 15) && a3 == 1) && a29 <= 245)) || (((a8 == 15 && ((a25 == 12 && a29 <= 130) || ((0 < a23 + 43 && a29 <= 130) && a25 <= 12))) && a3 == 1) && 1 == a4)) || (a29 + 22 <= 0 && (((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && (0 < a23 + 43 || !(input == 1))) && a3 == 1)) || ((((a8 == 15 && a25 == 10) && a3 == 1) && a29 <= 245) && 1 == a4)) || ((((a25 == 9 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 0 < a23 + 43) && a29 <= 245) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && a25 == 11) && a3 == 1)) || (((((((a8 == 15 && !(a25 == 13)) && a29 <= 599998) && (\exists v_prenex_37 : int :: (140 < v_prenex_37 && v_prenex_37 % 299861 + 10250 <= a29) && 0 == v_prenex_37 % 299861)) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10))) || (((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && ((140 < a29 && a25 == 12) && a8 == 15) && 0 < a23 + 43) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && 140 < a29) && !(a4 == 1)) && a3 == 1) && a29 <= 599998)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && a3 == 1) && (0 < a23 + 43 && a4 == 1) && a25 == 11) [2019-01-12 03:37:52,349 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((a8 == 15 && ((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 <= 12) && 140 < a29) && 0 < a23 + 43) && 1 == a4) && a3 == 1) || (((((a8 == 15 && 13 <= a25) && 140 < a29) && a29 <= 245) && 1 == a4) && a3 == 1)) || ((((((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && a8 == 15) && a25 == 13) && 0 < a23 + 43) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && ((a25 <= 9 && 277 < a29) || (214883 <= a29 && a25 == 10))) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || ((a25 == 13 && ((a8 == 15 && 0 < a23 + 43) && a3 == 1) && 1 == a4) && a23 <= 262)) || ((((\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44) && (((a8 == 15 && 0 < a23 + 43) && a25 == 10) || ((a25 == 9 && a8 == 15) && 0 < a23 + 43))) && 1 == a4) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1) && a23 <= 262)) || (((a8 == 15 && !(a25 == 13)) && a3 == 1) && a29 + 275923 <= 0)) || ((((140 < a29 && a25 == 12) && a8 == 15) && a3 == 1) && a29 <= 245)) || (((a8 == 15 && ((a25 == 12 && a29 <= 130) || ((0 < a23 + 43 && a29 <= 130) && a25 <= 12))) && a3 == 1) && 1 == a4)) || (a29 + 22 <= 0 && (((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && (0 < a23 + 43 || !(input == 1))) && a3 == 1)) || ((((a8 == 15 && a25 == 10) && a3 == 1) && a29 <= 245) && 1 == a4)) || ((((a25 == 9 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 0 < a23 + 43) && a29 <= 245) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && a25 == 11) && a3 == 1)) || (((((((a8 == 15 && !(a25 == 13)) && a29 <= 599998) && (\exists v_prenex_37 : int :: (140 < v_prenex_37 && v_prenex_37 % 299861 + 10250 <= a29) && 0 == v_prenex_37 % 299861)) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10))) || (((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && ((140 < a29 && a25 == 12) && a8 == 15) && 0 < a23 + 43) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && 140 < a29) && !(a4 == 1)) && a3 == 1) && a29 <= 599998)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && a3 == 1) && (0 < a23 + 43 && a4 == 1) && a25 == 11) [2019-01-12 03:37:52,536 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:37:52,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:37:52,539 INFO L168 Benchmark]: Toolchain (without parser) took 110138.15 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 940.6 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 364.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:37:52,540 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:37:52,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 997.56 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 892.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:37:52,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 311.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:37:52,543 INFO L168 Benchmark]: Boogie Preprocessor took 185.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:37:52,544 INFO L168 Benchmark]: RCFGBuilder took 4690.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.9 MB in the end (delta: 174.8 MB). Peak memory consumption was 174.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:37:52,544 INFO L168 Benchmark]: TraceAbstraction took 103642.07 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 883.9 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-12 03:37:52,544 INFO L168 Benchmark]: Witness Printer took 304.51 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-01-12 03:37:52,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 997.56 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 892.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 311.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 185.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4690.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.9 MB in the end (delta: 174.8 MB). Peak memory consumption was 174.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 103642.07 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 883.9 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 304.51 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 72]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-01-12 03:37:52,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,593 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,593 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,617 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a8 == 15 && ((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 <= 12) && 140 < a29) && 0 < a23 + 43) && 1 == a4) && a3 == 1) || (((((a8 == 15 && 13 <= a25) && 140 < a29) && a29 <= 245) && 1 == a4) && a3 == 1)) || ((((((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && a8 == 15) && a25 == 13) && 0 < a23 + 43) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && ((a25 <= 9 && 277 < a29) || (214883 <= a29 && a25 == 10))) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || ((a25 == 13 && ((a8 == 15 && 0 < a23 + 43) && a3 == 1) && 1 == a4) && a23 <= 262)) || ((((\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44) && (((a8 == 15 && 0 < a23 + 43) && a25 == 10) || ((a25 == 9 && a8 == 15) && 0 < a23 + 43))) && 1 == a4) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1) && a23 <= 262)) || (((a8 == 15 && !(a25 == 13)) && a3 == 1) && a29 + 275923 <= 0)) || ((((140 < a29 && a25 == 12) && a8 == 15) && a3 == 1) && a29 <= 245)) || (((a8 == 15 && ((a25 == 12 && a29 <= 130) || ((0 < a23 + 43 && a29 <= 130) && a25 <= 12))) && a3 == 1) && 1 == a4)) || (a29 + 22 <= 0 && (((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && (0 < a23 + 43 || !(input == 1))) && a3 == 1)) || ((((a8 == 15 && a25 == 10) && a3 == 1) && a29 <= 245) && 1 == a4)) || ((((a25 == 9 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 0 < a23 + 43) && a29 <= 245) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && a25 == 11) && a3 == 1)) || (((((((a8 == 15 && !(a25 == 13)) && a29 <= 599998) && (\exists v_prenex_37 : int :: (140 < v_prenex_37 && v_prenex_37 % 299861 + 10250 <= a29) && 0 == v_prenex_37 % 299861)) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10))) || (((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && ((140 < a29 && a25 == 12) && a8 == 15) && 0 < a23 + 43) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && 140 < a29) && !(a4 == 1)) && a3 == 1) && a29 <= 599998)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && a3 == 1) && (0 < a23 + 43 && a4 == 1) && a25 == 11) - InvariantResult [Line: 22]: Loop Invariant [2019-01-12 03:37:52,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,628 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,630 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,653 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,653 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,653 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:37:52,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_37,QUANTIFIED] [2019-01-12 03:37:52,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2019-01-12 03:37:52,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] [2019-01-12 03:37:52,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_44,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((a8 == 15 && ((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 <= 12) && 140 < a29) && 0 < a23 + 43) && 1 == a4) && a3 == 1) || (((((a8 == 15 && 13 <= a25) && 140 < a29) && a29 <= 245) && 1 == a4) && a3 == 1)) || ((((((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && a8 == 15) && a25 == 13) && 0 < a23 + 43) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && ((a25 <= 9 && 277 < a29) || (214883 <= a29 && a25 == 10))) && 1 == a4) && a3 == 1)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || ((a25 == 13 && ((a8 == 15 && 0 < a23 + 43) && a3 == 1) && 1 == a4) && a23 <= 262)) || ((((\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44) && (((a8 == 15 && 0 < a23 + 43) && a25 == 10) || ((a25 == 9 && a8 == 15) && 0 < a23 + 43))) && 1 == a4) && a3 == 1)) || (((((a25 == 13 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1) && a23 <= 262)) || (((a8 == 15 && !(a25 == 13)) && a3 == 1) && a29 + 275923 <= 0)) || ((((140 < a29 && a25 == 12) && a8 == 15) && a3 == 1) && a29 <= 245)) || (((a8 == 15 && ((a25 == 12 && a29 <= 130) || ((0 < a23 + 43 && a29 <= 130) && a25 <= 12))) && a3 == 1) && 1 == a4)) || (a29 + 22 <= 0 && (((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && (0 < a23 + 43 || !(input == 1))) && a3 == 1)) || ((((a8 == 15 && a25 == 10) && a3 == 1) && a29 <= 245) && 1 == a4)) || ((((a25 == 9 && a8 == 15) && 0 < a23 + 43) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 0 < a23 + 43) && a29 <= 245) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)) && a25 == 11) && a3 == 1)) || (((((((a8 == 15 && !(a25 == 13)) && a29 <= 599998) && (\exists v_prenex_37 : int :: (140 < v_prenex_37 && v_prenex_37 % 299861 + 10250 <= a29) && 0 == v_prenex_37 % 299861)) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10))) || (((\exists v_prenex_42 : int :: (0 <= v_prenex_42 + 69157 && 130 <= v_prenex_42) && a29 <= (v_prenex_42 + 69157) % 299861 + 300138) && ((140 < a29 && a25 == 12) && a8 == 15) && 0 < a23 + 43) && a3 == 1)) || (((((a25 == 12 && a8 == 15) && 140 < a29) && !(a4 == 1)) && a3 == 1) && a29 <= 599998)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (((a8 == 15 && (\exists v_prenex_44 : int :: (a29 <= v_prenex_44 % 299861 + 300139 && 0 <= v_prenex_44) && 277 < v_prenex_44)) && a3 == 1) && (0 < a23 + 43 && a4 == 1) && a25 == 11) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 103.4s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 73.4s AutomataDifference, 0.0s DeadEndRemovalTime, 11.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1312 SDtfs, 17074 SDslu, 1298 SDs, 0 SdLazy, 46047 SolverSat, 6210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2834 GetRequests, 2677 SyntacticMatches, 6 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15151occurred in iteration=7, 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: 2.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 20823 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 194 NumberOfFragments, 1149 HoareAnnotationTreeSize, 3 FomulaSimplifications, 364771 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 207804 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 6063 NumberOfCodeBlocks, 6063 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6042 ConstructedInterpolants, 774 QuantifiedInterpolants, 21390020 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3591 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 2811/5800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...