./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_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak --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 Kojak --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-02 05:20:49,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 05:20:49,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 05:20:49,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 05:20:49,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 05:20:49,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 05:20:49,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 05:20:49,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 05:20:49,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 05:20:49,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 05:20:49,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 05:20:49,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 05:20:49,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 05:20:49,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 05:20:49,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 05:20:49,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 05:20:49,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 05:20:49,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 05:20:49,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 05:20:49,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 05:20:49,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 05:20:49,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 05:20:49,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 05:20:49,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 05:20:49,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 05:20:49,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 05:20:49,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 05:20:49,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 05:20:49,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 05:20:49,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 05:20:49,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 05:20:49,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 05:20:49,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 05:20:49,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 05:20:49,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 05:20:49,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 05:20:49,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 05:20:49,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 05:20:49,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 05:20:49,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 05:20:49,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 05:20:49,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 05:20:49,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 05:20:49,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 05:20:49,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 05:20:49,361 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 05:20:49,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 05:20:49,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 05:20:49,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 05:20:49,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 05:20:49,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 05:20:49,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 05:20:49,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 05:20:49,364 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 05:20:49,364 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 05:20:49,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 05:20:49,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 05:20:49,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 05:20:49,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 05:20:49,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 05:20:49,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 05:20:49,365 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 05:20:49,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 05:20:49,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 05:20:49,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak 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 -> Kojak 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-02 05:20:49,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 05:20:49,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 05:20:49,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 05:20:49,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 05:20:49,479 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 05:20:49,479 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-12-02 05:20:49,524 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/data/feabe458a/c4e2aeb0e7514d54a0e793b87045e16d/FLAG5ac215244 [2019-12-02 05:20:49,952 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 05:20:49,952 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-12-02 05:20:49,960 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/data/feabe458a/c4e2aeb0e7514d54a0e793b87045e16d/FLAG5ac215244 [2019-12-02 05:20:49,968 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/data/feabe458a/c4e2aeb0e7514d54a0e793b87045e16d [2019-12-02 05:20:49,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 05:20:49,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 05:20:49,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 05:20:49,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 05:20:49,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 05:20:49,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:20:49" (1/1) ... [2019-12-02 05:20:49,976 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 02.12 05:20:49, skipping insertion in model container [2019-12-02 05:20:49,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:20:49" (1/1) ... [2019-12-02 05:20:49,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 05:20:50,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 05:20:50,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:20:50,211 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 05:20:50,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 05:20:50,267 INFO L208 MainTranslator]: Completed translation [2019-12-02 05:20:50,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50 WrapperNode [2019-12-02 05:20:50,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 05:20:50,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 05:20:50,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 05:20:50,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 05:20:50,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 05:20:50,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 05:20:50,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 05:20:50,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 05:20:50,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... [2019-12-02 05:20:50,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 05:20:50,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 05:20:50,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 05:20:50,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 05:20:50,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:20:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-12-02 05:20:50,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 05:20:50,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 05:20:51,114 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 05:20:51,115 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-02 05:20:51,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:51 BoogieIcfgContainer [2019-12-02 05:20:51,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 05:20:51,116 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 05:20:51,116 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 05:20:51,123 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 05:20:51,123 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:51" (1/1) ... [2019-12-02 05:20:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 05:20:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:20:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 74 states and 142 transitions. [2019-12-02 05:20:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 142 transitions. [2019-12-02 05:20:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-02 05:20:51,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:20:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:20:53,433 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-02 05:20:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:20:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 75 states and 76 transitions. [2019-12-02 05:20:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-12-02 05:20:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-02 05:20:57,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:20:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:20:57,869 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-02 05:20:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:20:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-12-02 05:20:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-12-02 05:20:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-02 05:20:58,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:20:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:20:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:20:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:20:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-12-02 05:20:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-12-02 05:20:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-02 05:20:58,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:20:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:20:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:20:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:20:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-12-02 05:20:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-12-02 05:20:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-02 05:20:59,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:20:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:20:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-12-02 05:21:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-12-02 05:21:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-02 05:21:00,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-12-02 05:21:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-12-02 05:21:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-02 05:21:00,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-12-02 05:21:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-12-02 05:21:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-02 05:21:01,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-12-02 05:21:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-12-02 05:21:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-02 05:21:02,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-12-02 05:21:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-12-02 05:21:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 05:21:03,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-12-02 05:21:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-12-02 05:21:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-02 05:21:04,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-12-02 05:21:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-12-02 05:21:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-02 05:21:05,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-12-02 05:21:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-12-02 05:21:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-02 05:21:06,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-12-02 05:21:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-12-02 05:21:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-02 05:21:07,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-12-02 05:21:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-12-02 05:21:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-02 05:21:08,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-12-02 05:21:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-12-02 05:21:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 05:21:10,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-12-02 05:21:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-12-02 05:21:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-02 05:21:11,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-12-02 05:21:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-12-02 05:21:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-02 05:21:13,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-12-02 05:21:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-12-02 05:21:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-02 05:21:14,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-12-02 05:21:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-12-02 05:21:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-02 05:21:16,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-12-02 05:21:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-12-02 05:21:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-02 05:21:18,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-12-02 05:21:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-12-02 05:21:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-02 05:21:20,503 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-12-02 05:21:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-12-02 05:21:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-02 05:21:22,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-12-02 05:21:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-12-02 05:21:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-02 05:21:24,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-12-02 05:21:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-12-02 05:21:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-02 05:21:26,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-12-02 05:21:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-12-02 05:21:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-02 05:21:28,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-12-02 05:21:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-12-02 05:21:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-02 05:21:31,407 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-12-02 05:21:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-12-02 05:21:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-02 05:21:33,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-12-02 05:21:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-12-02 05:21:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-02 05:21:36,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-12-02 05:21:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-12-02 05:21:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-02 05:21:39,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-12-02 05:21:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-12-02 05:21:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-02 05:21:41,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-12-02 05:21:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-12-02 05:21:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-02 05:21:44,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-12-02 05:21:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-12-02 05:21:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-02 05:21:47,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:21:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 05:21:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:21:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 107 states and 106 transitions. [2019-12-02 05:21:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 106 transitions. [2019-12-02 05:21:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-02 05:21:50,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 05:21:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 05:22:03,295 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-02 05:23:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 05:23:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 105 states and 104 transitions. [2019-12-02 05:23:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 104 transitions. [2019-12-02 05:23:05,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-02 05:23:05,446 WARN L425 CodeCheckObserver]: This Program is SAFE, Check terminated with 35 iterations. [2019-12-02 05:23:05,452 INFO L765 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2019-12-02 05:23:05,754 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2019-12-02 05:23:05,889 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,897 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,897 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,898 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,898 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,899 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,900 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,900 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,901 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,901 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,902 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,902 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,903 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,903 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,904 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,904 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,905 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,905 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,906 INFO L569 CodeCheckObserver]: Invariant with dag size 1 [2019-12-02 05:23:05,906 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,907 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,907 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,907 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,908 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,908 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,909 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,909 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,910 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,910 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,910 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,911 INFO L569 CodeCheckObserver]: Invariant with dag size 206 [2019-12-02 05:23:05,918 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,919 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,919 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,920 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,920 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,920 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,921 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,921 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,921 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,922 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,922 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,922 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,923 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,923 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,923 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,924 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,924 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,924 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,925 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,925 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,925 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,926 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,926 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,926 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,927 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,927 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,927 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,928 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,928 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,928 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,928 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,929 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,929 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,929 INFO L569 CodeCheckObserver]: Invariant with dag size 8 [2019-12-02 05:23:05,929 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,930 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,930 INFO L569 CodeCheckObserver]: Invariant with dag size 9 [2019-12-02 05:23:05,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 05:23:05 ImpRootNode [2019-12-02 05:23:05,931 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 05:23:05,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 05:23:05,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 05:23:05,931 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 05:23:05,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:20:51" (3/4) ... [2019-12-02 05:23:05,935 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-02 05:23:05,951 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-02 05:23:05,953 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-02 05:23:06,049 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d1f645d2-4641-482c-a7c5-742faf829dca/bin/ukojak/witness.graphml [2019-12-02 05:23:06,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 05:23:06,050 INFO L168 Benchmark]: Toolchain (without parser) took 136079.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-12-02 05:23:06,051 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 05:23:06,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-12-02 05:23:06,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.71 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-02 05:23:06,052 INFO L168 Benchmark]: Boogie Preprocessor took 23.53 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-02 05:23:06,052 INFO L168 Benchmark]: RCFGBuilder took 782.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.5 MB in the end (delta: 137.6 MB). Peak memory consumption was 137.6 MB. Max. memory is 11.5 GB. [2019-12-02 05:23:06,053 INFO L168 Benchmark]: CodeCheck took 134814.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 978.5 MB in the beginning and 1.2 GB in the end (delta: -180.9 MB). Peak memory consumption was 405.2 MB. Max. memory is 11.5 GB. [2019-12-02 05:23:06,053 INFO L168 Benchmark]: Witness Printer took 118.43 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-12-02 05:23:06,055 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 74 locations, 1 error locations. Result: SAFE, OverallTime: 134.3s, OverallIterations: 35, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 922 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22333 GetRequests, 18390 SyntacticMatches, 3167 SemanticMatches, 776 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323413 ImplicationChecksByTransitivity, 129.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 58.2s InterpolantComputationTime, 2975 NumberOfCodeBlocks, 2975 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2941 ConstructedInterpolants, 0 QuantifiedInterpolants, 1803698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 0/6545 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - 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: ((main__x <= 61 && 61 <= main__x) && 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: ((main__x <= 50 && 50 <= main__y) && 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: 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) && main__x <= 53) && 53 <= main__x - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - 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: (((((((((((((((((((((((((((((((((((main__y <= 83 && 83 <= main__y) && 82 < main__x) && main__x <= 83) || (((main__y <= 93 && 93 <= main__y) && main__x <= 93) && 92 < main__x)) || (((74 <= main__y && main__y <= 74) && main__x <= 74) && 73 < main__x)) || (((68 <= main__y && main__x <= 68) && 68 <= main__x) && main__y <= 68)) || (((main__x <= 67 && 67 <= main__y) && 67 <= main__x) && main__y <= 67)) || (((81 <= main__y && 80 < main__x) && main__y <= 81) && main__x <= 81)) || (((92 <= main__y && main__y <= 92) && 92 <= main__x) && main__x <= 92)) || (((94 <= main__x && main__x <= 94) && 94 <= main__y) && main__y <= 94)) || (((main__x <= 76 && 76 <= main__y) && main__y <= 76) && 75 < main__x)) || (((main__y <= 85 && main__x <= 85) && 85 <= main__y) && 85 <= main__x)) || (((main__y <= 86 && 86 <= main__x) && main__x <= 86) && 86 <= main__y)) || (((80 <= main__y && 80 <= main__x) && main__x <= 80) && main__y <= 80)) || (((77 <= main__y && 76 < main__x) && main__x <= 77) && main__y <= 77)) || (((89 <= main__y && main__y <= 89) && 88 < main__x) && main__x <= 89)) || (((main__x <= 95 && main__y <= 95) && 95 <= main__y) && 94 < main__x)) || (((main__y <= 75 && 75 <= main__y) && main__x <= 75) && 75 <= main__x)) || (((82 <= main__y && main__y <= 82) && 81 < main__x) && main__x <= 82)) || (((90 <= main__y && main__x <= 90) && 90 <= main__x) && main__y <= 90)) || (((78 <= main__x && main__x <= 78) && 78 <= main__y) && main__y <= 78)) || (((72 <= main__y && 72 <= main__x) && main__x <= 72) && main__y <= 72)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((99 <= main__x && 99 <= main__y) && main__x <= 99) && main__y <= 99)) || (((main__x <= 70 && main__y <= 70) && 70 <= main__y) && 70 <= main__x)) || (((87 <= main__y && 86 < main__x) && main__x <= 87) && main__y <= 87)) || (((main__y <= 98 && 98 <= main__x) && 98 <= main__y) && main__x <= 98)) || ((99 < main__x && main__y <= 100) && 100 <= main__y)) || (((main__y <= 97 && main__x <= 97) && 97 <= main__y) && 96 < main__x)) || (((main__y <= 71 && 70 < main__x) && main__x <= 71) && 71 <= main__y)) || (((79 <= main__y && main__x <= 79) && 78 < main__x) && main__y <= 79)) || (((main__x <= 91 && main__y <= 91) && 91 <= main__y) && 90 < main__x)) || (((main__y <= 73 && main__x <= 73) && 73 <= main__y) && 72 < main__x)) || (((main__x <= 96 && 96 <= main__y) && main__y <= 96) && 96 <= main__x)) || (((main__y <= 69 && 69 <= main__x) && 69 <= main__y) && main__x <= 69)) || (((88 <= main__x && main__x <= 88) && main__y <= 88) && 88 <= main__y) - 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 <= 60) && 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__x <= 63 && main__y <= 63) && 63 <= main__x) && 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 <= 56) && 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 <= 59) && 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 <= 65 - 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 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.71 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 23.53 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 782.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.5 MB in the end (delta: 137.6 MB). Peak memory consumption was 137.6 MB. Max. memory is 11.5 GB. * CodeCheck took 134814.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 978.5 MB in the beginning and 1.2 GB in the end (delta: -180.9 MB). Peak memory consumption was 405.2 MB. Max. memory is 11.5 GB. * Witness Printer took 118.43 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...