./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/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_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 23:55:09,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 23:55:09,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 23:55:09,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 23:55:09,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 23:55:09,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 23:55:09,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 23:55:09,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 23:55:09,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 23:55:09,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 23:55:09,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 23:55:09,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 23:55:09,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 23:55:09,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 23:55:09,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 23:55:09,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 23:55:09,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 23:55:09,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 23:55:09,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 23:55:09,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 23:55:09,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 23:55:09,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 23:55:09,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 23:55:09,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 23:55:09,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 23:55:09,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 23:55:09,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 23:55:09,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 23:55:09,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 23:55:09,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 23:55:09,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 23:55:09,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 23:55:09,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 23:55:09,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 23:55:09,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 23:55:09,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 23:55:09,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 23:55:09,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 23:55:09,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 23:55:09,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 23:55:09,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 23:55:09,837 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 23:55:09,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 23:55:09,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 23:55:09,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 23:55:09,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 23:55:09,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 23:55:09,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 23:55:09,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 23:55:09,863 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 23:55:09,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 23:55:09,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 23:55:09,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 23:55:09,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 23:55:09,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 23:55:09,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 23:55:09,865 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 23:55:09,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 23:55:09,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 23:55:09,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 23:55:09,866 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 23:55:09,866 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 23:55:09,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 23:55:09,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:55:09,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 23:55:09,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 23:55:09,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 23:55:09,867 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 23:55:09,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 23:55:09,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 23:55:09,868 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_b999ed0b-9113-4445-bd93-4696a13646b4/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_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2022-12-14 23:55:10,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 23:55:10,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 23:55:10,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 23:55:10,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 23:55:10,083 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 23:55:10,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-12-14 23:55:12,700 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 23:55:13,059 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 23:55:13,059 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2022-12-14 23:55:13,089 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/data/3bb915848/c0074238849d4c6ba5441d04efabe4d6/FLAG3b78654fe [2022-12-14 23:55:13,100 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/data/3bb915848/c0074238849d4c6ba5441d04efabe4d6 [2022-12-14 23:55:13,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 23:55:13,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 23:55:13,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 23:55:13,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 23:55:13,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 23:55:13,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:55:13" (1/1) ... [2022-12-14 23:55:13,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5e829c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:13, skipping insertion in model container [2022-12-14 23:55:13,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:55:13" (1/1) ... [2022-12-14 23:55:13,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 23:55:13,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 23:55:14,584 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_b999ed0b-9113-4445-bd93-4696a13646b4/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-12-14 23:55:14,601 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_b999ed0b-9113-4445-bd93-4696a13646b4/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-12-14 23:55:14,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:55:14,713 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 23:55:15,514 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_b999ed0b-9113-4445-bd93-4696a13646b4/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2022-12-14 23:55:15,516 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_b999ed0b-9113-4445-bd93-4696a13646b4/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2022-12-14 23:55:15,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 23:55:15,563 INFO L208 MainTranslator]: Completed translation [2022-12-14 23:55:15,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15 WrapperNode [2022-12-14 23:55:15,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 23:55:15,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 23:55:15,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 23:55:15,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 23:55:15,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:15,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:15,850 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-12-14 23:55:15,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 23:55:15,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 23:55:15,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 23:55:15,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 23:55:15,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:15,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:15,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:15,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:16,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:16,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:16,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:16,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:16,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 23:55:16,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 23:55:16,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 23:55:16,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 23:55:16,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:55:15" (1/1) ... [2022-12-14 23:55:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 23:55:16,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 23:55:16,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 23:55:16,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 23:55:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 23:55:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 23:55:16,192 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 23:55:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-14 23:55:16,192 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-14 23:55:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-14 23:55:16,193 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-14 23:55:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 23:55:16,193 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 23:55:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 23:55:16,193 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 23:55:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-14 23:55:16,193 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-14 23:55:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 23:55:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-14 23:55:16,194 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-14 23:55:16,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 23:55:16,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 23:55:16,276 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 23:55:16,278 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 23:55:21,976 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 23:55:23,081 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 23:55:23,081 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 23:55:23,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:55:23 BoogieIcfgContainer [2022-12-14 23:55:23,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 23:55:23,086 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 23:55:23,086 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 23:55:23,092 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 23:55:23,093 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:55:23" (1/1) ... [2022-12-14 23:55:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 23:55:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 1716 states and 3377 transitions. [2022-12-14 23:55:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 3377 transitions. [2022-12-14 23:55:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:55:23,160 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:55:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1720 states and 3383 transitions. [2022-12-14 23:55:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 3383 transitions. [2022-12-14 23:55:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:55:23,433 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:55:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1721 states and 3383 transitions. [2022-12-14 23:55:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3383 transitions. [2022-12-14 23:55:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 23:55:23,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 23:55:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 1729 states and 3398 transitions. [2022-12-14 23:55:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3398 transitions. [2022-12-14 23:55:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 23:55:23,649 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:23,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 23:55:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1742 states and 3426 transitions. [2022-12-14 23:55:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3426 transitions. [2022-12-14 23:55:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 23:55:24,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:24,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 23:55:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1745 states and 3431 transitions. [2022-12-14 23:55:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3431 transitions. [2022-12-14 23:55:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 23:55:24,563 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 23:55:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1743 states and 3426 transitions. [2022-12-14 23:55:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 3426 transitions. [2022-12-14 23:55:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 23:55:24,634 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:24,796 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-14 23:55:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1755 states and 3452 transitions. [2022-12-14 23:55:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3452 transitions. [2022-12-14 23:55:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 23:55:25,685 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:25,728 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-14 23:55:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 1757 states and 3458 transitions. [2022-12-14 23:55:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3458 transitions. [2022-12-14 23:55:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 23:55:25,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 23:55:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 1754 states and 3450 transitions. [2022-12-14 23:55:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3450 transitions. [2022-12-14 23:55:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 23:55:26,018 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:26,048 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-14 23:55:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1756 states and 3453 transitions. [2022-12-14 23:55:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3453 transitions. [2022-12-14 23:55:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 23:55:26,106 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:26,135 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-14 23:55:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 1753 states and 3444 transitions. [2022-12-14 23:55:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3444 transitions. [2022-12-14 23:55:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 23:55:26,160 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:26,186 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-14 23:55:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1755 states and 3448 transitions. [2022-12-14 23:55:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3448 transitions. [2022-12-14 23:55:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 23:55:26,211 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 23:55:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1755 states and 3447 transitions. [2022-12-14 23:55:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3447 transitions. [2022-12-14 23:55:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 23:55:26,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:26,291 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-14 23:55:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 1765 states and 3465 transitions. [2022-12-14 23:55:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 3465 transitions. [2022-12-14 23:55:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 23:55:26,638 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 23:55:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 1767 states and 3468 transitions. [2022-12-14 23:55:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3468 transitions. [2022-12-14 23:55:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 23:55:26,870 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:55:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 1767 states and 3467 transitions. [2022-12-14 23:55:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3467 transitions. [2022-12-14 23:55:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 23:55:26,953 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 23:55:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 1769 states and 3470 transitions. [2022-12-14 23:55:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3470 transitions. [2022-12-14 23:55:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 23:55:27,043 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:27,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 23:55:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 1770 states and 3471 transitions. [2022-12-14 23:55:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3471 transitions. [2022-12-14 23:55:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 23:55:27,138 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:55:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1774 states and 3479 transitions. [2022-12-14 23:55:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3479 transitions. [2022-12-14 23:55:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 23:55:27,194 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:55:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 1781 states and 3495 transitions. [2022-12-14 23:55:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3495 transitions. [2022-12-14 23:55:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 23:55:27,666 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:55:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 1788 states and 3516 transitions. [2022-12-14 23:55:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 3516 transitions. [2022-12-14 23:55:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 23:55:28,566 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:55:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1790 states and 3521 transitions. [2022-12-14 23:55:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3521 transitions. [2022-12-14 23:55:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 23:55:28,737 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:55:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 1797 states and 3535 transitions. [2022-12-14 23:55:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 3535 transitions. [2022-12-14 23:55:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 23:55:29,214 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:29,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:55:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1795 states and 3529 transitions. [2022-12-14 23:55:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3529 transitions. [2022-12-14 23:55:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 23:55:29,274 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 23:55:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 1791 states and 3518 transitions. [2022-12-14 23:55:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3518 transitions. [2022-12-14 23:55:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 23:55:29,344 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:55:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 1793 states and 3522 transitions. [2022-12-14 23:55:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3522 transitions. [2022-12-14 23:55:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 23:55:29,403 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 23:55:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 1794 states and 3523 transitions. [2022-12-14 23:55:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3523 transitions. [2022-12-14 23:55:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 23:55:29,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:55:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 1799 states and 3534 transitions. [2022-12-14 23:55:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 3534 transitions. [2022-12-14 23:55:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 23:55:30,300 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:30,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 23:55:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 1802 states and 3539 transitions. [2022-12-14 23:55:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3539 transitions. [2022-12-14 23:55:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 23:55:30,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:55:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 1803 states and 3539 transitions. [2022-12-14 23:55:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3539 transitions. [2022-12-14 23:55:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 23:55:30,829 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:55:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 1818 states and 3571 transitions. [2022-12-14 23:55:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 3571 transitions. [2022-12-14 23:55:31,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 23:55:31,795 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 23:55:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 1821 states and 3577 transitions. [2022-12-14 23:55:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 3577 transitions. [2022-12-14 23:55:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 23:55:31,970 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 23:55:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1826 states and 3586 transitions. [2022-12-14 23:55:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3586 transitions. [2022-12-14 23:55:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 23:55:32,022 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 23:55:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 1826 states and 3585 transitions. [2022-12-14 23:55:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3585 transitions. [2022-12-14 23:55:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 23:55:32,746 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 23:55:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 1831 states and 3594 transitions. [2022-12-14 23:55:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 3594 transitions. [2022-12-14 23:55:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 23:55:32,949 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:55:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 1840 states and 3618 transitions. [2022-12-14 23:55:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 3618 transitions. [2022-12-14 23:55:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 23:55:33,943 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 23:55:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 1845 states and 3627 transitions. [2022-12-14 23:55:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3627 transitions. [2022-12-14 23:55:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 23:55:34,632 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 23:55:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 1848 states and 3632 transitions. [2022-12-14 23:55:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 3632 transitions. [2022-12-14 23:55:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 23:55:34,871 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 23:55:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 1866 states and 3689 transitions. [2022-12-14 23:55:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 3689 transitions. [2022-12-14 23:55:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 23:55:36,811 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 23:55:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 1871 states and 3698 transitions. [2022-12-14 23:55:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 3698 transitions. [2022-12-14 23:55:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 23:55:37,046 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:37,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 23:55:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 1876 states and 3708 transitions. [2022-12-14 23:55:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 3708 transitions. [2022-12-14 23:55:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 23:55:37,111 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 23:55:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 1885 states and 3729 transitions. [2022-12-14 23:55:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 3729 transitions. [2022-12-14 23:55:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 23:55:38,219 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 23:55:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 1890 states and 3744 transitions. [2022-12-14 23:55:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 3744 transitions. [2022-12-14 23:55:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 23:55:38,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:38,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 23:55:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 1892 states and 3746 transitions. [2022-12-14 23:55:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3746 transitions. [2022-12-14 23:55:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 23:55:38,948 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 23:55:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 1892 states and 3746 transitions. [2022-12-14 23:55:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3746 transitions. [2022-12-14 23:55:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 23:55:38,984 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 23:55:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 1897 states and 3759 transitions. [2022-12-14 23:55:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3759 transitions. [2022-12-14 23:55:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 23:55:39,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 23:55:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 23:55:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 23:55:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 1902 states and 3769 transitions. [2022-12-14 23:55:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3769 transitions. [2022-12-14 23:55:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 23:55:39,445 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 23:55:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 23:55:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:55:39,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:55:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:55:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:55:39,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 23:55:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 23:55:39,621 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2022-12-14 23:55:39,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 11:55:39 ImpRootNode [2022-12-14 23:55:39,730 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 23:55:39,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 23:55:39,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 23:55:39,731 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 23:55:39,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:55:23" (3/4) ... [2022-12-14 23:55:39,733 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 23:55:39,859 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 23:55:39,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 23:55:39,860 INFO L158 Benchmark]: Toolchain (without parser) took 26757.13ms. Allocated memory was 138.4MB in the beginning and 889.2MB in the end (delta: 750.8MB). Free memory was 69.9MB in the beginning and 364.3MB in the end (delta: -294.5MB). Peak memory consumption was 457.8MB. Max. memory is 16.1GB. [2022-12-14 23:55:39,860 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 23:55:39,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2460.61ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 69.4MB in the beginning and 75.5MB in the end (delta: -6.1MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2022-12-14 23:55:39,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 286.37ms. Allocated memory is still 209.7MB. Free memory was 75.5MB in the beginning and 70.8MB in the end (delta: 4.7MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2022-12-14 23:55:39,861 INFO L158 Benchmark]: Boogie Preprocessor took 274.68ms. Allocated memory was 209.7MB in the beginning and 262.1MB in the end (delta: 52.4MB). Free memory was 70.8MB in the beginning and 90.4MB in the end (delta: -19.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-12-14 23:55:39,861 INFO L158 Benchmark]: RCFGBuilder took 6958.63ms. Allocated memory was 262.1MB in the beginning and 740.3MB in the end (delta: 478.2MB). Free memory was 90.4MB in the beginning and 437.4MB in the end (delta: -347.1MB). Peak memory consumption was 458.6MB. Max. memory is 16.1GB. [2022-12-14 23:55:39,861 INFO L158 Benchmark]: CodeCheck took 16644.90ms. Allocated memory was 740.3MB in the beginning and 889.2MB in the end (delta: 148.9MB). Free memory was 437.4MB in the beginning and 374.8MB in the end (delta: 62.6MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. [2022-12-14 23:55:39,862 INFO L158 Benchmark]: Witness Printer took 128.10ms. Allocated memory is still 889.2MB. Free memory was 374.8MB in the beginning and 364.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 23:55:39,863 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, 1716 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 48, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20911 SdHoareTripleChecker+Valid, 21.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10569 mSDsluCounter, 25650 SdHoareTripleChecker+Invalid, 18.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16322 mSDsCounter, 6409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23563 IncrementalHoareTripleChecker+Invalid, 29972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6409 mSolverCounterUnsat, 9328 mSDtfsCounter, 23563 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29476 GetRequests, 28954 SyntacticMatches, 150 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66179 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3040 NumberOfCodeBlocks, 3040 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2900 ConstructedInterpolants, 0 QuantifiedInterpolants, 4981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 38 PerfectInterpolantSequences, 1157/1202 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11586] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11424] COND FALSE !(M_E == 0) [L11429] COND FALSE !(T1_E == 0) [L11434] COND FALSE !(E_M == 0) [L11439] COND FALSE !(E_1 == 0) [L11588] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11589] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11452] COND FALSE !(M_E == 1) [L11457] COND FALSE !(T1_E == 1) [L11462] COND FALSE !(E_M == 1) [L11467] COND FALSE !(E_1 == 1) [L11590] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, 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, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, 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, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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=0, token=0] [L11214] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, 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=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2460.61ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 69.4MB in the beginning and 75.5MB in the end (delta: -6.1MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 286.37ms. Allocated memory is still 209.7MB. Free memory was 75.5MB in the beginning and 70.8MB in the end (delta: 4.7MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 274.68ms. Allocated memory was 209.7MB in the beginning and 262.1MB in the end (delta: 52.4MB). Free memory was 70.8MB in the beginning and 90.4MB in the end (delta: -19.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * RCFGBuilder took 6958.63ms. Allocated memory was 262.1MB in the beginning and 740.3MB in the end (delta: 478.2MB). Free memory was 90.4MB in the beginning and 437.4MB in the end (delta: -347.1MB). Peak memory consumption was 458.6MB. Max. memory is 16.1GB. * CodeCheck took 16644.90ms. Allocated memory was 740.3MB in the beginning and 889.2MB in the end (delta: 148.9MB). Free memory was 437.4MB in the beginning and 374.8MB in the end (delta: 62.6MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. * Witness Printer took 128.10ms. Allocated memory is still 889.2MB. Free memory was 374.8MB in the beginning and 364.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 23:55:39,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b999ed0b-9113-4445-bd93-4696a13646b4/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