./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ --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 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:17:03,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:17:03,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:17:03,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:17:03,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:17:03,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:17:03,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:17:03,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:17:03,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:17:03,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:17:03,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:17:03,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:17:03,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:17:03,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:17:03,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:17:03,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:17:03,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:17:03,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:17:03,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:17:03,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:17:03,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:17:03,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:17:03,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:17:03,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:17:03,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:17:03,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:17:03,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:17:03,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:17:03,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:17:03,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:17:03,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:17:03,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:17:03,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:17:03,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:17:03,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:17:03,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:17:03,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:17:03,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:17:03,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:17:03,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:17:03,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:17:03,466 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 01:17:03,514 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:17:03,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:17:03,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:17:03,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 01:17:03,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 01:17:03,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 01:17:03,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:17:03,518 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:17:03,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:17:03,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:17:03,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:17:03,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:17:03,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:17:03,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:17:03,522 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:17:03,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:17:03,522 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:17:03,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:17:03,523 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 01:17:03,523 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 01:17:03,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:17:03,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:17:03,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:17:03,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:17:03,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:17:03,525 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 01:17:03,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:17:03,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:17:03,526 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_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/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_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ 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 -> 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d [2021-11-23 01:17:03,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:17:03,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:17:03,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:17:03,929 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:17:03,930 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:17:03,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2021-11-23 01:17:04,029 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/data/a9dd907d3/967d95332cfc4c0ead09e502186e5296/FLAG432af280c [2021-11-23 01:17:04,647 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:17:04,651 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2021-11-23 01:17:04,669 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/data/a9dd907d3/967d95332cfc4c0ead09e502186e5296/FLAG432af280c [2021-11-23 01:17:04,933 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/data/a9dd907d3/967d95332cfc4c0ead09e502186e5296 [2021-11-23 01:17:04,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:17:04,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:17:04,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:17:04,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:17:04,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:17:04,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:04" (1/1) ... [2021-11-23 01:17:04,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c956de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:04, skipping insertion in model container [2021-11-23 01:17:04,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:04" (1/1) ... [2021-11-23 01:17:04,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:17:05,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:17:05,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2021-11-23 01:17:05,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:17:05,369 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:17:05,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2021-11-23 01:17:05,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:17:05,503 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:17:05,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05 WrapperNode [2021-11-23 01:17:05,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:17:05,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:17:05,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:17:05,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:17:05,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,570 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2021-11-23 01:17:05,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:17:05,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:17:05,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:17:05,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:17:05,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:17:05,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:17:05,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:17:05,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:17:05,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:05" (1/1) ... [2021-11-23 01:17:05,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 01:17:05,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 01:17:05,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 01:17:05,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 01:17:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:17:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:17:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:17:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:17:05,948 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:17:05,950 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:17:06,673 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:17:07,298 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:17:07,298 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 01:17:07,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:07 BoogieIcfgContainer [2021-11-23 01:17:07,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:17:07,302 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 01:17:07,302 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 01:17:07,312 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 01:17:07,313 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:07" (1/1) ... [2021-11-23 01:17:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:17:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2021-11-23 01:17:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2021-11-23 01:17:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 01:17:07,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:07,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2021-11-23 01:17:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2021-11-23 01:17:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 01:17:08,271 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:08,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2021-11-23 01:17:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2021-11-23 01:17:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 01:17:08,841 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:08,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2021-11-23 01:17:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2021-11-23 01:17:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 01:17:09,533 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:09,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2021-11-23 01:17:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2021-11-23 01:17:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 01:17:10,370 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:10,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2021-11-23 01:17:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2021-11-23 01:17:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 01:17:11,669 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:11,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2021-11-23 01:17:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2021-11-23 01:17:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 01:17:12,881 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:12,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2021-11-23 01:17:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2021-11-23 01:17:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:17:13,181 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:13,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2021-11-23 01:17:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2021-11-23 01:17:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 01:17:13,254 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:13,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2021-11-23 01:17:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2021-11-23 01:17:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 01:17:15,038 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:15,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2021-11-23 01:17:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2021-11-23 01:17:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 01:17:15,492 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:15,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 77 states and 144 transitions. [2021-11-23 01:17:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2021-11-23 01:17:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 01:17:20,788 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:20,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 94 states and 182 transitions. [2021-11-23 01:17:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 182 transitions. [2021-11-23 01:17:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 01:17:26,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:26,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 95 states and 183 transitions. [2021-11-23 01:17:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 183 transitions. [2021-11-23 01:17:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:17:26,936 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:26,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 113 states and 222 transitions. [2021-11-23 01:17:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 222 transitions. [2021-11-23 01:17:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:17:33,018 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:33,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 115 states and 228 transitions. [2021-11-23 01:17:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 228 transitions. [2021-11-23 01:17:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 01:17:33,725 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:33,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 116 states and 230 transitions. [2021-11-23 01:17:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 230 transitions. [2021-11-23 01:17:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:17:34,228 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:34,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 130 states and 260 transitions. [2021-11-23 01:17:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 260 transitions. [2021-11-23 01:17:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:17:39,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:39,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 131 states and 261 transitions. [2021-11-23 01:17:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 261 transitions. [2021-11-23 01:17:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:17:40,509 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:40,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 133 states and 267 transitions. [2021-11-23 01:17:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 267 transitions. [2021-11-23 01:17:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 01:17:41,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:41,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 134 states and 268 transitions. [2021-11-23 01:17:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 268 transitions. [2021-11-23 01:17:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:17:42,219 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:42,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 153 states and 303 transitions. [2021-11-23 01:17:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 303 transitions. [2021-11-23 01:17:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:17:50,873 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:50,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 157 states and 311 transitions. [2021-11-23 01:17:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 311 transitions. [2021-11-23 01:17:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:17:53,358 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:53,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 158 states and 312 transitions. [2021-11-23 01:17:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 312 transitions. [2021-11-23 01:17:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:17:54,474 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:54,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 159 states and 313 transitions. [2021-11-23 01:17:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 313 transitions. [2021-11-23 01:17:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 01:17:55,548 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:55,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:17:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:17:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 160 states and 314 transitions. [2021-11-23 01:17:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 314 transitions. [2021-11-23 01:17:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 01:17:56,448 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:17:56,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:17:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:17:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 178 states and 348 transitions. [2021-11-23 01:18:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 348 transitions. [2021-11-23 01:18:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 01:18:03,119 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:03,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 183 states and 360 transitions. [2021-11-23 01:18:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 360 transitions. [2021-11-23 01:18:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:18:05,422 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:05,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 186 states and 366 transitions. [2021-11-23 01:18:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 366 transitions. [2021-11-23 01:18:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:18:09,554 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:09,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 191 states and 379 transitions. [2021-11-23 01:18:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 379 transitions. [2021-11-23 01:18:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:18:12,435 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:12,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 205 states and 434 transitions. [2021-11-23 01:18:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 434 transitions. [2021-11-23 01:18:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 01:18:21,239 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:21,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 210 states and 442 transitions. [2021-11-23 01:18:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 442 transitions. [2021-11-23 01:18:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:18:24,032 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:24,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 224 states and 481 transitions. [2021-11-23 01:18:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 481 transitions. [2021-11-23 01:18:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 01:18:32,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:32,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 229 states and 488 transitions. [2021-11-23 01:18:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 488 transitions. [2021-11-23 01:18:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:18:35,522 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:35,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 239 states and 504 transitions. [2021-11-23 01:18:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 504 transitions. [2021-11-23 01:18:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 01:18:42,129 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:42,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 241 states and 509 transitions. [2021-11-23 01:18:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 509 transitions. [2021-11-23 01:18:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:18:44,531 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:44,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 251 states and 534 transitions. [2021-11-23 01:18:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 534 transitions. [2021-11-23 01:18:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:18:52,513 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:52,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 248 states and 539 transitions. [2021-11-23 01:18:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 539 transitions. [2021-11-23 01:18:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:18:54,606 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:54,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:18:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:18:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 249 states and 540 transitions. [2021-11-23 01:18:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 540 transitions. [2021-11-23 01:18:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:18:55,657 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:18:55,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:18:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:18:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 262 states and 569 transitions. [2021-11-23 01:19:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 569 transitions. [2021-11-23 01:19:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:19:03,798 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:03,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 269 states and 591 transitions. [2021-11-23 01:19:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 591 transitions. [2021-11-23 01:19:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-23 01:19:07,741 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:07,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 271 states and 604 transitions. [2021-11-23 01:19:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 604 transitions. [2021-11-23 01:19:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:19:09,540 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:09,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 278 states and 625 transitions. [2021-11-23 01:19:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 625 transitions. [2021-11-23 01:19:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:19:15,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:15,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 279 states and 630 transitions. [2021-11-23 01:19:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 630 transitions. [2021-11-23 01:19:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 01:19:17,104 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:17,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 283 states and 644 transitions. [2021-11-23 01:19:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 644 transitions. [2021-11-23 01:19:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:19:19,818 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:19,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 290 states and 667 transitions. [2021-11-23 01:19:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 667 transitions. [2021-11-23 01:19:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:19:25,971 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:25,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 294 states and 682 transitions. [2021-11-23 01:19:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 682 transitions. [2021-11-23 01:19:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 01:19:28,847 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:28,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:19:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:19:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 01:19:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 295 states and 686 transitions. [2021-11-23 01:19:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 686 transitions. [2021-11-23 01:19:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 01:19:30,184 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 01:19:30,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:19:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:19:30,864 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:19:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:19:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:19:32,488 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 01:19:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 01:19:33,022 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2021-11-23 01:19:33,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:19:33 ImpRootNode [2021-11-23 01:19:33,231 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-23 01:19:33,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:19:33,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:19:33,235 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:19:33,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:07" (3/4) ... [2021-11-23 01:19:33,237 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 01:19:33,435 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-23 01:19:33,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:19:33,436 INFO L158 Benchmark]: Toolchain (without parser) took 148498.20ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 60.4MB in the beginning and 844.6MB in the end (delta: -784.1MB). Peak memory consumption was 233.1MB. Max. memory is 16.1GB. [2021-11-23 01:19:33,436 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 100.7MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:19:33,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.22ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 60.3MB in the beginning and 100.1MB in the end (delta: -39.8MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2021-11-23 01:19:33,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.68ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 96.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 01:19:33,438 INFO L158 Benchmark]: Boogie Preprocessor took 81.88ms. Allocated memory is still 123.7MB. Free memory was 96.9MB in the beginning and 93.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:19:33,438 INFO L158 Benchmark]: RCFGBuilder took 1647.44ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 43.7MB in the end (delta: 50.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2021-11-23 01:19:33,438 INFO L158 Benchmark]: CodeCheck took 145929.12ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 994.1MB). Free memory was 42.8MB in the beginning and 866.6MB in the end (delta: -823.8MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. [2021-11-23 01:19:33,439 INFO L158 Benchmark]: Witness Printer took 203.24ms. Allocated memory is still 1.1GB. Free memory was 866.6MB in the beginning and 844.6MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 01:19:33,441 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 145.7s, OverallIterations: 48, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16417 SdHoareTripleChecker+Valid, 125.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14890 mSDsluCounter, 4873 SdHoareTripleChecker+Invalid, 110.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4112 mSDsCounter, 5444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46182 IncrementalHoareTripleChecker+Invalid, 51626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5444 mSolverCounterUnsat, 761 mSDtfsCounter, 46182 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13098 GetRequests, 11437 SyntacticMatches, 711 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521184 ImplicationChecksByTransitivity, 125.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1294 NumberOfCodeBlocks, 1294 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1199 ConstructedInterpolants, 0 QuantifiedInterpolants, 18768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 132/681 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: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND FALSE !(\read(r131)) [L274] COND TRUE \read(r121) [L275] COND TRUE \read(ep23) [L276] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND FALSE !(\read(r211)) [L287] COND TRUE \read(r231) [L288] COND TRUE \read(ep31) [L289] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND TRUE \read(r231) [L298] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [c1=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=1, id1=126, id2=124, id3=127, m1=0, m2=125, m3=0, max1=126, max2=124, max3=127, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=124, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND TRUE (int )m2 > (int )max2 [L139] max2 = m2 [L140] newmax = (_Bool)1 [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=2, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=3, id1=126, id2=124, id3=127, m1=127, m2=126, m3=124, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] st1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND TRUE (int )m2 > (int )max2 [L139] max2 = m2 [L140] newmax = (_Bool)1 [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND FALSE !((int )max2 == (int )id2) [L156] nl2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=-1, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=-1, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=-1, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L600] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=126, id2=124, id3=127, m1=-1, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 100.7MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.22ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 60.3MB in the beginning and 100.1MB in the end (delta: -39.8MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.68ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 96.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.88ms. Allocated memory is still 123.7MB. Free memory was 96.9MB in the beginning and 93.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1647.44ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 43.7MB in the end (delta: 50.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * CodeCheck took 145929.12ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 994.1MB). Free memory was 42.8MB in the beginning and 866.6MB in the end (delta: -823.8MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. * Witness Printer took 203.24ms. Allocated memory is still 1.1GB. Free memory was 866.6MB in the beginning and 844.6MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-23 01:19:33,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcd85e5b-c9ea-4d31-ac60-edbb193c27f2/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE