./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.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_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/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_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/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_e309ce00-35c4-40c6-962a-9a9334ede502/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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- 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-14 22:56:09,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 22:56:09,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 22:56:09,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 22:56:09,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 22:56:09,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 22:56:09,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 22:56:09,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 22:56:09,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 22:56:09,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 22:56:09,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 22:56:09,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 22:56:09,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 22:56:09,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 22:56:09,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 22:56:10,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 22:56:10,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 22:56:10,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 22:56:10,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 22:56:10,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 22:56:10,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 22:56:10,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 22:56:10,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 22:56:10,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 22:56:10,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 22:56:10,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 22:56:10,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 22:56:10,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 22:56:10,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 22:56:10,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 22:56:10,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 22:56:10,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 22:56:10,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 22:56:10,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 22:56:10,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 22:56:10,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 22:56:10,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 22:56:10,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 22:56:10,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 22:56:10,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 22:56:10,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 22:56:10,023 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 22:56:10,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 22:56:10,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 22:56:10,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 22:56:10,045 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 22:56:10,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 22:56:10,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 22:56:10,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 22:56:10,047 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 22:56:10,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 22:56:10,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 22:56:10,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 22:56:10,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 22:56:10,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 22:56:10,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 22:56:10,048 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 22:56:10,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 22:56:10,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 22:56:10,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 22:56:10,049 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 22:56:10,049 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 22:56:10,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 22:56:10,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 22:56:10,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 22:56:10,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 22:56:10,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 22:56:10,050 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 22:56:10,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 22:56:10,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 22:56:10,051 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_e309ce00-35c4-40c6-962a-9a9334ede502/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_e309ce00-35c4-40c6-962a-9a9334ede502/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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2022-12-14 22:56:10,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 22:56:10,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 22:56:10,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 22:56:10,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 22:56:10,260 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 22:56:10,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-12-14 22:56:12,795 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 22:56:12,989 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 22:56:12,990 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-12-14 22:56:12,998 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/data/c9dd3e2f5/63b1d7f5b1324da18066750f39bddf1c/FLAG826c34218 [2022-12-14 22:56:13,362 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/data/c9dd3e2f5/63b1d7f5b1324da18066750f39bddf1c [2022-12-14 22:56:13,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 22:56:13,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 22:56:13,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 22:56:13,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 22:56:13,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 22:56:13,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd3236b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13, skipping insertion in model container [2022-12-14 22:56:13,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 22:56:13,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 22:56:13,564 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_e309ce00-35c4-40c6-962a-9a9334ede502/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2022-12-14 22:56:13,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 22:56:13,576 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 22:56:13,620 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_e309ce00-35c4-40c6-962a-9a9334ede502/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2022-12-14 22:56:13,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 22:56:13,636 INFO L208 MainTranslator]: Completed translation [2022-12-14 22:56:13,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13 WrapperNode [2022-12-14 22:56:13,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 22:56:13,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 22:56:13,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 22:56:13,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 22:56:13,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,676 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 455 [2022-12-14 22:56:13,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 22:56:13,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 22:56:13,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 22:56:13,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 22:56:13,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,698 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 22:56:13,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 22:56:13,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 22:56:13,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 22:56:13,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:56:13" (1/1) ... [2022-12-14 22:56:13,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 22:56:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 22:56:13,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 22:56:13,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 22:56:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 22:56:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 22:56:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 22:56:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 22:56:13,851 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 22:56:13,853 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 22:56:14,324 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 22:56:14,759 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 22:56:14,760 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 22:56:14,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:56:14 BoogieIcfgContainer [2022-12-14 22:56:14,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 22:56:14,763 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 22:56:14,763 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 22:56:14,770 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 22:56:14,770 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:56:14" (1/1) ... [2022-12-14 22:56:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 22:56:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 22:56:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 22:56:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 22:56:14,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:14,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:16,074 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-14 22:56:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2022-12-14 22:56:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2022-12-14 22:56:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 22:56:16,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:17,004 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-14 22:56:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 23 states and 39 transitions. [2022-12-14 22:56:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2022-12-14 22:56:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 22:56:17,273 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:17,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:17,945 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-14 22:56:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 27 states and 48 transitions. [2022-12-14 22:56:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 48 transitions. [2022-12-14 22:56:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 22:56:18,332 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:19,253 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-14 22:56:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 59 transitions. [2022-12-14 22:56:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 59 transitions. [2022-12-14 22:56:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 22:56:19,794 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:19,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:20,558 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-14 22:56:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2022-12-14 22:56:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2022-12-14 22:56:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 22:56:21,287 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:21,873 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-14 22:56:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 45 states and 84 transitions. [2022-12-14 22:56:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 84 transitions. [2022-12-14 22:56:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 22:56:22,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:22,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:22,955 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-14 22:56:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 46 states and 84 transitions. [2022-12-14 22:56:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2022-12-14 22:56:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:56:23,155 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:23,191 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-14 22:56:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 47 states and 85 transitions. [2022-12-14 22:56:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 85 transitions. [2022-12-14 22:56:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 22:56:23,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:23,911 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-14 22:56:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 57 states and 102 transitions. [2022-12-14 22:56:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 102 transitions. [2022-12-14 22:56:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 22:56:25,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:25,701 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-14 22:56:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 60 states and 106 transitions. [2022-12-14 22:56:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 106 transitions. [2022-12-14 22:56:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 22:56:25,929 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:27,678 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-14 22:56:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 76 states and 135 transitions. [2022-12-14 22:56:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 135 transitions. [2022-12-14 22:56:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 22:56:31,572 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:32,593 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-14 22:56:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 88 states and 155 transitions. [2022-12-14 22:56:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 155 transitions. [2022-12-14 22:56:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:56:35,933 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:36,892 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-14 22:56:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 93 states and 166 transitions. [2022-12-14 22:56:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 166 transitions. [2022-12-14 22:56:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 22:56:39,941 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:40,974 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-14 22:56:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 109 states and 193 transitions. [2022-12-14 22:56:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 193 transitions. [2022-12-14 22:56:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 22:56:45,056 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:46,439 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-14 22:56:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 126 states and 220 transitions. [2022-12-14 22:56:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 220 transitions. [2022-12-14 22:56:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 22:56:50,771 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:52,181 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-14 22:56:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:56:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 127 states and 226 transitions. [2022-12-14 22:56:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 226 transitions. [2022-12-14 22:56:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 22:56:53,107 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:56:53,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:56:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:56:55,044 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-14 22:57:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 145 states and 256 transitions. [2022-12-14 22:57:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 256 transitions. [2022-12-14 22:57:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 22:57:00,358 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:00,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:01,700 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-14 22:57:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 147 states and 259 transitions. [2022-12-14 22:57:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-12-14 22:57:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 22:57:02,576 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:03,526 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-14 22:57:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 152 states and 269 transitions. [2022-12-14 22:57:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 269 transitions. [2022-12-14 22:57:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 22:57:05,741 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:06,791 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-14 22:57:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 155 states and 274 transitions. [2022-12-14 22:57:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 274 transitions. [2022-12-14 22:57:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 22:57:08,454 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:10,117 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-14 22:57:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 162 states and 291 transitions. [2022-12-14 22:57:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 291 transitions. [2022-12-14 22:57:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 22:57:14,818 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:16,435 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-14 22:57:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 163 states and 297 transitions. [2022-12-14 22:57:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 297 transitions. [2022-12-14 22:57:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 22:57:17,382 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:19,144 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-14 22:57:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 165 states and 299 transitions. [2022-12-14 22:57:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 299 transitions. [2022-12-14 22:57:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:57:20,505 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:20,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:57:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 178 states and 330 transitions. [2022-12-14 22:57:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 330 transitions. [2022-12-14 22:57:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:57:27,899 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:27,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:30,504 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-14 22:57:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 205 states and 396 transitions. [2022-12-14 22:57:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 396 transitions. [2022-12-14 22:57:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:57:41,498 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:43,640 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-14 22:57:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:57:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 219 states and 446 transitions. [2022-12-14 22:57:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 446 transitions. [2022-12-14 22:57:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:57:52,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:57:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:57:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:57:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:58:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 233 states and 496 transitions. [2022-12-14 22:58:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 496 transitions. [2022-12-14 22:58:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 22:58:06,582 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:09,004 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-14 22:58:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 260 states and 563 transitions. [2022-12-14 22:58:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 563 transitions. [2022-12-14 22:58:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 22:58:22,659 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:24,435 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-14 22:58:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 271 states and 602 transitions. [2022-12-14 22:58:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 602 transitions. [2022-12-14 22:58:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:58:31,925 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:58:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 280 states and 634 transitions. [2022-12-14 22:58:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 634 transitions. [2022-12-14 22:58:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 22:58:41,118 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:58:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 281 states and 639 transitions. [2022-12-14 22:58:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 639 transitions. [2022-12-14 22:58:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:58:43,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:45,363 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-14 22:58:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 290 states and 668 transitions. [2022-12-14 22:58:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 668 transitions. [2022-12-14 22:58:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:58:51,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:52,327 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-14 22:58:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 291 states and 680 transitions. [2022-12-14 22:58:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 680 transitions. [2022-12-14 22:58:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:58:53,284 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:54,434 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-14 22:58:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:58:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 292 states and 685 transitions. [2022-12-14 22:58:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 685 transitions. [2022-12-14 22:58:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 22:58:55,394 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:58:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:58:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:58:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:59:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 293 states and 689 transitions. [2022-12-14 22:59:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 689 transitions. [2022-12-14 22:59:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:59:03,073 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:04,960 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-14 22:59:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 297 states and 699 transitions. [2022-12-14 22:59:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 699 transitions. [2022-12-14 22:59:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:59:09,795 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:12,132 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-14 22:59:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 298 states and 712 transitions. [2022-12-14 22:59:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 712 transitions. [2022-12-14 22:59:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:59:14,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:17,904 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-14 22:59:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 299 states and 725 transitions. [2022-12-14 22:59:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 725 transitions. [2022-12-14 22:59:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:59:20,861 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:20,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:22,359 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-14 22:59:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 300 states and 729 transitions. [2022-12-14 22:59:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 729 transitions. [2022-12-14 22:59:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 22:59:23,473 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:25,145 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-14 22:59:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 301 states and 730 transitions. [2022-12-14 22:59:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 730 transitions. [2022-12-14 22:59:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:59:26,160 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:59:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 315 states and 787 transitions. [2022-12-14 22:59:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 787 transitions. [2022-12-14 22:59:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:59:38,733 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:38,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:59:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 317 states and 800 transitions. [2022-12-14 22:59:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 800 transitions. [2022-12-14 22:59:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:59:42,773 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:59:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 318 states and 820 transitions. [2022-12-14 22:59:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 820 transitions. [2022-12-14 22:59:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:59:45,607 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:59:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 319 states and 825 transitions. [2022-12-14 22:59:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 825 transitions. [2022-12-14 22:59:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 22:59:48,506 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 22:59:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 22:59:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 320 states and 826 transitions. [2022-12-14 22:59:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 826 transitions. [2022-12-14 22:59:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 22:59:51,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 22:59:51,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 22:59:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 22:59:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:00:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:00:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 323 states and 847 transitions. [2022-12-14 23:00:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 847 transitions. [2022-12-14 23:00:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:00:03,453 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:00:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:00:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:00:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:00:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:00:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 324 states and 848 transitions. [2022-12-14 23:00:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 848 transitions. [2022-12-14 23:00:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:00:06,734 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:00:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:00:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:00:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:00:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:00:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 326 states and 865 transitions. [2022-12-14 23:00:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 865 transitions. [2022-12-14 23:00:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:00:11,754 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:00:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:00:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:00:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:00:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:00:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 327 states and 875 transitions. [2022-12-14 23:00:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 875 transitions. [2022-12-14 23:00:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 23:00:21,167 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:00:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:00:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:00:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:00:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:00:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 328 states and 875 transitions. [2022-12-14 23:00:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 875 transitions. [2022-12-14 23:00:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 23:00:24,100 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:00:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:00:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:00:24,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:00:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:00:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:00:26,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:00:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:00:26,696 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 51 iterations. [2022-12-14 23:00:26,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 11:00:26 ImpRootNode [2022-12-14 23:00:26,788 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 23:00:26,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 23:00:26,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 23:00:26,788 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 23:00:26,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:56:14" (3/4) ... [2022-12-14 23:00:26,790 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 23:00:26,874 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 23:00:26,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 23:00:26,875 INFO L158 Benchmark]: Toolchain (without parser) took 253507.40ms. Allocated memory was 136.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 103.5MB in the beginning and 1.1GB in the end (delta: -990.9MB). Peak memory consumption was 530.1MB. Max. memory is 16.1GB. [2022-12-14 23:00:26,875 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 23:00:26,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.38ms. Allocated memory is still 136.3MB. Free memory was 103.5MB in the beginning and 86.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 23:00:26,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.53ms. Allocated memory is still 136.3MB. Free memory was 86.7MB in the beginning and 83.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 23:00:26,875 INFO L158 Benchmark]: Boogie Preprocessor took 26.46ms. Allocated memory is still 136.3MB. Free memory was 83.6MB in the beginning and 81.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 23:00:26,875 INFO L158 Benchmark]: RCFGBuilder took 1058.71ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 81.0MB in the beginning and 67.0MB in the end (delta: 14.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2022-12-14 23:00:26,876 INFO L158 Benchmark]: CodeCheck took 252024.90ms. Allocated memory was 178.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 67.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 436.5MB. Max. memory is 16.1GB. [2022-12-14 23:00:26,876 INFO L158 Benchmark]: Witness Printer took 86.17ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 23:00:26,877 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: 251.9s, OverallIterations: 51, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23189 SdHoareTripleChecker+Valid, 165.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21548 mSDsluCounter, 8524 SdHoareTripleChecker+Invalid, 148.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7712 mSDsCounter, 6071 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63623 IncrementalHoareTripleChecker+Invalid, 69694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6071 mSolverCounterUnsat, 812 mSDtfsCounter, 63623 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15224 GetRequests, 13347 SyntacticMatches, 685 SemanticMatches, 1192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879811 ImplicationChecksByTransitivity, 179.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 75.2s InterpolantComputationTime, 1504 NumberOfCodeBlocks, 1504 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1406 ConstructedInterpolants, 0 QuantifiedInterpolants, 18810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 10 PerfectInterpolantSequences, 170/915 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: 609]: 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 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] 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 TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND TRUE \read(ep23) [L286] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND TRUE \read(ep31) [L299] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] 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 \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [c1=0, ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, i2=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=255, 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] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 1 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] 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 TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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 )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=126, m2=127, m3=123, max1=124, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=125, 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] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] 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 TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND TRUE (int )m1 > (int )max1 [L100] max1 = m1 [L101] newmax = (_Bool)1 [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] 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 TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] 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 TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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 )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND FALSE !((int )r1 < 1) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] 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 TRUE \read(ep23) [L175] COND FALSE !(\read(newmax2)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND FALSE !(\read(newmax3)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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 )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=127, m2=124, m3=125, max1=127, max2=125, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] 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 TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] nl1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] 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 TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] 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 TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L609] reach_error() VAL [\old(arg)=0, arg=0, ep12=1, ep13=0, ep21=0, ep23=255, ep31=255, ep32=0, id1=124, id2=125, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=125, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.38ms. Allocated memory is still 136.3MB. Free memory was 103.5MB in the beginning and 86.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.53ms. Allocated memory is still 136.3MB. Free memory was 86.7MB in the beginning and 83.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.46ms. Allocated memory is still 136.3MB. Free memory was 83.6MB in the beginning and 81.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1058.71ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 81.0MB in the beginning and 67.0MB in the end (delta: 14.0MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * CodeCheck took 252024.90ms. Allocated memory was 178.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 67.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 436.5MB. Max. memory is 16.1GB. * Witness Printer took 86.17ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 23:00:26,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e309ce00-35c4-40c6-962a-9a9334ede502/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