./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/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_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/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_84f02517-860d-4c39-aa99-eb19bbe4342c/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 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-15 00:14:27,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 00:14:27,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 00:14:27,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 00:14:27,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 00:14:27,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 00:14:27,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 00:14:27,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 00:14:27,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 00:14:27,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 00:14:27,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 00:14:27,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 00:14:27,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 00:14:27,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 00:14:27,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 00:14:27,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 00:14:27,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 00:14:27,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 00:14:27,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 00:14:27,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 00:14:27,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 00:14:27,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 00:14:27,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 00:14:27,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 00:14:27,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 00:14:27,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 00:14:27,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 00:14:27,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 00:14:27,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 00:14:27,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 00:14:27,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 00:14:27,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 00:14:27,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 00:14:27,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 00:14:27,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 00:14:27,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 00:14:27,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 00:14:27,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 00:14:27,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 00:14:27,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 00:14:27,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 00:14:27,992 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 00:14:28,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 00:14:28,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 00:14:28,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 00:14:28,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 00:14:28,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 00:14:28,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 00:14:28,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 00:14:28,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 00:14:28,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 00:14:28,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 00:14:28,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 00:14:28,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 00:14:28,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 00:14:28,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 00:14:28,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 00:14:28,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 00:14:28,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 00:14:28,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 00:14:28,018 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 00:14:28,018 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 00:14:28,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 00:14:28,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:14:28,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 00:14:28,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 00:14:28,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 00:14:28,018 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 00:14:28,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 00:14:28,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 00:14:28,019 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_84f02517-860d-4c39-aa99-eb19bbe4342c/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_84f02517-860d-4c39-aa99-eb19bbe4342c/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 -> 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d [2022-12-15 00:14:28,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 00:14:28,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 00:14:28,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 00:14:28,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 00:14:28,211 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 00:14:28,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2022-12-15 00:14:30,825 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 00:14:30,975 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 00:14:30,975 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2022-12-15 00:14:30,982 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/data/c4ef5d490/6f31d9b456b342e5bc23b847cc07786c/FLAGb5a72358c [2022-12-15 00:14:30,993 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/data/c4ef5d490/6f31d9b456b342e5bc23b847cc07786c [2022-12-15 00:14:30,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 00:14:30,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 00:14:30,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 00:14:30,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 00:14:31,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 00:14:31,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:14:30" (1/1) ... [2022-12-15 00:14:31,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3baa57e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31, skipping insertion in model container [2022-12-15 00:14:31,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:14:30" (1/1) ... [2022-12-15 00:14:31,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 00:14:31,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 00:14:31,209 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_84f02517-860d-4c39-aa99-eb19bbe4342c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2022-12-15 00:14:31,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:14:31,220 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 00:14:31,260 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_84f02517-860d-4c39-aa99-eb19bbe4342c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2022-12-15 00:14:31,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:14:31,272 INFO L208 MainTranslator]: Completed translation [2022-12-15 00:14:31,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31 WrapperNode [2022-12-15 00:14:31,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 00:14:31,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 00:14:31,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 00:14:31,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 00:14:31,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,342 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 455 [2022-12-15 00:14:31,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 00:14:31,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 00:14:31,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 00:14:31,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 00:14:31,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,371 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 00:14:31,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 00:14:31,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 00:14:31,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 00:14:31,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:14:31" (1/1) ... [2022-12-15 00:14:31,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:14:31,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 00:14:31,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 00:14:31,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 00:14:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 00:14:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 00:14:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 00:14:31,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 00:14:31,522 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 00:14:31,523 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 00:14:31,907 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 00:14:32,438 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 00:14:32,438 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-15 00:14:32,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:14:32 BoogieIcfgContainer [2022-12-15 00:14:32,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 00:14:32,442 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 00:14:32,442 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 00:14:32,451 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 00:14:32,452 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:14:32" (1/1) ... [2022-12-15 00:14:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 00:14:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2022-12-15 00:14:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2022-12-15 00:14:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-15 00:14:32,514 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2022-12-15 00:14:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2022-12-15 00:14:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-15 00:14:34,094 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2022-12-15 00:14:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2022-12-15 00:14:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-15 00:14:35,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2022-12-15 00:14:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2022-12-15 00:14:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-15 00:14:36,039 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2022-12-15 00:14:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2022-12-15 00:14:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-15 00:14:37,390 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2022-12-15 00:14:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2022-12-15 00:14:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-15 00:14:38,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2022-12-15 00:14:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2022-12-15 00:14:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-15 00:14:40,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2022-12-15 00:14:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2022-12-15 00:14:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 00:14:40,515 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2022-12-15 00:14:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2022-12-15 00:14:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-15 00:14:40,562 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:40,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2022-12-15 00:14:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2022-12-15 00:14:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-15 00:14:42,713 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2022-12-15 00:14:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2022-12-15 00:14:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-15 00:14:43,076 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 77 states and 147 transitions. [2022-12-15 00:14:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 147 transitions. [2022-12-15 00:14:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-15 00:14:49,557 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:14:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:14:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 93 states and 183 transitions. [2022-12-15 00:14:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 183 transitions. [2022-12-15 00:14:55,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-15 00:14:55,644 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:14:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:14:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:14:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 109 states and 215 transitions. [2022-12-15 00:15:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 215 transitions. [2022-12-15 00:15:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:15:02,662 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 127 states and 258 transitions. [2022-12-15 00:15:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 258 transitions. [2022-12-15 00:15:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:15:12,241 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 144 states and 295 transitions. [2022-12-15 00:15:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 295 transitions. [2022-12-15 00:15:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-15 00:15:22,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:22,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 145 states and 299 transitions. [2022-12-15 00:15:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 299 transitions. [2022-12-15 00:15:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:15:24,101 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 159 states and 325 transitions. [2022-12-15 00:15:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 325 transitions. [2022-12-15 00:15:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:15:32,019 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 175 states and 360 transitions. [2022-12-15 00:15:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 360 transitions. [2022-12-15 00:15:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-15 00:15:41,659 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 176 states and 361 transitions. [2022-12-15 00:15:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 361 transitions. [2022-12-15 00:15:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-15 00:15:44,820 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 195 states and 399 transitions. [2022-12-15 00:15:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 399 transitions. [2022-12-15 00:15:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-15 00:15:55,334 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:15:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:15:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:15:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 200 states and 412 transitions. [2022-12-15 00:15:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 412 transitions. [2022-12-15 00:15:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-15 00:15:58,812 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:15:58,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:15:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:16:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:16:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 214 states and 432 transitions. [2022-12-15 00:16:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 432 transitions. [2022-12-15 00:16:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-15 00:16:05,770 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:16:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:16:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:16:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:16:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 219 states and 447 transitions. [2022-12-15 00:16:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 447 transitions. [2022-12-15 00:16:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-15 00:16:10,767 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:16:10,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:16:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:16:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:16:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 233 states and 506 transitions. [2022-12-15 00:16:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 506 transitions. [2022-12-15 00:16:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-15 00:16:22,569 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:16:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:16:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:16:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:16:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 248 states and 567 transitions. [2022-12-15 00:16:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 567 transitions. [2022-12-15 00:16:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:16:35,196 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:16:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:16:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:16:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:16:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 259 states and 591 transitions. [2022-12-15 00:16:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 591 transitions. [2022-12-15 00:16:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:16:43,520 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:16:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:16:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:16:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:16:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 272 states and 617 transitions. [2022-12-15 00:16:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 617 transitions. [2022-12-15 00:16:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:16:53,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:16:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:16:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:16:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:16:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 273 states and 618 transitions. [2022-12-15 00:16:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 618 transitions. [2022-12-15 00:16:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 00:16:55,576 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:16:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:16:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:16:57,459 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-15 00:17:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:17:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 282 states and 636 transitions. [2022-12-15 00:17:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 636 transitions. [2022-12-15 00:17:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 00:17:04,210 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:17:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:17:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:17:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:17:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:17:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 309 states and 689 transitions. [2022-12-15 00:17:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 689 transitions. [2022-12-15 00:17:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 00:17:18,836 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:17:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:17:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:17:19,920 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-15 00:17:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:17:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 310 states and 694 transitions. [2022-12-15 00:17:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 694 transitions. [2022-12-15 00:17:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 00:17:20,813 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:17:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:17:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:17:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:17:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:17:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 319 states and 713 transitions. [2022-12-15 00:17:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 713 transitions. [2022-12-15 00:17:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 00:17:29,281 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:17:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:17:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:17:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:17:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:17:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 325 states and 736 transitions. [2022-12-15 00:17:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 736 transitions. [2022-12-15 00:17:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 00:17:38,583 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:17:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:17:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:17:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:17:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:17:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 326 states and 741 transitions. [2022-12-15 00:17:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 741 transitions. [2022-12-15 00:17:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 00:17:40,700 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:17:40,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:17:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:17:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:17:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:17:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 335 states and 772 transitions. [2022-12-15 00:17:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 772 transitions. [2022-12-15 00:17:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 00:17:54,047 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:17:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:17:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:17:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:18:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 341 states and 799 transitions. [2022-12-15 00:18:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 799 transitions. [2022-12-15 00:18:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 00:18:04,682 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:18:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 342 states and 802 transitions. [2022-12-15 00:18:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 802 transitions. [2022-12-15 00:18:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 00:18:07,214 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:08,985 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-15 00:18:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 346 states and 816 transitions. [2022-12-15 00:18:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 816 transitions. [2022-12-15 00:18:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 00:18:12,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:12,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:13,279 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-15 00:18:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 353 states and 838 transitions. [2022-12-15 00:18:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 838 transitions. [2022-12-15 00:18:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 00:18:18,999 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:20,076 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-15 00:18:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 356 states and 854 transitions. [2022-12-15 00:18:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 854 transitions. [2022-12-15 00:18:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 00:18:23,074 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:18:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 358 states and 868 transitions. [2022-12-15 00:18:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 868 transitions. [2022-12-15 00:18:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 00:18:31,199 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:31,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:33,241 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-15 00:18:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 363 states and 893 transitions. [2022-12-15 00:18:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 893 transitions. [2022-12-15 00:18:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 00:18:38,944 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 00:18:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 379 states and 918 transitions. [2022-12-15 00:18:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 918 transitions. [2022-12-15 00:18:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 00:18:50,455 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:51,887 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-15 00:18:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 380 states and 919 transitions. [2022-12-15 00:18:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 919 transitions. [2022-12-15 00:18:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 00:18:53,165 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:18:56,133 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-15 00:18:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:18:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 382 states and 934 transitions. [2022-12-15 00:18:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 934 transitions. [2022-12-15 00:18:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 00:18:59,562 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:18:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:18:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:19:01,081 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-15 00:19:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:19:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 385 states and 948 transitions. [2022-12-15 00:19:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 948 transitions. [2022-12-15 00:19:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-15 00:19:03,729 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:19:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:19:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:19:05,206 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-15 00:19:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:19:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 386 states and 951 transitions. [2022-12-15 00:19:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 951 transitions. [2022-12-15 00:19:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-15 00:19:06,589 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:19:06,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:19:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:19:07,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:19:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:19:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:19:07,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:19:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:19:08,260 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2022-12-15 00:19:08,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 12:19:08 ImpRootNode [2022-12-15 00:19:08,353 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 00:19:08,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 00:19:08,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 00:19:08,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 00:19:08,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:14:32" (3/4) ... [2022-12-15 00:19:08,355 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 00:19:08,465 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 00:19:08,465 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 00:19:08,466 INFO L158 Benchmark]: Toolchain (without parser) took 277469.46ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.5MB in the beginning and 630.5MB in the end (delta: -518.0MB). Peak memory consumption was 821.3MB. Max. memory is 16.1GB. [2022-12-15 00:19:08,466 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 00:19:08,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.75ms. Allocated memory is still 165.7MB. Free memory was 112.2MB in the beginning and 95.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-15 00:19:08,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.93ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 135.2MB in the end (delta: -39.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-12-15 00:19:08,467 INFO L158 Benchmark]: Boogie Preprocessor took 33.65ms. Allocated memory is still 165.7MB. Free memory was 135.2MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 00:19:08,467 INFO L158 Benchmark]: RCFGBuilder took 1063.96ms. Allocated memory is still 165.7MB. Free memory was 132.3MB in the beginning and 112.3MB in the end (delta: 20.0MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2022-12-15 00:19:08,468 INFO L158 Benchmark]: CodeCheck took 275910.82ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.3MB in the beginning and 647.3MB in the end (delta: -535.0MB). Peak memory consumption was 803.0MB. Max. memory is 16.1GB. [2022-12-15 00:19:08,468 INFO L158 Benchmark]: Witness Printer took 112.01ms. Allocated memory is still 1.5GB. Free memory was 647.3MB in the beginning and 630.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-15 00:19:08,470 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: 275.8s, OverallIterations: 48, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22657 SdHoareTripleChecker+Valid, 156.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21174 mSDsluCounter, 8386 SdHoareTripleChecker+Invalid, 139.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7625 mSDsCounter, 5774 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63891 IncrementalHoareTripleChecker+Invalid, 69665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5774 mSolverCounterUnsat, 761 mSDtfsCounter, 63891 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15765 GetRequests, 13937 SyntacticMatches, 538 SemanticMatches, 1290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011567 ImplicationChecksByTransitivity, 212.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 65.0s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1287 ConstructedInterpolants, 0 QuantifiedInterpolants, 15115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 149/825 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND FALSE !(\read(r131)) [L274] COND TRUE \read(r121) [L275] COND TRUE \read(ep23) [L276] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND FALSE !(\read(r211)) [L287] COND TRUE \read(r231) [L288] COND TRUE \read(ep31) [L289] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND TRUE \read(r231) [L298] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [c1=0, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, i2=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, i2=1, id1=123, id2=126, id3=124, m1=126, m2=127, m3=125, max1=123, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=123, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND TRUE (int )m3 > (int )max3 [L198] max3 = m3 [L199] newmax = (_Bool)1 [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, i2=2, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND FALSE !(\read(newmax2)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, i2=3, id1=123, id2=126, id3=124, m1=124, m2=123, m3=126, max1=124, max2=126, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] st1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND FALSE !((int )max3 == (int )id3) [L207] nl3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=124, m3=-1, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=124, m3=-1, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=124, m3=-1, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] [L600] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=255, ep31=1, ep32=0, id1=123, id2=126, id3=124, m1=126, m2=124, m3=-1, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, 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=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.75ms. Allocated memory is still 165.7MB. Free memory was 112.2MB in the beginning and 95.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.93ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 135.2MB in the end (delta: -39.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.65ms. Allocated memory is still 165.7MB. Free memory was 135.2MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1063.96ms. Allocated memory is still 165.7MB. Free memory was 132.3MB in the beginning and 112.3MB in the end (delta: 20.0MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. * CodeCheck took 275910.82ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.3MB in the beginning and 647.3MB in the end (delta: -535.0MB). Peak memory consumption was 803.0MB. Max. memory is 16.1GB. * Witness Printer took 112.01ms. Allocated memory is still 1.5GB. Free memory was 647.3MB in the beginning and 630.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 00:19:08,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84f02517-860d-4c39-aa99-eb19bbe4342c/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