./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17769653fcc1793cb44568ec45f15628df5f1ace ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:05:13,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:05:13,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:05:13,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:05:13,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:05:13,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:05:13,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:05:13,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:05:13,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:05:13,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:05:13,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:05:13,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:05:13,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:05:13,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:05:13,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:05:13,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:05:13,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:05:13,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:05:13,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:05:13,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:05:13,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:05:13,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:05:13,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:05:13,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:05:13,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:05:13,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:05:13,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:05:13,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:05:13,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:05:13,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:05:13,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:05:13,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:05:13,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:05:13,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:05:13,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:05:13,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:05:13,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:05:13,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:05:13,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:05:13,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:05:13,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:05:13,334 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:05:13,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:05:13,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:05:13,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:05:13,344 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:05:13,344 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:05:13,344 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:05:13,344 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:05:13,344 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:05:13,344 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:05:13,344 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:05:13,345 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:05:13,345 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:05:13,345 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:05:13,345 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:05:13,345 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:05:13,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:05:13,346 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:05:13,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:05:13,347 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:05:13,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:05:13,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:05:13,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:05:13,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:05:13,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:05:13,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:05:13,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:05:13,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:05:13,348 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:05:13,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:05:13,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:05:13,348 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:05:13,348 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:05:13,349 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan 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 -> Taipan 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 -> 17769653fcc1793cb44568ec45f15628df5f1ace [2019-12-07 16:05:13,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:05:13,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:05:13,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:05:13,461 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:05:13,462 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:05:13,462 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-12-07 16:05:13,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/data/6412bb717/7d4f9ee478214c3d8c0307676a913fde/FLAG30e7ff1d5 [2019-12-07 16:05:13,838 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:05:13,838 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-12-07 16:05:13,845 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/data/6412bb717/7d4f9ee478214c3d8c0307676a913fde/FLAG30e7ff1d5 [2019-12-07 16:05:13,855 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/data/6412bb717/7d4f9ee478214c3d8c0307676a913fde [2019-12-07 16:05:13,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:05:13,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:05:13,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:05:13,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:05:13,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:05:13,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:05:13" (1/1) ... [2019-12-07 16:05:13,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431cfabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:13, skipping insertion in model container [2019-12-07 16:05:13,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:05:13" (1/1) ... [2019-12-07 16:05:13,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:05:13,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:05:14,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:05:14,128 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:05:14,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:05:14,184 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:05:14,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14 WrapperNode [2019-12-07 16:05:14,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:05:14,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:05:14,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:05:14,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:05:14,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:05:14,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:05:14,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:05:14,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:05:14,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... [2019-12-07 16:05:14,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:05:14,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:05:14,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:05:14,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:05:14,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/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-12-07 16:05:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:05:14,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:05:15,036 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:05:15,036 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 16:05:15,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:05:15 BoogieIcfgContainer [2019-12-07 16:05:15,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:05:15,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:05:15,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:05:15,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:05:15,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:05:13" (1/3) ... [2019-12-07 16:05:15,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4325d89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:05:15, skipping insertion in model container [2019-12-07 16:05:15,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:05:14" (2/3) ... [2019-12-07 16:05:15,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4325d89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:05:15, skipping insertion in model container [2019-12-07 16:05:15,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:05:15" (3/3) ... [2019-12-07 16:05:15,042 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-12-07 16:05:15,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:05:15,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:05:15,061 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:05:15,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:05:15,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:05:15,077 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:05:15,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:05:15,077 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:05:15,077 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:05:15,077 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:05:15,077 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:05:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-12-07 16:05:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:05:15,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:15,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:05:15,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1132803127, now seen corresponding path program 1 times [2019-12-07 16:05:15,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:05:15,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871682249] [2019-12-07 16:05:15,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:05:17,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871682249] [2019-12-07 16:05:17,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:05:17,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-12-07 16:05:17,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506416813] [2019-12-07 16:05:17,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-12-07 16:05:17,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:05:17,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-12-07 16:05:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 16:05:17,422 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 70 states. [2019-12-07 16:05:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:19,202 INFO L93 Difference]: Finished difference Result 80 states and 149 transitions. [2019-12-07 16:05:19,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-07 16:05:19,204 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-12-07 16:05:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:19,212 INFO L225 Difference]: With dead ends: 80 [2019-12-07 16:05:19,212 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 16:05:19,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 16:05:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 16:05:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-12-07 16:05:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 16:05:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-12-07 16:05:19,246 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-12-07 16:05:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:19,247 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-12-07 16:05:19,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-12-07 16:05:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-12-07 16:05:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 16:05:19,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:19,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:05:19,250 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash 766868007, now seen corresponding path program 1 times [2019-12-07 16:05:19,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:05:19,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534076572] [2019-12-07 16:05:19,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:05:21,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534076572] [2019-12-07 16:05:21,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118618589] [2019-12-07 16:05:21,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:21,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 71 conjunts are in the unsatisfiable core [2019-12-07 16:05:21,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:21,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:21,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:22,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:05:23,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:05:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:24,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:25,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:05:27,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1492259758] [2019-12-07 16:05:27,758 INFO L159 IcfgInterpreter]: Started Sifa with 72 locations of interest [2019-12-07 16:05:27,758 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:05:27,762 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:05:27,766 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:05:27,767 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:05:27,925 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:05:34,043 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 16:05:34,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:05:34,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-12-07 16:05:34,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755379900] [2019-12-07 16:05:34,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-12-07 16:05:34,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:05:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-12-07 16:05:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10884, Invalid=33006, Unknown=0, NotChecked=0, Total=43890 [2019-12-07 16:05:34,069 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 140 states. [2019-12-07 16:05:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:36,303 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2019-12-07 16:05:36,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-12-07 16:05:36,303 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 72 [2019-12-07 16:05:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:36,304 INFO L225 Difference]: With dead ends: 108 [2019-12-07 16:05:36,305 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 16:05:36,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 7 SyntacticMatches, 69 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15193 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=10884, Invalid=33006, Unknown=0, NotChecked=0, Total=43890 [2019-12-07 16:05:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 16:05:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-12-07 16:05:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 16:05:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-12-07 16:05:36,316 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 72 [2019-12-07 16:05:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:36,317 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-12-07 16:05:36,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-12-07 16:05:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-12-07 16:05:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 16:05:36,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:36,318 INFO L410 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 16:05:36,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:36,519 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:36,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:36,519 INFO L82 PathProgramCache]: Analyzing trace with hash -433481177, now seen corresponding path program 2 times [2019-12-07 16:05:36,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:05:36,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657857897] [2019-12-07 16:05:36,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:05:41,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657857897] [2019-12-07 16:05:41,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864660794] [2019-12-07 16:05:41,920 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:42,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-07 16:05:42,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:05:42,049 WARN L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 111 conjunts are in the unsatisfiable core [2019-12-07 16:05:42,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:05:52,874 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:06:02,698 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 16:06:03,214 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-12-07 16:06:03,765 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 16:06:04,363 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-12-07 16:06:04,960 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-12-07 16:06:05,562 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-12-07 16:06:06,308 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-12-07 16:06:08,003 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-12-07 16:06:08,760 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-12-07 16:06:09,732 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-12-07 16:06:10,638 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99 [2019-12-07 16:06:12,190 WARN L192 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2019-12-07 16:06:13,653 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 107 [2019-12-07 16:06:15,271 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 114 [2019-12-07 16:06:16,392 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 117 [2019-12-07 16:06:17,844 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 124 [2019-12-07 16:06:19,477 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 127 [2019-12-07 16:06:20,889 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 132 [2019-12-07 16:06:22,482 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 139 [2019-12-07 16:06:24,002 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 142 [2019-12-07 16:06:25,389 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 147 [2019-12-07 16:06:26,772 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 154 [2019-12-07 16:06:28,233 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 161 [2019-12-07 16:06:29,673 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 168 [2019-12-07 16:06:31,674 WARN L192 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 167 [2019-12-07 16:06:33,287 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 174 [2019-12-07 16:06:34,895 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 181 [2019-12-07 16:06:36,924 WARN L192 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 182 [2019-12-07 16:06:38,608 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 189 [2019-12-07 16:06:40,711 WARN L192 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 192 [2019-12-07 16:06:42,772 WARN L192 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 197 [2019-12-07 16:06:44,488 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 204 [2019-12-07 16:06:46,281 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 211 [2019-12-07 16:06:48,238 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 218 [2019-12-07 16:06:50,973 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 258 DAG size of output: 217 [2019-12-07 16:06:53,436 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 264 DAG size of output: 222 [2019-12-07 16:06:55,925 WARN L192 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 270 DAG size of output: 227 [2019-12-07 16:06:58,021 WARN L192 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 234 [2019-12-07 16:07:00,207 WARN L192 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 241 [2019-12-07 16:07:02,321 WARN L192 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 248 [2019-12-07 16:07:04,570 WARN L192 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 255 [2019-12-07 16:07:06,947 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 254 [2019-12-07 16:07:09,246 WARN L192 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 261 [2019-12-07 16:07:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:07:09,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [385610667] [2019-12-07 16:07:09,503 INFO L159 IcfgInterpreter]: Started Sifa with 72 locations of interest [2019-12-07 16:07:09,503 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:07:09,504 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:07:09,504 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:07:09,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:07:09,597 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:07:30,837 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 16:07:30,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:07:30,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 256 [2019-12-07 16:07:30,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815086484] [2019-12-07 16:07:30,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 257 states [2019-12-07 16:07:30,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:07:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 257 interpolants. [2019-12-07 16:07:30,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10548, Invalid=96054, Unknown=0, NotChecked=0, Total=106602 [2019-12-07 16:07:30,843 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 257 states. [2019-12-07 16:07:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:07:45,611 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-12-07 16:07:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-12-07 16:07:45,612 INFO L78 Accepts]: Start accepts. Automaton has 257 states. Word has length 104 [2019-12-07 16:07:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:07:45,612 INFO L225 Difference]: With dead ends: 107 [2019-12-07 16:07:45,612 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:07:45,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 38 SyntacticMatches, 50 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29391 ImplicationChecksByTransitivity, 113.2s TimeCoverageRelationStatistics Valid=10555, Invalid=96701, Unknown=0, NotChecked=0, Total=107256 [2019-12-07 16:07:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:07:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:07:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:07:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:07:45,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-12-07 16:07:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:07:45,616 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:07:45,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 257 states. [2019-12-07 16:07:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:07:45,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:07:45,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:07:45,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:07:46,372 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 208 [2019-12-07 16:07:46,562 INFO L242 CegarLoopResult]: At program point L1126(lines 74 1127) the Hoare annotation is: (and (<= 11 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 11) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,562 INFO L242 CegarLoopResult]: At program point L994(lines 140 995) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= 22 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 22) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,562 INFO L242 CegarLoopResult]: At program point L862(lines 206 863) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 33) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 33 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L730(lines 272 731) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 44) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 44 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L598(lines 338 599) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L466(lines 404 467) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 66) (<= 66 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 66) (<= 66 ULTIMATE.start_main_~main__x~0)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L1162(lines 56 1163) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 8) (<= 8 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L1030(lines 122 1031) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 19) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 19 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L898(lines 188 899) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 30) (<= 30 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L766(lines 254 767) the Hoare annotation is: (and (<= 41 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 41) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,563 INFO L242 CegarLoopResult]: At program point L634(lines 320 635) the Hoare annotation is: (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L502(lines 386 503) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 64) (<= 63 ULTIMATE.start_main_~main__y~0)) [2019-12-07 16:07:46,564 INFO L246 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L1198(lines 38 1199) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 5) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 5 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L1066(lines 104 1067) the Hoare annotation is: (and (<= 16 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 16) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L934(lines 170 935) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 27) (<= 27 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L802(lines 236 803) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 38) (<= 38 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L670(lines 302 671) the Hoare annotation is: (and (<= 49 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 49) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L538(lines 368 539) the Hoare annotation is: (and (<= 60 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 61) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) [2019-12-07 16:07:46,564 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L1234(lines 20 1235) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 2) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 2 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L1102(lines 86 1103) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 13) (<= ULTIMATE.start_main_~main__y~0 50) (<= 13 ULTIMATE.start_main_~main__x~0)) [2019-12-07 16:07:46,564 INFO L246 CegarLoopResult]: For program point L12(lines 12 1252) no Hoare annotation was computed. [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L970(lines 152 971) the Hoare annotation is: (and (<= 24 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 24) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,564 INFO L242 CegarLoopResult]: At program point L838(lines 218 839) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 35) (<= 35 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L706(lines 284 707) the Hoare annotation is: (and (<= 46 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 46) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L574(lines 350 575) the Hoare annotation is: (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L1138(lines 68 1139) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 10) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= 10 ULTIMATE.start_main_~main__x~0)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L1006(lines 134 1007) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 21) (<= 21 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L874(lines 200 875) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 32) (<= 32 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L742(lines 266 743) the Hoare annotation is: (and (<= 43 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 43) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L610(lines 332 611) the Hoare annotation is: (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L478(lines 398 479) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__x~0) (<= 65 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 66)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L1174(lines 50 1175) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 7) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 7 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L1042(lines 116 1043) the Hoare annotation is: (and (<= 18 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 18) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L910(lines 182 911) the Hoare annotation is: (and (<= 29 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 29) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,565 INFO L242 CegarLoopResult]: At program point L778(lines 248 779) the Hoare annotation is: (and (<= 40 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 40) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L646(lines 314 647) the Hoare annotation is: (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L514(lines 380 515) the Hoare annotation is: (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) [2019-12-07 16:07:46,566 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L1210(lines 32 1211) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 4) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 4 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L1078(lines 98 1079) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 15) (<= 15 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L946(lines 164 947) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 26) (<= 26 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L814(lines 230 815) the Hoare annotation is: (and (<= 37 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 37) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L682(lines 296 683) the Hoare annotation is: (and (<= 48 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 48) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L550(lines 362 551) the Hoare annotation is: (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (< ULTIMATE.start_main_~main__x~0 60) (<= 59 ULTIMATE.start_main_~main__x~0)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L1246(lines 14 1247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 1) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L1114(lines 80 1115) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 12) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 12 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L982(lines 146 983) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 23) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 23 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L850(lines 212 851) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 34) (<= ULTIMATE.start_main_~main__y~0 50) (<= 34 ULTIMATE.start_main_~main__x~0)) [2019-12-07 16:07:46,566 INFO L242 CegarLoopResult]: At program point L718(lines 278 719) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 45) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 45 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,567 INFO L242 CegarLoopResult]: At program point L586(lines 344 587) the Hoare annotation is: (and (<= 56 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 57) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) [2019-12-07 16:07:46,567 INFO L242 CegarLoopResult]: At program point L454(lines 410 455) the Hoare annotation is: (or (and (<= 71 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 71) (<= 71 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 72)) (and (<= 77 ULTIMATE.start_main_~main__y~0) (<= 77 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 77) (< ULTIMATE.start_main_~main__x~0 78)) (and (<= 80 ULTIMATE.start_main_~main__y~0) (<= 80 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 81) (<= ULTIMATE.start_main_~main__y~0 80)) (and (<= 100 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 100) (< ULTIMATE.start_main_~main__x~0 101) (<= 100 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 73) (<= 73 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 74) (<= 73 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 85) (< ULTIMATE.start_main_~main__x~0 86) (<= 85 ULTIMATE.start_main_~main__y~0) (<= 85 ULTIMATE.start_main_~main__x~0)) (and (< ULTIMATE.start_main_~main__x~0 92) (<= 91 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 91) (<= 91 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 75) (<= 75 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 76) (<= 75 ULTIMATE.start_main_~main__x~0)) (and (<= 87 ULTIMATE.start_main_~main__y~0) (<= 87 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 87) (< ULTIMATE.start_main_~main__x~0 88)) (and (< ULTIMATE.start_main_~main__x~0 89) (<= 88 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 88) (<= 88 ULTIMATE.start_main_~main__y~0)) (and (<= 94 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 95) (<= 94 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 94)) (and (<= 89 ULTIMATE.start_main_~main__x~0) (<= 89 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 89) (< ULTIMATE.start_main_~main__x~0 90)) (and (<= ULTIMATE.start_main_~main__y~0 84) (<= 84 ULTIMATE.start_main_~main__y~0) (<= 84 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 85)) (and (<= 96 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 96) (< ULTIMATE.start_main_~main__x~0 97) (<= 96 ULTIMATE.start_main_~main__x~0)) (and (<= 76 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 77) (<= 76 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 76)) (and (<= 90 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 91) (<= 90 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 90)) (and (<= 74 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 74) (<= 74 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 75)) (and (<= 92 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 92) (< ULTIMATE.start_main_~main__x~0 93) (<= 92 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__y~0 69) (<= 69 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 70) (<= 69 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 97) (<= 97 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 98) (<= 97 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 98) (<= 98 ULTIMATE.start_main_~main__x~0) (<= 98 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 99)) (and (< ULTIMATE.start_main_~main__x~0 71) (<= ULTIMATE.start_main_~main__y~0 70) (<= 70 ULTIMATE.start_main_~main__y~0) (<= 70 ULTIMATE.start_main_~main__x~0)) (and (<= 83 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 83) (< ULTIMATE.start_main_~main__x~0 84) (<= 83 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 93) (< ULTIMATE.start_main_~main__x~0 94) (<= 93 ULTIMATE.start_main_~main__x~0) (<= 93 ULTIMATE.start_main_~main__y~0)) (and (<= 99 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 100) (<= 99 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 99)) (and (<= 95 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 95) (<= 95 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 96)) (and (<= 81 ULTIMATE.start_main_~main__x~0) (<= 81 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 81) (< ULTIMATE.start_main_~main__x~0 82)) (and (<= 82 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 82) (<= 82 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 83)) (and (<= 79 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 80) (<= 79 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 79)) (and (<= 67 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 68) (<= 67 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 67)) (and (<= ULTIMATE.start_main_~main__y~0 86) (<= 86 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 87) (<= 86 ULTIMATE.start_main_~main__y~0)) (and (<= 68 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 69) (<= 68 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 68)) (and (<= 72 ULTIMATE.start_main_~main__y~0) (<= 72 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 73) (<= ULTIMATE.start_main_~main__y~0 72)) (and (<= 78 ULTIMATE.start_main_~main__x~0) (<= 78 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 79) (<= ULTIMATE.start_main_~main__y~0 78))) [2019-12-07 16:07:46,567 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:07:46,567 INFO L242 CegarLoopResult]: At program point L1150(lines 62 1151) the Hoare annotation is: (and (<= 9 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 9) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,567 INFO L242 CegarLoopResult]: At program point L1018(lines 128 1019) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 20) (<= 20 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,567 INFO L242 CegarLoopResult]: At program point L886(lines 194 887) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 31) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= 31 ULTIMATE.start_main_~main__x~0)) [2019-12-07 16:07:46,567 INFO L242 CegarLoopResult]: At program point L754(lines 260 755) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 42) (<= 42 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,567 INFO L242 CegarLoopResult]: At program point L622(lines 326 623) the Hoare annotation is: (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= 53 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 54)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L490(lines 392 491) the Hoare annotation is: (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) [2019-12-07 16:07:46,568 INFO L249 CegarLoopResult]: At program point L1251(lines 8 1253) the Hoare annotation is: true [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L1186(lines 44 1187) the Hoare annotation is: (and (<= 6 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 6) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L1054(lines 110 1055) the Hoare annotation is: (and (<= 17 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50) (<= ULTIMATE.start_main_~main__x~0 17)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L922(lines 176 923) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 28) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 28 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L790(lines 242 791) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 39) (<= 39 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L658(lines 308 659) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (< ULTIMATE.start_main_~main__x~0 51) (<= 50 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L526(lines 374 527) the Hoare annotation is: (and (<= 61 ULTIMATE.start_main_~main__x~0) (< ULTIMATE.start_main_~main__x~0 62) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) [2019-12-07 16:07:46,568 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L1222(lines 26 1223) the Hoare annotation is: (and (<= 3 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 3) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L1090(lines 92 1091) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 14) (<= 14 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L958(lines 158 959) the Hoare annotation is: (and (<= 25 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 25) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,568 INFO L242 CegarLoopResult]: At program point L826(lines 224 827) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 36) (<= 36 ULTIMATE.start_main_~main__x~0) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,569 INFO L242 CegarLoopResult]: At program point L694(lines 290 695) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 47) (<= 50 ULTIMATE.start_main_~main__y~0) (<= 47 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-12-07 16:07:46,569 INFO L242 CegarLoopResult]: At program point L562(lines 356 563) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) [2019-12-07 16:07:46,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:07:46 BoogieIcfgContainer [2019-12-07 16:07:46,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:07:46,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:07:46,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:07:46,606 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:07:46,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:05:15" (3/4) ... [2019-12-07 16:07:46,609 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:07:46,624 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 16:07:46,625 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:07:46,700 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_204d2d6f-716e-492f-8c26-e8ac022f0cc2/bin/utaipan/witness.graphml [2019-12-07 16:07:46,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:07:46,701 INFO L168 Benchmark]: Toolchain (without parser) took 152843.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 946.1 MB in the beginning and 947.1 MB in the end (delta: -1.1 MB). Peak memory consumption was 237.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:07:46,701 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:07:46,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:07:46,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:07:46,702 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:07:46,702 INFO L168 Benchmark]: RCFGBuilder took 785.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 144.3 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:07:46,702 INFO L168 Benchmark]: TraceAbstraction took 151568.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 977.9 MB in the beginning and 964.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:07:46,702 INFO L168 Benchmark]: Witness Printer took 94.37 ms. Allocated memory is still 1.3 GB. Free memory was 964.9 MB in the beginning and 947.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:07:46,704 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 785.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 144.3 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 151568.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 977.9 MB in the beginning and 964.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. * Witness Printer took 94.37 ms. Allocated memory is still 1.3 GB. Free memory was 964.9 MB in the beginning and 947.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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: 182]: Loop Invariant Derived loop invariant: ((29 <= main__x && main__x <= 29) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((61 <= main__x && main__x < 62) && main__y <= 61) && 61 <= main__y - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((50 <= main__y && 22 <= main__x) && main__x <= 22) && main__y <= 50 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((main__x <= 47 && 50 <= main__y) && 47 <= main__x) && main__y <= 50 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((main__x <= 15 && 15 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((40 <= main__x && main__x <= 40) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((main__x <= 8 && 8 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((25 <= main__x && 50 <= main__y) && main__x <= 25) && main__y <= 50 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57 - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x < 51) && 50 <= main__x) && main__y <= 50 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((18 <= main__x && main__x <= 18) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((43 <= main__x && 50 <= main__y) && main__x <= 43) && main__y <= 50 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((11 <= main__x && 50 <= main__y) && main__x <= 11) && main__y <= 50 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((main__x <= 36 && 36 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__x <= 4 && 50 <= main__y) && 4 <= main__x) && main__y <= 50 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((main__x <= 21 && 21 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((53 <= main__y && main__y <= 53) && 53 <= main__x) && main__x < 54 - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((46 <= main__x && main__x <= 46) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 14) && 14 <= main__x) && main__y <= 50 - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: ((main__x <= 39 && 39 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((main__x <= 7 && 50 <= main__y) && 7 <= main__x) && main__y <= 50 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((main__x <= 32 && 32 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64 - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((49 <= main__x && 50 <= main__y) && main__x <= 49) && main__y <= 50 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((17 <= main__x && 50 <= main__y) && main__y <= 50) && main__x <= 17 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 42) && 42 <= main__x) && main__y <= 50 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((main__x <= 10 && 50 <= main__y) && main__y <= 50) && 10 <= main__x - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((main__x <= 35 && 35 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((71 <= main__x && main__y <= 71) && 71 <= main__y) && main__x < 72) || (((77 <= main__y && 77 <= main__x) && main__y <= 77) && main__x < 78)) || (((80 <= main__y && 80 <= main__x) && main__x < 81) && main__y <= 80)) || (((100 <= main__x && main__y <= 100) && main__x < 101) && 100 <= main__y)) || (((main__y <= 73 && 73 <= main__x) && main__x < 74) && 73 <= main__y)) || (((main__y <= 85 && main__x < 86) && 85 <= main__y) && 85 <= main__x)) || (((main__x < 92 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((main__y <= 75 && 75 <= main__y) && main__x < 76) && 75 <= main__x)) || (((87 <= main__y && 87 <= main__x) && main__y <= 87) && main__x < 88)) || (((main__x < 89 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((94 <= main__x && main__x < 95) && 94 <= main__y) && main__y <= 94)) || (((89 <= main__x && 89 <= main__y) && main__y <= 89) && main__x < 90)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x < 85)) || (((96 <= main__y && main__y <= 96) && main__x < 97) && 96 <= main__x)) || (((76 <= main__x && main__x < 77) && 76 <= main__y) && main__y <= 76)) || (((90 <= main__y && main__x < 91) && 90 <= main__x) && main__y <= 90)) || (((74 <= main__y && main__y <= 74) && 74 <= main__x) && main__x < 75)) || (((92 <= main__y && main__y <= 92) && main__x < 93) && 92 <= main__x)) || (((main__y <= 69 && 69 <= main__x) && main__x < 70) && 69 <= main__y)) || (((main__y <= 97 && 97 <= main__x) && main__x < 98) && 97 <= main__y)) || (((main__y <= 98 && 98 <= main__x) && 98 <= main__y) && main__x < 99)) || (((main__x < 71 && main__y <= 70) && 70 <= main__y) && 70 <= main__x)) || (((83 <= main__x && main__y <= 83) && main__x < 84) && 83 <= main__y)) || (((main__y <= 93 && main__x < 94) && 93 <= main__x) && 93 <= main__y)) || (((99 <= main__x && main__x < 100) && 99 <= main__y) && main__y <= 99)) || (((95 <= main__x && main__y <= 95) && 95 <= main__y) && main__x < 96)) || (((81 <= main__x && 81 <= main__y) && main__y <= 81) && main__x < 82)) || (((82 <= main__y && main__y <= 82) && 82 <= main__x) && main__x < 83)) || (((79 <= main__x && main__x < 80) && 79 <= main__y) && main__y <= 79)) || (((67 <= main__y && main__x < 68) && 67 <= main__x) && main__y <= 67)) || (((main__y <= 86 && 86 <= main__x) && main__x < 87) && 86 <= main__y)) || (((68 <= main__y && main__x < 69) && 68 <= main__x) && main__y <= 68)) || (((72 <= main__y && 72 <= main__x) && main__x < 73) && main__y <= 72)) || (((78 <= main__x && 78 <= main__y) && main__x < 79) && main__y <= 78) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((3 <= main__x && 50 <= main__y) && main__x <= 3) && main__y <= 50 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((main__x <= 28 && 50 <= main__y) && 28 <= main__x) && main__y <= 50 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((60 <= main__y && main__x < 61) && 60 <= main__x) && main__y <= 60 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__x <= 45 && 50 <= main__y) && 45 <= main__x) && main__y <= 50 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 13) && main__y <= 50) && 13 <= main__x - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((main__x <= 38 && 38 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((6 <= main__x && 50 <= main__y) && main__x <= 6) && main__y <= 50 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((main__x <= 31 && 50 <= main__y) && main__y <= 50) && 31 <= main__x - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((main__y <= 63 && 63 <= main__x) && main__x < 64) && 63 <= main__y - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((24 <= main__x && 50 <= main__y) && main__x <= 24) && main__y <= 50 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((56 <= main__y && main__x < 57) && 56 <= main__x) && main__y <= 56 - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((41 <= main__x && main__x <= 41) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((9 <= main__x && 50 <= main__y) && main__x <= 9) && main__y <= 50 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: ((50 <= main__y && main__x <= 34) && main__y <= 50) && 34 <= main__x - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((main__y <= 66 && 66 <= main__y) && main__x <= 66) && 66 <= main__x - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((main__x <= 2 && 50 <= main__y) && 2 <= main__x) && main__y <= 50 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((main__x <= 27 && 27 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((59 <= main__y && main__y <= 59) && main__x < 60) && 59 <= main__x - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: ((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((main__x <= 20 && 20 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((37 <= main__x && 50 <= main__y) && main__x <= 37) && main__y <= 50 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((main__x <= 5 && 50 <= main__y) && 5 <= main__x) && main__y <= 50 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((main__x <= 30 && 30 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((main__x <= 23 && 50 <= main__y) && 23 <= main__x) && main__y <= 50 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((48 <= main__x && 50 <= main__y) && main__x <= 48) && main__y <= 50 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((16 <= main__x && main__x <= 16) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((main__x <= 33 && 50 <= main__y) && 33 <= main__x) && main__y <= 50 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((main__y <= 65 && 65 <= main__x) && 65 <= main__y) && main__x < 66 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 1) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((main__x <= 26 && 26 <= main__x) && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((main__x <= 19 && 50 <= main__y) && 19 <= main__x) && main__y <= 50 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((main__x <= 44 && 50 <= main__y) && 44 <= main__x) && main__y <= 50 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((main__x <= 12 && 50 <= main__y) && 12 <= main__x) && main__y <= 50 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 1 error locations. Result: SAFE, OverallTime: 150.7s, OverallIterations: 3, TraceHistogramMax: 33, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 11 SDtfs, 2 SDslu, 80 SDs, 0 SdLazy, 19603 SolverSat, 8255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 767 GetRequests, 46 SyntacticMatches, 119 SemanticMatches, 602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44584 ImplicationChecksByTransitivity, 129.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 103 NumberOfFragments, 1302 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 68 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 103.2s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 1775420 SizeOfPredicates, 7 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...