./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/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_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- 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 01:39:08,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 01:39:08,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 01:39:08,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 01:39:08,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 01:39:08,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 01:39:08,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 01:39:08,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 01:39:08,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 01:39:08,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 01:39:08,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 01:39:08,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 01:39:08,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 01:39:08,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 01:39:08,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 01:39:08,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 01:39:08,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 01:39:08,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 01:39:08,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 01:39:08,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 01:39:08,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 01:39:08,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 01:39:08,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 01:39:08,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 01:39:08,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 01:39:08,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 01:39:08,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 01:39:08,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 01:39:08,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 01:39:08,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 01:39:08,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 01:39:08,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 01:39:08,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 01:39:08,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 01:39:08,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 01:39:08,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 01:39:08,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 01:39:08,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 01:39:08,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 01:39:08,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 01:39:08,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 01:39:08,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/config/svcomp-Overflow-32bit-Kojak_Default.epf [2022-12-15 01:39:08,083 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 01:39:08,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 01:39:08,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 01:39:08,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 01:39:08,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 01:39:08,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 01:39:08,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 01:39:08,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 01:39:08,085 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-15 01:39:08,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 01:39:08,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 01:39:08,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 01:39:08,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 01:39:08,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 01:39:08,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 01:39:08,086 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-15 01:39:08,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 01:39:08,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 01:39:08,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 01:39:08,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 01:39:08,087 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 01:39:08,088 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 01:39:08,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 01:39:08,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 01:39:08,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 01:39:08,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 01:39:08,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 01:39:08,089 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 01:39:08,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 01:39:08,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 01:39:08,089 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_2e4a1853-aa08-4348-857f-08febe6824aa/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_2e4a1853-aa08-4348-857f-08febe6824aa/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 ! overflow) ) 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 -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2022-12-15 01:39:08,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 01:39:08,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 01:39:08,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 01:39:08,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 01:39:08,325 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 01:39:08,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-12-15 01:39:10,907 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 01:39:11,046 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 01:39:11,047 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-12-15 01:39:11,053 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/data/affa489aa/907441f769144f0a84fc2b0a6a1011a4/FLAGf9b75567d [2022-12-15 01:39:11,064 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/data/affa489aa/907441f769144f0a84fc2b0a6a1011a4 [2022-12-15 01:39:11,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 01:39:11,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 01:39:11,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 01:39:11,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 01:39:11,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 01:39:11,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4d0133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11, skipping insertion in model container [2022-12-15 01:39:11,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 01:39:11,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 01:39:11,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_2e4a1853-aa08-4348-857f-08febe6824aa/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-12-15 01:39:11,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 01:39:11,269 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 01:39:11,279 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_2e4a1853-aa08-4348-857f-08febe6824aa/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-12-15 01:39:11,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 01:39:11,319 INFO L208 MainTranslator]: Completed translation [2022-12-15 01:39:11,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11 WrapperNode [2022-12-15 01:39:11,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 01:39:11,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 01:39:11,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 01:39:11,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 01:39:11,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,359 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 284 [2022-12-15 01:39:11,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 01:39:11,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 01:39:11,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 01:39:11,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 01:39:11,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 01:39:11,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 01:39:11,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 01:39:11,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 01:39:11,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 01:39:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 01:39:11,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 01:39:11,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 01:39:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 01:39:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-15 01:39:11,450 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-15 01:39:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-15 01:39:11,451 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-15 01:39:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-15 01:39:11,451 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-15 01:39:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-15 01:39:11,451 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-15 01:39:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-15 01:39:11,451 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-15 01:39:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-15 01:39:11,452 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-15 01:39:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 01:39:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-15 01:39:11,452 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-15 01:39:11,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 01:39:11,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 01:39:11,512 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 01:39:11,514 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 01:39:11,818 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 01:39:11,909 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 01:39:11,909 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-15 01:39:11,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:39:11 BoogieIcfgContainer [2022-12-15 01:39:11,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 01:39:11,912 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 01:39:11,912 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 01:39:11,920 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 01:39:11,920 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:39:11" (1/1) ... [2022-12-15 01:39:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 01:39:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 95 states and 133 transitions. [2022-12-15 01:39:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2022-12-15 01:39:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 01:39:11,971 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:12,168 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 01:39:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 103 states and 148 transitions. [2022-12-15 01:39:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2022-12-15 01:39:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 01:39:12,372 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:12,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:12,467 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 01:39:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 104 states and 148 transitions. [2022-12-15 01:39:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2022-12-15 01:39:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 01:39:12,585 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:12,652 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 01:39:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 105 states and 148 transitions. [2022-12-15 01:39:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2022-12-15 01:39:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 01:39:12,779 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:12,841 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 01:39:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 111 states and 161 transitions. [2022-12-15 01:39:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2022-12-15 01:39:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 01:39:13,029 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:13,076 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 01:39:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 119 states and 176 transitions. [2022-12-15 01:39:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2022-12-15 01:39:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 01:39:13,205 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:13,379 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 01:39:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 135 states and 213 transitions. [2022-12-15 01:39:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 213 transitions. [2022-12-15 01:39:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 01:39:14,012 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:14,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:14,059 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 01:39:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 137 states and 214 transitions. [2022-12-15 01:39:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2022-12-15 01:39:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-15 01:39:14,471 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:14,495 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 01:39:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 138 states and 216 transitions. [2022-12-15 01:39:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 216 transitions. [2022-12-15 01:39:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 01:39:14,560 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:14,581 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 01:39:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 133 states and 207 transitions. [2022-12-15 01:39:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 207 transitions. [2022-12-15 01:39:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 01:39:14,663 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:14,690 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 01:39:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 130 states and 199 transitions. [2022-12-15 01:39:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2022-12-15 01:39:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-15 01:39:14,745 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:14,788 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 01:39:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 140 states and 221 transitions. [2022-12-15 01:39:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 221 transitions. [2022-12-15 01:39:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-15 01:39:15,003 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:15,203 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 01:39:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 158 states and 263 transitions. [2022-12-15 01:39:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 263 transitions. [2022-12-15 01:39:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-15 01:39:16,681 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:16,707 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 01:39:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 160 states and 268 transitions. [2022-12-15 01:39:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 268 transitions. [2022-12-15 01:39:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-15 01:39:16,883 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:16,904 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 01:39:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 161 states and 270 transitions. [2022-12-15 01:39:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 270 transitions. [2022-12-15 01:39:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 01:39:16,982 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-15 01:39:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 156 states and 261 transitions. [2022-12-15 01:39:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 261 transitions. [2022-12-15 01:39:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 01:39:17,112 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:17,140 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 01:39:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 153 states and 253 transitions. [2022-12-15 01:39:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 253 transitions. [2022-12-15 01:39:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-15 01:39:17,234 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:17,297 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 01:39:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 165 states and 287 transitions. [2022-12-15 01:39:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2022-12-15 01:39:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-15 01:39:17,935 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:17,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:17,947 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 01:39:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 165 states and 286 transitions. [2022-12-15 01:39:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 286 transitions. [2022-12-15 01:39:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-15 01:39:17,972 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:17,987 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 01:39:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 167 states and 289 transitions. [2022-12-15 01:39:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 289 transitions. [2022-12-15 01:39:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-15 01:39:18,021 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 187 states and 335 transitions. [2022-12-15 01:39:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 335 transitions. [2022-12-15 01:39:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-15 01:39:20,594 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 01:39:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 189 states and 341 transitions. [2022-12-15 01:39:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 341 transitions. [2022-12-15 01:39:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-15 01:39:21,040 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 01:39:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 190 states and 343 transitions. [2022-12-15 01:39:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 343 transitions. [2022-12-15 01:39:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-15 01:39:21,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 01:39:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 185 states and 335 transitions. [2022-12-15 01:39:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 335 transitions. [2022-12-15 01:39:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-15 01:39:21,321 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 01:39:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 182 states and 326 transitions. [2022-12-15 01:39:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 326 transitions. [2022-12-15 01:39:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-15 01:39:21,489 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 01:39:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 186 states and 336 transitions. [2022-12-15 01:39:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 336 transitions. [2022-12-15 01:39:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-15 01:39:22,190 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 188 states and 339 transitions. [2022-12-15 01:39:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 339 transitions. [2022-12-15 01:39:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-15 01:39:22,306 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-15 01:39:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 192 states and 349 transitions. [2022-12-15 01:39:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 349 transitions. [2022-12-15 01:39:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-15 01:39:23,153 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 01:39:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 194 states and 352 transitions. [2022-12-15 01:39:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 352 transitions. [2022-12-15 01:39:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-15 01:39:23,193 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-15 01:39:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 196 states and 355 transitions. [2022-12-15 01:39:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 355 transitions. [2022-12-15 01:39:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-15 01:39:23,241 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-15 01:39:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 198 states and 357 transitions. [2022-12-15 01:39:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 357 transitions. [2022-12-15 01:39:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-15 01:39:23,494 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-15 01:39:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 200 states and 360 transitions. [2022-12-15 01:39:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 360 transitions. [2022-12-15 01:39:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-15 01:39:23,603 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-15 01:39:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 202 states and 363 transitions. [2022-12-15 01:39:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 363 transitions. [2022-12-15 01:39:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-15 01:39:23,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-15 01:39:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 204 states and 365 transitions. [2022-12-15 01:39:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 365 transitions. [2022-12-15 01:39:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-15 01:39:23,923 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 213 states and 392 transitions. [2022-12-15 01:39:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 392 transitions. [2022-12-15 01:39:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-15 01:39:25,034 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-15 01:39:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 215 states and 395 transitions. [2022-12-15 01:39:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 395 transitions. [2022-12-15 01:39:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-15 01:39:25,083 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-15 01:39:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 222 states and 409 transitions. [2022-12-15 01:39:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 409 transitions. [2022-12-15 01:39:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-15 01:39:25,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-15 01:39:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 224 states and 412 transitions. [2022-12-15 01:39:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 412 transitions. [2022-12-15 01:39:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-15 01:39:25,679 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 226 states and 415 transitions. [2022-12-15 01:39:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 415 transitions. [2022-12-15 01:39:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-15 01:39:25,738 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 235 states and 444 transitions. [2022-12-15 01:39:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 444 transitions. [2022-12-15 01:39:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-15 01:39:26,821 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 243 states and 465 transitions. [2022-12-15 01:39:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 465 transitions. [2022-12-15 01:39:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-15 01:39:27,896 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 256 states and 496 transitions. [2022-12-15 01:39:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 496 transitions. [2022-12-15 01:39:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-15 01:39:28,342 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 257 states and 496 transitions. [2022-12-15 01:39:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 496 transitions. [2022-12-15 01:39:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-15 01:39:28,410 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 258 states and 496 transitions. [2022-12-15 01:39:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 496 transitions. [2022-12-15 01:39:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-15 01:39:28,472 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 268 states and 528 transitions. [2022-12-15 01:39:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 528 transitions. [2022-12-15 01:39:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-15 01:39:29,848 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 270 states and 531 transitions. [2022-12-15 01:39:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 531 transitions. [2022-12-15 01:39:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-15 01:39:30,117 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-15 01:39:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 275 states and 544 transitions. [2022-12-15 01:39:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 544 transitions. [2022-12-15 01:39:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-15 01:39:30,620 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:30,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 277 states and 547 transitions. [2022-12-15 01:39:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 547 transitions. [2022-12-15 01:39:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-15 01:39:30,659 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-15 01:39:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 292 states and 585 transitions. [2022-12-15 01:39:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 585 transitions. [2022-12-15 01:39:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-15 01:39:32,338 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-15 01:39:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 294 states and 590 transitions. [2022-12-15 01:39:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 590 transitions. [2022-12-15 01:39:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-15 01:39:32,704 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 301 states and 607 transitions. [2022-12-15 01:39:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 607 transitions. [2022-12-15 01:39:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-15 01:39:34,013 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 303 states and 610 transitions. [2022-12-15 01:39:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 610 transitions. [2022-12-15 01:39:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:34,349 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 303 states and 609 transitions. [2022-12-15 01:39:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 609 transitions. [2022-12-15 01:39:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:34,618 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-15 01:39:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 301 states and 604 transitions. [2022-12-15 01:39:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 604 transitions. [2022-12-15 01:39:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:34,889 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 302 states and 604 transitions. [2022-12-15 01:39:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 604 transitions. [2022-12-15 01:39:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:35,079 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 302 states and 602 transitions. [2022-12-15 01:39:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 602 transitions. [2022-12-15 01:39:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:35,393 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-15 01:39:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 307 states and 616 transitions. [2022-12-15 01:39:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 616 transitions. [2022-12-15 01:39:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:35,871 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 305 states and 611 transitions. [2022-12-15 01:39:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 611 transitions. [2022-12-15 01:39:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:36,129 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-15 01:39:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 298 states and 592 transitions. [2022-12-15 01:39:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 592 transitions. [2022-12-15 01:39:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-15 01:39:36,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-15 01:39:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 298 states and 591 transitions. [2022-12-15 01:39:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 591 transitions. [2022-12-15 01:39:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-15 01:39:36,272 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-15 01:39:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 317 states and 635 transitions. [2022-12-15 01:39:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 635 transitions. [2022-12-15 01:39:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-15 01:39:38,337 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-15 01:39:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 319 states and 638 transitions. [2022-12-15 01:39:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 638 transitions. [2022-12-15 01:39:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-15 01:39:38,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-15 01:39:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 326 states and 677 transitions. [2022-12-15 01:39:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 677 transitions. [2022-12-15 01:39:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-15 01:39:39,592 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-15 01:39:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 333 states and 693 transitions. [2022-12-15 01:39:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 693 transitions. [2022-12-15 01:39:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-15 01:39:40,267 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 01:39:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-15 01:39:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 01:39:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 336 states and 702 transitions. [2022-12-15 01:39:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 702 transitions. [2022-12-15 01:39:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-15 01:39:40,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 01:39:40,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 01:39:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:39:40,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 01:39:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:39:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:39:40,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 01:39:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 01:39:40,938 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 65 iterations. [2022-12-15 01:39:41,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 01:39:41 ImpRootNode [2022-12-15 01:39:41,027 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 01:39:41,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 01:39:41,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 01:39:41,027 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 01:39:41,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:39:11" (3/4) ... [2022-12-15 01:39:41,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 01:39:41,133 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 01:39:41,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 01:39:41,134 INFO L158 Benchmark]: Toolchain (without parser) took 30066.52ms. Allocated memory was 123.7MB in the beginning and 327.2MB in the end (delta: 203.4MB). Free memory was 72.9MB in the beginning and 244.7MB in the end (delta: -171.8MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-12-15 01:39:41,134 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 01:39:41,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.59ms. Allocated memory was 123.7MB in the beginning and 188.7MB in the end (delta: 65.0MB). Free memory was 72.6MB in the beginning and 159.3MB in the end (delta: -86.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-12-15 01:39:41,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.85ms. Allocated memory is still 188.7MB. Free memory was 159.3MB in the beginning and 157.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 01:39:41,135 INFO L158 Benchmark]: Boogie Preprocessor took 27.70ms. Allocated memory is still 188.7MB. Free memory was 157.1MB in the beginning and 155.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-15 01:39:41,135 INFO L158 Benchmark]: RCFGBuilder took 523.52ms. Allocated memory is still 188.7MB. Free memory was 155.1MB in the beginning and 115.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-12-15 01:39:41,136 INFO L158 Benchmark]: CodeCheck took 29114.48ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 115.2MB in the beginning and 252.1MB in the end (delta: -136.8MB). Peak memory consumption was 180.9MB. Max. memory is 16.1GB. [2022-12-15 01:39:41,136 INFO L158 Benchmark]: Witness Printer took 106.00ms. Allocated memory is still 327.2MB. Free memory was 252.1MB in the beginning and 244.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-15 01:39:41,138 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 8 procedures, 95 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 65, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37072 SdHoareTripleChecker+Valid, 38.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22689 mSDsluCounter, 54207 SdHoareTripleChecker+Invalid, 34.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37956 mSDsCounter, 11138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42254 IncrementalHoareTripleChecker+Invalid, 53392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11138 mSolverCounterUnsat, 16251 mSDtfsCounter, 42254 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38018 GetRequests, 36430 SyntacticMatches, 1050 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186498 ImplicationChecksByTransitivity, 23.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3102 ConstructedInterpolants, 0 QuantifiedInterpolants, 6194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 50 PerfectInterpolantSequences, 445/529 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: 125]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) [L361] COND FALSE !(T1_E == 0) [L366] COND FALSE !(T2_E == 0) [L371] COND FALSE !(E_M == 0) [L376] COND FALSE !(E_1 == 0) [L381] COND FALSE !(E_2 == 0) [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) [L399] COND FALSE !(T1_E == 1) [L404] COND FALSE !(T2_E == 1) [L409] COND FALSE !(E_M == 1) [L414] COND FALSE !(E_1 == 1) [L419] COND FALSE !(E_2 == 1) [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 [L119] t1_pc = 1 [L120] t1_st = 2 [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L61] COND TRUE 1 [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L467] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L188] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L226] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L467] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L125] token += 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.59ms. Allocated memory was 123.7MB in the beginning and 188.7MB in the end (delta: 65.0MB). Free memory was 72.6MB in the beginning and 159.3MB in the end (delta: -86.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.85ms. Allocated memory is still 188.7MB. Free memory was 159.3MB in the beginning and 157.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.70ms. Allocated memory is still 188.7MB. Free memory was 157.1MB in the beginning and 155.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.52ms. Allocated memory is still 188.7MB. Free memory was 155.1MB in the beginning and 115.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * CodeCheck took 29114.48ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 115.2MB in the beginning and 252.1MB in the end (delta: -136.8MB). Peak memory consumption was 180.9MB. Max. memory is 16.1GB. * Witness Printer took 106.00ms. Allocated memory is still 327.2MB. Free memory was 252.1MB in the beginning and 244.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 01:39:41,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e4a1853-aa08-4348-857f-08febe6824aa/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(OVERFLOW)