./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4 --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 a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-15 00:47:25,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 00:47:25,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 00:47:25,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 00:47:25,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 00:47:25,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 00:47:25,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 00:47:25,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 00:47:25,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 00:47:25,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 00:47:25,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 00:47:25,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 00:47:25,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 00:47:25,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 00:47:25,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 00:47:25,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 00:47:25,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 00:47:25,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 00:47:25,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 00:47:25,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 00:47:25,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 00:47:25,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 00:47:25,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 00:47:25,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 00:47:25,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 00:47:25,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 00:47:25,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 00:47:25,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 00:47:25,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 00:47:25,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 00:47:25,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 00:47:25,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 00:47:25,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 00:47:25,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 00:47:25,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 00:47:25,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 00:47:25,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 00:47:25,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 00:47:25,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 00:47:25,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 00:47:25,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 00:47:25,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 00:47:25,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 00:47:25,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 00:47:25,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 00:47:25,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 00:47:25,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 00:47:25,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 00:47:25,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 00:47:25,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 00:47:25,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 00:47:25,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 00:47:25,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 00:47:25,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 00:47:25,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 00:47:25,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 00:47:25,670 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 00:47:25,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 00:47:25,670 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 00:47:25,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 00:47:25,670 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 00:47:25,670 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 00:47:25,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 00:47:25,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:47:25,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 00:47:25,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 00:47:25,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 00:47:25,671 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 00:47:25,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 00:47:25,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 00:47:25,671 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_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/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_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4 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 -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2022-12-15 00:47:25,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 00:47:25,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 00:47:25,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 00:47:25,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 00:47:25,854 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 00:47:25,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-12-15 00:47:28,384 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 00:47:28,575 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 00:47:28,576 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2022-12-15 00:47:28,584 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/data/ef1cfc274/716f51a363d748748ecb18883573bd9c/FLAG08a2db148 [2022-12-15 00:47:28,597 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/data/ef1cfc274/716f51a363d748748ecb18883573bd9c [2022-12-15 00:47:28,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 00:47:28,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 00:47:28,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 00:47:28,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 00:47:28,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 00:47:28,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1aa600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28, skipping insertion in model container [2022-12-15 00:47:28,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 00:47:28,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 00:47:28,840 WARN L237 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_5a6d4b75-e138-475a-85b0-9935cf0ed618/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2022-12-15 00:47:28,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:47:28,856 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 00:47:28,908 WARN L237 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_5a6d4b75-e138-475a-85b0-9935cf0ed618/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2022-12-15 00:47:28,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:47:28,919 INFO L208 MainTranslator]: Completed translation [2022-12-15 00:47:28,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28 WrapperNode [2022-12-15 00:47:28,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 00:47:28,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 00:47:28,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 00:47:28,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 00:47:28,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,964 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 443 [2022-12-15 00:47:28,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 00:47:28,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 00:47:28,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 00:47:28,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 00:47:28,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,994 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:28,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:29,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 00:47:29,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 00:47:29,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 00:47:29,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 00:47:29,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:47:28" (1/1) ... [2022-12-15 00:47:29,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:47:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 00:47:29,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 00:47:29,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 00:47:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 00:47:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 00:47:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 00:47:29,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 00:47:29,147 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 00:47:29,148 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 00:47:29,561 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 00:47:29,994 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 00:47:29,994 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 00:47:29,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:47:29 BoogieIcfgContainer [2022-12-15 00:47:29,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 00:47:29,998 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 00:47:29,998 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 00:47:30,007 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 00:47:30,007 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:47:29" (1/1) ... [2022-12-15 00:47:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 00:47:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-15 00:47:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-15 00:47:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-15 00:47:30,071 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2022-12-15 00:47:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2022-12-15 00:47:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-15 00:47:31,309 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2022-12-15 00:47:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2022-12-15 00:47:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-15 00:47:32,097 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2022-12-15 00:47:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2022-12-15 00:47:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-15 00:47:32,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 32 states and 55 transitions. [2022-12-15 00:47:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 55 transitions. [2022-12-15 00:47:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-15 00:47:33,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2022-12-15 00:47:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2022-12-15 00:47:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-15 00:47:35,031 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2022-12-15 00:47:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2022-12-15 00:47:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-15 00:47:36,313 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 46 states and 80 transitions. [2022-12-15 00:47:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2022-12-15 00:47:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 00:47:36,540 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 53 states and 91 transitions. [2022-12-15 00:47:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2022-12-15 00:47:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 00:47:37,654 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 54 states and 92 transitions. [2022-12-15 00:47:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2022-12-15 00:47:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-15 00:47:37,753 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2022-12-15 00:47:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2022-12-15 00:47:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-15 00:47:38,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 73 states and 125 transitions. [2022-12-15 00:47:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2022-12-15 00:47:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-15 00:47:41,830 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 80 states and 142 transitions. [2022-12-15 00:47:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 142 transitions. [2022-12-15 00:47:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:47:43,832 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 88 states and 162 transitions. [2022-12-15 00:47:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 162 transitions. [2022-12-15 00:47:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:47:45,940 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 90 states and 167 transitions. [2022-12-15 00:47:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 167 transitions. [2022-12-15 00:47:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:47:47,212 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:47,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 96 states and 185 transitions. [2022-12-15 00:47:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 185 transitions. [2022-12-15 00:47:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:47:49,777 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 99 states and 196 transitions. [2022-12-15 00:47:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 196 transitions. [2022-12-15 00:47:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:47:51,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 101 states and 203 transitions. [2022-12-15 00:47:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 203 transitions. [2022-12-15 00:47:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-15 00:47:52,865 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:52,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:47:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:47:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 121 states and 237 transitions. [2022-12-15 00:47:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 237 transitions. [2022-12-15 00:47:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-15 00:47:58,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:47:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:47:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:47:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 126 states and 249 transitions. [2022-12-15 00:48:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 249 transitions. [2022-12-15 00:48:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-15 00:48:00,276 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:00,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 131 states and 254 transitions. [2022-12-15 00:48:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 254 transitions. [2022-12-15 00:48:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-15 00:48:04,365 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 146 states and 301 transitions. [2022-12-15 00:48:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 301 transitions. [2022-12-15 00:48:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:48:11,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 156 states and 322 transitions. [2022-12-15 00:48:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 322 transitions. [2022-12-15 00:48:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:48:19,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 162 states and 330 transitions. [2022-12-15 00:48:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 330 transitions. [2022-12-15 00:48:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 00:48:24,084 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 165 states and 339 transitions. [2022-12-15 00:48:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 339 transitions. [2022-12-15 00:48:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 00:48:27,090 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 182 states and 375 transitions. [2022-12-15 00:48:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 375 transitions. [2022-12-15 00:48:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 00:48:33,751 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 189 states and 390 transitions. [2022-12-15 00:48:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 390 transitions. [2022-12-15 00:48:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 00:48:41,433 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:41,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:48:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:48:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:48:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 198 states and 402 transitions. [2022-12-15 00:48:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 402 transitions. [2022-12-15 00:48:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-15 00:48:44,880 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:48:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:48:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:48:45,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:48:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:48:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:48:46,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:48:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:48:46,648 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 28 iterations. [2022-12-15 00:48:46,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 12:48:46 ImpRootNode [2022-12-15 00:48:46,742 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 00:48:46,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 00:48:46,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 00:48:46,743 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 00:48:46,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:47:29" (3/4) ... [2022-12-15 00:48:46,745 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 00:48:46,819 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 00:48:46,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 00:48:46,842 INFO L158 Benchmark]: Toolchain (without parser) took 78241.46ms. Allocated memory was 119.5MB in the beginning and 545.3MB in the end (delta: 425.7MB). Free memory was 89.5MB in the beginning and 462.4MB in the end (delta: -372.9MB). Peak memory consumption was 364.6MB. Max. memory is 16.1GB. [2022-12-15 00:48:46,842 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory was 94.7MB in the beginning and 94.7MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 00:48:46,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.54ms. Allocated memory is still 119.5MB. Free memory was 89.5MB in the beginning and 72.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-15 00:48:46,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.82ms. Allocated memory is still 119.5MB. Free memory was 72.7MB in the beginning and 69.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 00:48:46,843 INFO L158 Benchmark]: Boogie Preprocessor took 35.09ms. Allocated memory is still 119.5MB. Free memory was 69.7MB in the beginning and 67.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 00:48:46,843 INFO L158 Benchmark]: RCFGBuilder took 996.41ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 67.2MB in the beginning and 111.2MB in the end (delta: -44.0MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2022-12-15 00:48:46,843 INFO L158 Benchmark]: CodeCheck took 76744.91ms. Allocated memory was 148.9MB in the beginning and 545.3MB in the end (delta: 396.4MB). Free memory was 111.2MB in the beginning and 170.0MB in the end (delta: -58.7MB). Peak memory consumption was 337.6MB. Max. memory is 16.1GB. [2022-12-15 00:48:46,843 INFO L158 Benchmark]: Witness Printer took 98.34ms. Allocated memory is still 545.3MB. Free memory was 170.0MB in the beginning and 462.4MB in the end (delta: -292.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-12-15 00:48:46,845 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: 76.6s, OverallIterations: 28, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5188 SdHoareTripleChecker+Valid, 31.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4272 mSDsluCounter, 1750 SdHoareTripleChecker+Invalid, 28.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1269 mSDsCounter, 1859 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13718 IncrementalHoareTripleChecker+Invalid, 15577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1859 mSolverCounterUnsat, 481 mSDtfsCounter, 13718 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5739 GetRequests, 4897 SyntacticMatches, 262 SemanticMatches, 580 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194173 ImplicationChecksByTransitivity, 50.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 571 ConstructedInterpolants, 0 QuantifiedInterpolants, 7591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 54/260 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: 585]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L539] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND FALSE !(\read(r131)) [L278] tmp = 0 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND FALSE !(\read(r121)) [L291] tmp___0 = 0 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND FALSE !(\read(r231)) [L304] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND FALSE !(\read(r211)) [L317] tmp___2 = 0 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND FALSE !(\read(ep21)) [L327] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] RET, EXPR init() [L539] i2 = init() [L540] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L540] RET assume_abort_if_not(i2) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [c1=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, i2=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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] [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=2, max1=2, max2=0, max3=1, 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=-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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, 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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, 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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND FALSE !((int )max2 == (int )id2) [L163] nl2 = (char)1 [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L585] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=255, id1=2, id2=0, id3=1, m1=3, m2=-1, m3=2, max1=2, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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.14ms. Allocated memory is still 119.5MB. Free memory was 94.7MB in the beginning and 94.7MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.54ms. Allocated memory is still 119.5MB. Free memory was 89.5MB in the beginning and 72.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.82ms. Allocated memory is still 119.5MB. Free memory was 72.7MB in the beginning and 69.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.09ms. Allocated memory is still 119.5MB. Free memory was 69.7MB in the beginning and 67.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 996.41ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 67.2MB in the beginning and 111.2MB in the end (delta: -44.0MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * CodeCheck took 76744.91ms. Allocated memory was 148.9MB in the beginning and 545.3MB in the end (delta: 396.4MB). Free memory was 111.2MB in the beginning and 170.0MB in the end (delta: -58.7MB). Peak memory consumption was 337.6MB. Max. memory is 16.1GB. * Witness Printer took 98.34ms. Allocated memory is still 545.3MB. Free memory was 170.0MB in the beginning and 462.4MB in the end (delta: -292.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 00:48:46,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a6d4b75-e138-475a-85b0-9935cf0ed618/bin/ukojak-rkRKPMF4O4/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