./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c -s /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9a2bb925f9caeb1a81a9f8632446ab7e4aa4c35 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 04:40:26,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 04:40:26,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 04:40:26,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 04:40:26,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 04:40:26,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 04:40:26,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 04:40:26,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 04:40:26,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 04:40:26,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 04:40:26,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 04:40:26,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 04:40:26,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 04:40:26,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 04:40:26,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 04:40:26,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 04:40:26,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 04:40:26,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 04:40:26,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 04:40:26,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 04:40:26,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 04:40:26,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 04:40:26,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 04:40:26,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 04:40:26,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 04:40:26,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 04:40:26,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 04:40:26,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 04:40:26,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 04:40:26,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 04:40:26,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 04:40:26,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 04:40:26,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 04:40:26,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 04:40:26,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 04:40:26,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 04:40:26,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 04:40:26,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 04:40:26,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 04:40:26,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 04:40:26,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 04:40:26,195 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-28 04:40:26,241 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 04:40:26,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 04:40:26,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 04:40:26,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-28 04:40:26,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 04:40:26,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 04:40:26,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 04:40:26,248 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 04:40:26,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 04:40:26,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 04:40:26,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 04:40:26,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 04:40:26,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 04:40:26,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 04:40:26,251 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 04:40:26,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 04:40:26,251 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 04:40:26,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 04:40:26,252 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-28 04:40:26,252 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-28 04:40:26,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 04:40:26,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 04:40:26,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-28 04:40:26,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 04:40:26,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 04:40:26,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 04:40:26,254 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-28 04:40:26,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 04:40:26,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 04:40:26,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_77c809ee-507f-49f4-b79b-758c3fbe5e4a/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(reach_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 -> f9a2bb925f9caeb1a81a9f8632446ab7e4aa4c35 [2020-11-28 04:40:26,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 04:40:26,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 04:40:26,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 04:40:26,572 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 04:40:26,573 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 04:40:26,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2020-11-28 04:40:26,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/data/a442a7bcc/a9bfc3cf6d1d4bc0a7e7917087491930/FLAG3d489e91f [2020-11-28 04:40:27,136 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 04:40:27,137 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2020-11-28 04:40:27,173 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/data/a442a7bcc/a9bfc3cf6d1d4bc0a7e7917087491930/FLAG3d489e91f [2020-11-28 04:40:27,440 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/data/a442a7bcc/a9bfc3cf6d1d4bc0a7e7917087491930 [2020-11-28 04:40:27,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 04:40:27,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 04:40:27,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 04:40:27,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 04:40:27,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 04:40:27,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:40:27" (1/1) ... [2020-11-28 04:40:27,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fba4c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:27, skipping insertion in model container [2020-11-28 04:40:27,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:40:27" (1/1) ... [2020-11-28 04:40:27,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 04:40:27,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 04:40:28,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 04:40:28,101 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 04:40:28,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 04:40:28,278 INFO L208 MainTranslator]: Completed translation [2020-11-28 04:40:28,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28 WrapperNode [2020-11-28 04:40:28,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 04:40:28,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 04:40:28,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 04:40:28,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 04:40:28,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 04:40:28,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 04:40:28,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 04:40:28,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 04:40:28,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... [2020-11-28 04:40:28,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 04:40:28,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 04:40:28,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 04:40:28,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 04:40:28,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:40:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/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 [2020-11-28 04:40:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 04:40:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 04:40:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 04:40:28,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 04:40:30,753 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 04:40:30,753 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-28 04:40:30,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:40:30 BoogieIcfgContainer [2020-11-28 04:40:30,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 04:40:30,757 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-28 04:40:30,757 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-28 04:40:30,768 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-28 04:40:30,768 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:40:30" (1/1) ... [2020-11-28 04:40:30,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 04:40:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2020-11-28 04:40:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2020-11-28 04:40:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-28 04:40:30,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 163 states and 300 transitions. [2020-11-28 04:40:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 300 transitions. [2020-11-28 04:40:31,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-28 04:40:31,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 166 states and 305 transitions. [2020-11-28 04:40:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 305 transitions. [2020-11-28 04:40:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-28 04:40:32,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 245 states and 388 transitions. [2020-11-28 04:40:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 388 transitions. [2020-11-28 04:40:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-28 04:40:33,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 251 states and 397 transitions. [2020-11-28 04:40:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 397 transitions. [2020-11-28 04:40:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-28 04:40:33,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 256 states and 409 transitions. [2020-11-28 04:40:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 409 transitions. [2020-11-28 04:40:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-28 04:40:34,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 259 states and 413 transitions. [2020-11-28 04:40:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 413 transitions. [2020-11-28 04:40:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-28 04:40:34,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 262 states and 416 transitions. [2020-11-28 04:40:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 416 transitions. [2020-11-28 04:40:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-28 04:40:34,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 266 states and 422 transitions. [2020-11-28 04:40:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 422 transitions. [2020-11-28 04:40:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-28 04:40:35,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 272 states and 430 transitions. [2020-11-28 04:40:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 430 transitions. [2020-11-28 04:40:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-28 04:40:35,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 276 states and 438 transitions. [2020-11-28 04:40:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 438 transitions. [2020-11-28 04:40:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-28 04:40:36,223 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 279 states and 443 transitions. [2020-11-28 04:40:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 443 transitions. [2020-11-28 04:40:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-28 04:40:36,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 282 states and 446 transitions. [2020-11-28 04:40:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 446 transitions. [2020-11-28 04:40:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-28 04:40:36,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 285 states and 449 transitions. [2020-11-28 04:40:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 449 transitions. [2020-11-28 04:40:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-28 04:40:36,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 04:40:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 289 states and 455 transitions. [2020-11-28 04:40:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 455 transitions. [2020-11-28 04:40:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-28 04:40:37,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 04:40:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 292 states and 458 transitions. [2020-11-28 04:40:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 458 transitions. [2020-11-28 04:40:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-28 04:40:37,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 295 states and 461 transitions. [2020-11-28 04:40:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 461 transitions. [2020-11-28 04:40:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-28 04:40:37,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 305 states and 473 transitions. [2020-11-28 04:40:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 473 transitions. [2020-11-28 04:40:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-28 04:40:38,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 318 states and 491 transitions. [2020-11-28 04:40:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 491 transitions. [2020-11-28 04:40:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-28 04:40:38,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 320 states and 494 transitions. [2020-11-28 04:40:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 494 transitions. [2020-11-28 04:40:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-28 04:40:39,011 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 325 states and 500 transitions. [2020-11-28 04:40:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 500 transitions. [2020-11-28 04:40:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-28 04:40:39,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 327 states and 502 transitions. [2020-11-28 04:40:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 502 transitions. [2020-11-28 04:40:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-28 04:40:39,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 337 states and 517 transitions. [2020-11-28 04:40:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 517 transitions. [2020-11-28 04:40:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-28 04:40:39,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 347 states and 531 transitions. [2020-11-28 04:40:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 531 transitions. [2020-11-28 04:40:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-28 04:40:40,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 369 states and 567 transitions. [2020-11-28 04:40:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 567 transitions. [2020-11-28 04:40:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-28 04:40:42,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 386 states and 588 transitions. [2020-11-28 04:40:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 588 transitions. [2020-11-28 04:40:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-28 04:40:44,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 387 states and 588 transitions. [2020-11-28 04:40:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 588 transitions. [2020-11-28 04:40:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-28 04:40:44,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 04:40:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 389 states and 591 transitions. [2020-11-28 04:40:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 591 transitions. [2020-11-28 04:40:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-28 04:40:45,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 04:40:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 390 states and 592 transitions. [2020-11-28 04:40:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 592 transitions. [2020-11-28 04:40:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-28 04:40:45,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 04:40:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 391 states and 595 transitions. [2020-11-28 04:40:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 595 transitions. [2020-11-28 04:40:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-28 04:40:45,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 401 states and 608 transitions. [2020-11-28 04:40:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 608 transitions. [2020-11-28 04:40:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-28 04:40:45,722 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 406 states and 614 transitions. [2020-11-28 04:40:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 614 transitions. [2020-11-28 04:40:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-28 04:40:45,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 409 states and 616 transitions. [2020-11-28 04:40:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 616 transitions. [2020-11-28 04:40:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-28 04:40:45,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 413 states and 621 transitions. [2020-11-28 04:40:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2020-11-28 04:40:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-28 04:40:46,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 415 states and 623 transitions. [2020-11-28 04:40:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 623 transitions. [2020-11-28 04:40:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-28 04:40:46,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 494 states and 714 transitions. [2020-11-28 04:40:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 714 transitions. [2020-11-28 04:40:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-28 04:40:47,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 504 states and 727 transitions. [2020-11-28 04:40:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 727 transitions. [2020-11-28 04:40:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-28 04:40:47,646 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 514 states and 740 transitions. [2020-11-28 04:40:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 740 transitions. [2020-11-28 04:40:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-28 04:40:48,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 515 states and 741 transitions. [2020-11-28 04:40:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 741 transitions. [2020-11-28 04:40:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-28 04:40:48,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-28 04:40:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 516 states and 742 transitions. [2020-11-28 04:40:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 742 transitions. [2020-11-28 04:40:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-28 04:40:48,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-28 04:40:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 517 states and 743 transitions. [2020-11-28 04:40:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 743 transitions. [2020-11-28 04:40:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-28 04:40:48,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 539 states and 770 transitions. [2020-11-28 04:40:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 770 transitions. [2020-11-28 04:40:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-28 04:40:50,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 556 states and 791 transitions. [2020-11-28 04:40:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 791 transitions. [2020-11-28 04:40:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-28 04:40:51,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 558 states and 792 transitions. [2020-11-28 04:40:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 792 transitions. [2020-11-28 04:40:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-28 04:40:51,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 562 states and 796 transitions. [2020-11-28 04:40:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 796 transitions. [2020-11-28 04:40:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-28 04:40:51,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 04:40:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 564 states and 798 transitions. [2020-11-28 04:40:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 798 transitions. [2020-11-28 04:40:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-28 04:40:51,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 04:40:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 566 states and 800 transitions. [2020-11-28 04:40:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 800 transitions. [2020-11-28 04:40:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-28 04:40:52,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 04:40:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 573 states and 809 transitions. [2020-11-28 04:40:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 809 transitions. [2020-11-28 04:40:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-28 04:40:52,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 574 states and 810 transitions. [2020-11-28 04:40:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 810 transitions. [2020-11-28 04:40:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-28 04:40:52,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 04:40:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 575 states and 811 transitions. [2020-11-28 04:40:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 811 transitions. [2020-11-28 04:40:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-28 04:40:52,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 04:40:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 04:40:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-28 04:40:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 581 states and 819 transitions. [2020-11-28 04:40:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 819 transitions. [2020-11-28 04:40:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-28 04:40:53,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-28 04:40:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:40:53,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:40:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:40:53,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:40:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:40:53,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:40:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 04:40:53,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 04:40:53,393 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 51 iterations. [2020-11-28 04:40:53,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 28.11 04:40:53 ImpRootNode [2020-11-28 04:40:53,712 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-28 04:40:53,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 04:40:53,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 04:40:53,713 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 04:40:53,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:40:30" (3/4) ... [2020-11-28 04:40:53,715 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 04:40:53,999 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_77c809ee-507f-49f4-b79b-758c3fbe5e4a/bin/ukojak/witness.graphml [2020-11-28 04:40:53,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 04:40:54,001 INFO L168 Benchmark]: Toolchain (without parser) took 26556.96 ms. Allocated memory was 83.9 MB in the beginning and 421.5 MB in the end (delta: 337.6 MB). Free memory was 51.4 MB in the beginning and 311.9 MB in the end (delta: -260.6 MB). Peak memory consumption was 77.1 MB. Max. memory is 16.1 GB. [2020-11-28 04:40:54,002 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 83.9 MB. Free memory was 45.3 MB in the beginning and 45.3 MB in the end (delta: 34.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 04:40:54,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.33 ms. Allocated memory is still 83.9 MB. Free memory was 51.1 MB in the beginning and 45.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 04:40:54,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 83.9 MB. Free memory was 45.9 MB in the beginning and 40.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-28 04:40:54,004 INFO L168 Benchmark]: Boogie Preprocessor took 61.85 ms. Allocated memory is still 83.9 MB. Free memory was 40.3 MB in the beginning and 36.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 04:40:54,004 INFO L168 Benchmark]: RCFGBuilder took 2336.08 ms. Allocated memory was 83.9 MB in the beginning and 130.0 MB in the end (delta: 46.1 MB). Free memory was 36.1 MB in the beginning and 58.8 MB in the end (delta: -22.7 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2020-11-28 04:40:54,005 INFO L168 Benchmark]: CodeCheck took 22955.06 ms. Allocated memory was 130.0 MB in the beginning and 421.5 MB in the end (delta: 291.5 MB). Free memory was 58.8 MB in the beginning and 329.8 MB in the end (delta: -271.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. [2020-11-28 04:40:54,005 INFO L168 Benchmark]: Witness Printer took 286.92 ms. Allocated memory is still 421.5 MB. Free memory was 329.8 MB in the beginning and 311.9 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 04:40:54,008 INFO L339 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, 85 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.6s, OverallIterations: 51, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 671222788 SDtfs, 586016524 SDslu, -401847272 SDs, 0 SdLazy, -1738189318 SolverSat, 267035186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 125.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38132 GetRequests, 37745 SyntacticMatches, 123 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36281 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 5171 NumberOfCodeBlocks, 5171 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5007 ConstructedInterpolants, 0 QuantifiedInterpolants, 874559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 43 PerfectInterpolantSequences, 1221/1267 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 - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L176] a25 = 1 [L177] a28 = 9 [L178] return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L41] a28 = 9 [L42] a11 = 1 [L43] a25 = 1 [L44] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem02_label43.c", 4, "reach_error") VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 83.9 MB. Free memory was 45.3 MB in the beginning and 45.3 MB in the end (delta: 34.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 835.33 ms. Allocated memory is still 83.9 MB. Free memory was 51.1 MB in the beginning and 45.9 MB in the end (delta: 5.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 83.9 MB. Free memory was 45.9 MB in the beginning and 40.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.85 ms. Allocated memory is still 83.9 MB. Free memory was 40.3 MB in the beginning and 36.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2336.08 ms. Allocated memory was 83.9 MB in the beginning and 130.0 MB in the end (delta: 46.1 MB). Free memory was 36.1 MB in the beginning and 58.8 MB in the end (delta: -22.7 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. * CodeCheck took 22955.06 ms. Allocated memory was 130.0 MB in the beginning and 421.5 MB in the end (delta: 291.5 MB). Free memory was 58.8 MB in the beginning and 329.8 MB in the end (delta: -271.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. * Witness Printer took 286.92 ms. Allocated memory is still 421.5 MB. Free memory was 329.8 MB in the beginning and 311.9 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...