./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/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_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/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_5d7e0afe-980b-41d6-b472-d43c794a93d8/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 b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a --- 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 16:26:20,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 16:26:20,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 16:26:20,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 16:26:20,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 16:26:20,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 16:26:20,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 16:26:20,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 16:26:20,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 16:26:20,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 16:26:20,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 16:26:20,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 16:26:20,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 16:26:20,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 16:26:20,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 16:26:20,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 16:26:20,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 16:26:20,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 16:26:20,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 16:26:20,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 16:26:20,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 16:26:20,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 16:26:20,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 16:26:20,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 16:26:20,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 16:26:20,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 16:26:20,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 16:26:20,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 16:26:20,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 16:26:20,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 16:26:20,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 16:26:20,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 16:26:20,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 16:26:20,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 16:26:20,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 16:26:20,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 16:26:20,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 16:26:20,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 16:26:20,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 16:26:20,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 16:26:20,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 16:26:20,824 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 16:26:20,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 16:26:20,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 16:26:20,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 16:26:20,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 16:26:20,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 16:26:20,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 16:26:20,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 16:26:20,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 16:26:20,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 16:26:20,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 16:26:20,847 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 16:26:20,847 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 16:26:20,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 16:26:20,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 16:26:20,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 16:26:20,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 16:26:20,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 16:26:20,847 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 16:26:20,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 16:26:20,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 16:26:20,848 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_5d7e0afe-980b-41d6-b472-d43c794a93d8/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_5d7e0afe-980b-41d6-b472-d43c794a93d8/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 -> b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a [2022-12-14 16:26:21,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 16:26:21,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 16:26:21,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 16:26:21,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 16:26:21,026 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 16:26:21,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2022-12-14 16:26:23,650 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 16:26:23,810 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 16:26:23,811 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2022-12-14 16:26:23,820 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/data/39edb14be/879af49b719b473498aab4f8207b73c2/FLAG894cc6e1c [2022-12-14 16:26:23,831 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/data/39edb14be/879af49b719b473498aab4f8207b73c2 [2022-12-14 16:26:23,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 16:26:23,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 16:26:23,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 16:26:23,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 16:26:23,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 16:26:23,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:26:23" (1/1) ... [2022-12-14 16:26:23,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237c88a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:23, skipping insertion in model container [2022-12-14 16:26:23,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:26:23" (1/1) ... [2022-12-14 16:26:23,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 16:26:23,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 16:26:24,054 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_5d7e0afe-980b-41d6-b472-d43c794a93d8/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2022-12-14 16:26:24,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 16:26:24,070 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 16:26:24,119 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_5d7e0afe-980b-41d6-b472-d43c794a93d8/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2022-12-14 16:26:24,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 16:26:24,130 INFO L208 MainTranslator]: Completed translation [2022-12-14 16:26:24,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24 WrapperNode [2022-12-14 16:26:24,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 16:26:24,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 16:26:24,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 16:26:24,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 16:26:24,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,166 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 419 [2022-12-14 16:26:24,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 16:26:24,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 16:26:24,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 16:26:24,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 16:26:24,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 16:26:24,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 16:26:24,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 16:26:24,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 16:26:24,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:26:24" (1/1) ... [2022-12-14 16:26:24,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 16:26:24,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 16:26:24,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 16:26:24,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 16:26:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 16:26:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 16:26:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 16:26:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 16:26:24,333 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 16:26:24,335 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 16:26:24,717 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 16:26:25,104 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 16:26:25,104 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 16:26:25,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:26:25 BoogieIcfgContainer [2022-12-14 16:26:25,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 16:26:25,106 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 16:26:25,107 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 16:26:25,113 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 16:26:25,114 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:26:25" (1/1) ... [2022-12-14 16:26:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:26:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-14 16:26:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-14 16:26:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 16:26:25,159 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:26,305 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 16:26:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2022-12-14 16:26:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2022-12-14 16:26:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 16:26:26,400 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:27,009 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 16:26:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 23 states and 39 transitions. [2022-12-14 16:26:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2022-12-14 16:26:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 16:26:27,246 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:27,831 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 16:26:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 27 states and 48 transitions. [2022-12-14 16:26:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 48 transitions. [2022-12-14 16:26:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 16:26:28,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:28,765 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 16:26:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 59 transitions. [2022-12-14 16:26:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 59 transitions. [2022-12-14 16:26:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 16:26:29,222 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:29,864 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 16:26:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2022-12-14 16:26:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2022-12-14 16:26:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 16:26:30,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:31,192 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 16:26:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 45 states and 84 transitions. [2022-12-14 16:26:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 84 transitions. [2022-12-14 16:26:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 16:26:32,084 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:32,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:32,156 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 16:26:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 46 states and 84 transitions. [2022-12-14 16:26:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2022-12-14 16:26:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 16:26:32,351 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:32,386 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 16:26:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 47 states and 85 transitions. [2022-12-14 16:26:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 85 transitions. [2022-12-14 16:26:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 16:26:32,399 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:33,041 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 16:26:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 57 states and 102 transitions. [2022-12-14 16:26:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 102 transitions. [2022-12-14 16:26:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 16:26:34,515 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:34,714 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 16:26:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 60 states and 107 transitions. [2022-12-14 16:26:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 107 transitions. [2022-12-14 16:26:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 16:26:34,912 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:36,508 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 16:26:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 76 states and 135 transitions. [2022-12-14 16:26:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 135 transitions. [2022-12-14 16:26:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 16:26:39,790 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:40,990 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 16:26:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 92 states and 162 transitions. [2022-12-14 16:26:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 162 transitions. [2022-12-14 16:26:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 16:26:43,902 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:44,733 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 16:26:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 93 states and 164 transitions. [2022-12-14 16:26:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 164 transitions. [2022-12-14 16:26:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 16:26:45,016 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:46,117 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 16:26:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 111 states and 195 transitions. [2022-12-14 16:26:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 195 transitions. [2022-12-14 16:26:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 16:26:49,560 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:49,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:50,646 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 16:26:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 113 states and 200 transitions. [2022-12-14 16:26:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 200 transitions. [2022-12-14 16:26:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 16:26:51,402 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:52,809 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 16:26:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 127 states and 228 transitions. [2022-12-14 16:26:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 228 transitions. [2022-12-14 16:26:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 16:26:56,335 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:57,661 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 16:26:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 128 states and 229 transitions. [2022-12-14 16:26:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 229 transitions. [2022-12-14 16:26:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 16:26:58,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:26:59,192 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 16:26:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:26:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 129 states and 235 transitions. [2022-12-14 16:26:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 235 transitions. [2022-12-14 16:26:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 16:26:59,595 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:26:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:26:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:00,622 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 16:27:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 145 states and 255 transitions. [2022-12-14 16:27:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2022-12-14 16:27:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 16:27:03,959 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:05,972 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 16:27:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 153 states and 270 transitions. [2022-12-14 16:27:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 270 transitions. [2022-12-14 16:27:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 16:27:11,545 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:12,417 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 16:27:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 158 states and 280 transitions. [2022-12-14 16:27:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 280 transitions. [2022-12-14 16:27:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 16:27:13,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:15,491 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 16:27:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 166 states and 298 transitions. [2022-12-14 16:27:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 298 transitions. [2022-12-14 16:27:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 16:27:19,068 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:21,105 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 16:27:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 180 states and 345 transitions. [2022-12-14 16:27:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 345 transitions. [2022-12-14 16:27:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 16:27:27,794 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:29,237 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 16:27:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 194 states and 389 transitions. [2022-12-14 16:27:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 389 transitions. [2022-12-14 16:27:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 16:27:34,884 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:36,313 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 16:27:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 204 states and 417 transitions. [2022-12-14 16:27:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 417 transitions. [2022-12-14 16:27:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 16:27:42,026 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:43,056 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 16:27:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 205 states and 422 transitions. [2022-12-14 16:27:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 422 transitions. [2022-12-14 16:27:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 16:27:43,631 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:44,557 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 16:27:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 206 states and 425 transitions. [2022-12-14 16:27:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 425 transitions. [2022-12-14 16:27:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 16:27:45,231 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:45,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:46,831 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 16:27:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 217 states and 452 transitions. [2022-12-14 16:27:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 452 transitions. [2022-12-14 16:27:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 16:27:52,867 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:53,978 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 16:27:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 218 states and 464 transitions. [2022-12-14 16:27:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 464 transitions. [2022-12-14 16:27:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 16:27:54,682 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:55,689 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 16:27:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 219 states and 470 transitions. [2022-12-14 16:27:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 470 transitions. [2022-12-14 16:27:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 16:27:56,266 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:27:57,367 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 16:27:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:27:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 220 states and 473 transitions. [2022-12-14 16:27:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 473 transitions. [2022-12-14 16:27:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 16:27:57,998 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:27:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:27:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:00,020 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 16:28:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 228 states and 500 transitions. [2022-12-14 16:28:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 500 transitions. [2022-12-14 16:28:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 16:28:06,285 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:08,489 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 16:28:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 232 states and 519 transitions. [2022-12-14 16:28:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 519 transitions. [2022-12-14 16:28:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 16:28:11,994 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:13,324 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 16:28:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 233 states and 520 transitions. [2022-12-14 16:28:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 520 transitions. [2022-12-14 16:28:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 16:28:13,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:15,244 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 16:28:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 236 states and 533 transitions. [2022-12-14 16:28:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 533 transitions. [2022-12-14 16:28:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 16:28:17,231 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:18,464 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 16:28:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 237 states and 534 transitions. [2022-12-14 16:28:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 534 transitions. [2022-12-14 16:28:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 16:28:19,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:19,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:20,275 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 16:28:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 241 states and 545 transitions. [2022-12-14 16:28:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 545 transitions. [2022-12-14 16:28:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 16:28:22,641 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:24,211 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 16:28:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 246 states and 561 transitions. [2022-12-14 16:28:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 561 transitions. [2022-12-14 16:28:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 16:28:28,203 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:28,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:29,250 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 16:28:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 250 states and 574 transitions. [2022-12-14 16:28:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 574 transitions. [2022-12-14 16:28:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 16:28:31,528 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:34,141 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 16:28:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 262 states and 599 transitions. [2022-12-14 16:28:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 599 transitions. [2022-12-14 16:28:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 16:28:41,407 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:41,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:42,375 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 16:28:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 264 states and 606 transitions. [2022-12-14 16:28:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 606 transitions. [2022-12-14 16:28:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 16:28:43,664 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:45,423 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 16:28:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 271 states and 634 transitions. [2022-12-14 16:28:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 634 transitions. [2022-12-14 16:28:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 16:28:51,927 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:53,418 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 16:28:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:28:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 272 states and 636 transitions. [2022-12-14 16:28:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 636 transitions. [2022-12-14 16:28:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 16:28:54,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:28:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:28:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:28:58,212 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 16:29:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:29:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 275 states and 646 transitions. [2022-12-14 16:29:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 646 transitions. [2022-12-14 16:29:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 16:29:02,041 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:29:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:29:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:29:04,449 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 16:29:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:29:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 276 states and 648 transitions. [2022-12-14 16:29:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 648 transitions. [2022-12-14 16:29:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 16:29:05,727 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:29:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:29:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:29:07,629 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 16:29:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 16:29:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 279 states and 664 transitions. [2022-12-14 16:29:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 664 transitions. [2022-12-14 16:29:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 16:29:09,887 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 16:29:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:29:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 16:29:10,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 16:29:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 16:29:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 16:29:11,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 16:29:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 16:29:11,733 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2022-12-14 16:29:11,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 04:29:11 ImpRootNode [2022-12-14 16:29:11,855 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 16:29:11,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 16:29:11,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 16:29:11,856 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 16:29:11,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:26:25" (3/4) ... [2022-12-14 16:29:11,858 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 16:29:11,966 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 16:29:11,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 16:29:11,967 INFO L158 Benchmark]: Toolchain (without parser) took 168132.86ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 111.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 231.6MB. Max. memory is 16.1GB. [2022-12-14 16:29:11,967 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 16:29:11,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.78ms. Allocated memory is still 155.2MB. Free memory was 111.5MB in the beginning and 95.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 16:29:11,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.06ms. Allocated memory is still 155.2MB. Free memory was 95.2MB in the beginning and 92.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 16:29:11,967 INFO L158 Benchmark]: Boogie Preprocessor took 24.30ms. Allocated memory is still 155.2MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 16:29:11,968 INFO L158 Benchmark]: RCFGBuilder took 914.97ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 90.0MB in the beginning and 124.1MB in the end (delta: -34.1MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-12-14 16:29:11,968 INFO L158 Benchmark]: CodeCheck took 166749.01ms. Allocated memory was 190.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 124.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 190.8MB. Max. memory is 16.1GB. [2022-12-14 16:29:11,968 INFO L158 Benchmark]: Witness Printer took 110.21ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 16:29:11,970 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: 166.6s, OverallIterations: 47, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16322 SdHoareTripleChecker+Valid, 110.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14778 mSDsluCounter, 5957 SdHoareTripleChecker+Invalid, 99.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5213 mSDsCounter, 4932 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44497 IncrementalHoareTripleChecker+Invalid, 49429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4932 mSolverCounterUnsat, 744 mSDtfsCounter, 44497 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13585 GetRequests, 12068 SyntacticMatches, 565 SemanticMatches, 952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535845 ImplicationChecksByTransitivity, 111.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 51.9s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1364 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1270 ConstructedInterpolants, 0 QuantifiedInterpolants, 13389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 10 PerfectInterpolantSequences, 154/830 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: 567]: 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] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND FALSE !(\read(r121)) [L244] COND TRUE \read(r131) [L245] COND TRUE \read(ep32) [L246] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND TRUE \read(r131) [L255] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND TRUE \read(r231) [L271] COND TRUE \read(ep31) [L272] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND TRUE \read(r321) [L307] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [c1=0, ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, i2=0, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND TRUE \read(ep13) [L112] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=106, m2=107, m3=0, max1=105, max2=106, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=105, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=106, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND TRUE (int )m2 > (int )max2 [L141] max2 = m2 [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L445] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=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] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND TRUE \read(ep13) [L112] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=106, max1=108, max2=108, max3=108, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=108, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=108, p31=0, p31_new=-1, p31_old=108, p32=0, p32_new=-1, p32_old=108, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] st1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND TRUE (int )r2 == 2 [L145] COND FALSE !((int )max2 == (int )id2) [L148] nl2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=108, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=108, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=108, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L567] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=255, ep31=255, ep32=255, id1=105, id2=106, id3=108, m1=108, m2=108, m3=108, max1=108, max2=108, max3=108, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.78ms. Allocated memory is still 155.2MB. Free memory was 111.5MB in the beginning and 95.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.06ms. Allocated memory is still 155.2MB. Free memory was 95.2MB in the beginning and 92.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.30ms. Allocated memory is still 155.2MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 914.97ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 90.0MB in the beginning and 124.1MB in the end (delta: -34.1MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * CodeCheck took 166749.01ms. Allocated memory was 190.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 124.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 190.8MB. Max. memory is 16.1GB. * Witness Printer took 110.21ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 16:29:11,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d7e0afe-980b-41d6-b472-d43c794a93d8/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