./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e66fe5eb90acc3593adc287e36d23065dfefbc6990eac560131acb70e1e7dcec --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:23:15,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:23:15,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:23:15,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:23:15,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:23:15,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:23:15,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:23:15,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:23:15,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:23:15,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:23:15,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:23:15,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:23:15,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:23:15,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:23:15,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:23:15,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:23:15,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:23:15,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:15,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:23:15,883 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer 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 -> e66fe5eb90acc3593adc287e36d23065dfefbc6990eac560131acb70e1e7dcec [2025-03-03 16:23:16,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:23:16,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:23:16,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:23:16,131 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:23:16,131 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:23:16,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c [2025-03-03 16:23:17,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166aefd09/927aaee0482b469abab28dca6847e457/FLAG35d9cdd74 [2025-03-03 16:23:17,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:23:17,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c [2025-03-03 16:23:17,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166aefd09/927aaee0482b469abab28dca6847e457/FLAG35d9cdd74 [2025-03-03 16:23:17,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166aefd09/927aaee0482b469abab28dca6847e457 [2025-03-03 16:23:17,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:23:17,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:23:17,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:17,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:23:17,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:23:17,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a36a757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17, skipping insertion in model container [2025-03-03 16:23:17,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:23:17,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c[914,927] [2025-03-03 16:23:17,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c[7125,7138] [2025-03-03 16:23:17,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:17,793 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:23:17,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c[914,927] [2025-03-03 16:23:17,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.13.cil-2.c[7125,7138] [2025-03-03 16:23:17,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:17,874 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:23:17,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17 WrapperNode [2025-03-03 16:23:17,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:17,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:17,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:23:17,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:23:17,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,923 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1069 [2025-03-03 16:23:17,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:17,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:23:17,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:23:17,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:23:17,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,957 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:23:17,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:23:17,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:23:17,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:23:17,982 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:23:17,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (1/1) ... [2025-03-03 16:23:17,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:18,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:23:18,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:23:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:23:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:23:18,028 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:23:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:23:18,028 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:23:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:23:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:23:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:23:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:23:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:23:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:23:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:23:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:23:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:23:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:23:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:23:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:23:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:23:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:23:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:23:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:23:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:23:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:23:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:23:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:23:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:23:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:23:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:23:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:23:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:23:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:23:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:23:18,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:23:18,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:23:19,047 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-03-03 16:23:19,048 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:23:19,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:23:19,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:23:19,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:19 BoogieIcfgContainer [2025-03-03 16:23:19,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:23:19,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:23:19,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:23:19,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:23:19,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:23:17" (1/3) ... [2025-03-03 16:23:19,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea27538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:19, skipping insertion in model container [2025-03-03 16:23:19,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:17" (2/3) ... [2025-03-03 16:23:19,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea27538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:19, skipping insertion in model container [2025-03-03 16:23:19,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:19" (3/3) ... [2025-03-03 16:23:19,078 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.13.cil-2.c [2025-03-03 16:23:19,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:23:19,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-2+token_ring.13.cil-2.c that has 15 procedures, 539 locations, 1 initial locations, 20 loop locations, and 2 error locations. [2025-03-03 16:23:19,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:23:19,151 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41d6bea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:23:19,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:23:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 480 states have (on average 1.5625) internal successors, (750), 487 states have internal predecessors, (750), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 16:23:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:19,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:19,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:19,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:19,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1932919131, now seen corresponding path program 1 times [2025-03-03 16:23:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167237097] [2025-03-03 16:23:19,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:19,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:19,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:19,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:19,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:19,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167237097] [2025-03-03 16:23:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167237097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225315856] [2025-03-03 16:23:19,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:19,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:19,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:19,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:19,581 INFO L87 Difference]: Start difference. First operand has 539 states, 480 states have (on average 1.5625) internal successors, (750), 487 states have internal predecessors, (750), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:20,403 INFO L93 Difference]: Finished difference Result 1155 states and 1778 transitions. [2025-03-03 16:23:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2025-03-03 16:23:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:20,416 INFO L225 Difference]: With dead ends: 1155 [2025-03-03 16:23:20,417 INFO L226 Difference]: Without dead ends: 635 [2025-03-03 16:23:20,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:20,425 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 503 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:20,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1737 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-03 16:23:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 627. [2025-03-03 16:23:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 550 states have (on average 1.5) internal successors, (825), 557 states have internal predecessors, (825), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2025-03-03 16:23:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 933 transitions. [2025-03-03 16:23:20,504 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 933 transitions. Word has length 59 [2025-03-03 16:23:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:20,505 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 933 transitions. [2025-03-03 16:23:20,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 933 transitions. [2025-03-03 16:23:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:20,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:20,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:20,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:23:20,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:20,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1307501474, now seen corresponding path program 1 times [2025-03-03 16:23:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:20,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645495168] [2025-03-03 16:23:20,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:20,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:20,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:20,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:20,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:20,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645495168] [2025-03-03 16:23:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645495168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:20,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670132564] [2025-03-03 16:23:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:20,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:20,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:20,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:20,659 INFO L87 Difference]: Start difference. First operand 627 states and 933 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:21,469 INFO L93 Difference]: Finished difference Result 952 states and 1372 transitions. [2025-03-03 16:23:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2025-03-03 16:23:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:21,474 INFO L225 Difference]: With dead ends: 952 [2025-03-03 16:23:21,474 INFO L226 Difference]: Without dead ends: 770 [2025-03-03 16:23:21,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:21,475 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 1168 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:21,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 1938 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-03 16:23:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 725. [2025-03-03 16:23:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 628 states have (on average 1.482484076433121) internal successors, (931), 637 states have internal predecessors, (931), 64 states have call successors, (64), 28 states have call predecessors, (64), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2025-03-03 16:23:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1069 transitions. [2025-03-03 16:23:21,510 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1069 transitions. Word has length 59 [2025-03-03 16:23:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:21,510 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1069 transitions. [2025-03-03 16:23:21,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1069 transitions. [2025-03-03 16:23:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:21,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:21,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:21,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:23:21,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:21,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash -393239005, now seen corresponding path program 1 times [2025-03-03 16:23:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389126993] [2025-03-03 16:23:21,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:21,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:21,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:21,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389126993] [2025-03-03 16:23:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389126993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:21,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:21,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5800739] [2025-03-03 16:23:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:21,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:21,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:21,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:21,596 INFO L87 Difference]: Start difference. First operand 725 states and 1069 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:21,638 INFO L93 Difference]: Finished difference Result 1004 states and 1449 transitions. [2025-03-03 16:23:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:21,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2025-03-03 16:23:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:21,646 INFO L225 Difference]: With dead ends: 1004 [2025-03-03 16:23:21,646 INFO L226 Difference]: Without dead ends: 730 [2025-03-03 16:23:21,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:21,648 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 0 mSDsluCounter, 3179 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:21,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3975 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-03 16:23:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2025-03-03 16:23:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 632 states have (on average 1.4762658227848102) internal successors, (933), 641 states have internal predecessors, (933), 64 states have call successors, (64), 28 states have call predecessors, (64), 32 states have return successors, (75), 64 states have call predecessors, (75), 61 states have call successors, (75) [2025-03-03 16:23:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1072 transitions. [2025-03-03 16:23:21,694 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1072 transitions. Word has length 59 [2025-03-03 16:23:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:21,694 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1072 transitions. [2025-03-03 16:23:21,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1072 transitions. [2025-03-03 16:23:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:21,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:21,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:21,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:23:21,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1891624450, now seen corresponding path program 1 times [2025-03-03 16:23:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:21,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335355320] [2025-03-03 16:23:21,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:21,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:21,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:21,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:21,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:21,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335355320] [2025-03-03 16:23:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335355320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:21,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:21,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:23:21,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781045252] [2025-03-03 16:23:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:23:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:21,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:23:21,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:23:21,789 INFO L87 Difference]: Start difference. First operand 730 states and 1072 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:22,860 INFO L93 Difference]: Finished difference Result 2012 states and 2804 transitions. [2025-03-03 16:23:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:23:22,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2025-03-03 16:23:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:22,868 INFO L225 Difference]: With dead ends: 2012 [2025-03-03 16:23:22,868 INFO L226 Difference]: Without dead ends: 1715 [2025-03-03 16:23:22,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:23:22,870 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 3420 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3434 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:22,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3434 Valid, 2115 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:23:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-03 16:23:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1648. [2025-03-03 16:23:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1364 states have (on average 1.3848973607038124) internal successors, (1889), 1388 states have internal predecessors, (1889), 152 states have call successors, (152), 111 states have call predecessors, (152), 130 states have return successors, (189), 151 states have call predecessors, (189), 149 states have call successors, (189) [2025-03-03 16:23:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2230 transitions. [2025-03-03 16:23:22,958 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2230 transitions. Word has length 59 [2025-03-03 16:23:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:22,958 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2230 transitions. [2025-03-03 16:23:22,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2230 transitions. [2025-03-03 16:23:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:22,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:22,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:23:22,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:22,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1200768059, now seen corresponding path program 1 times [2025-03-03 16:23:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:22,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907879921] [2025-03-03 16:23:22,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:22,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:22,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:22,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:22,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907879921] [2025-03-03 16:23:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907879921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11536618] [2025-03-03 16:23:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:23,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:23,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:23,044 INFO L87 Difference]: Start difference. First operand 1648 states and 2230 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:23,114 INFO L93 Difference]: Finished difference Result 2887 states and 3832 transitions. [2025-03-03 16:23:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2025-03-03 16:23:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:23,124 INFO L225 Difference]: With dead ends: 2887 [2025-03-03 16:23:23,124 INFO L226 Difference]: Without dead ends: 1678 [2025-03-03 16:23:23,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:23,127 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 0 mSDsluCounter, 3179 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:23,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3975 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-03-03 16:23:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2025-03-03 16:23:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1388 states have (on average 1.372478386167147) internal successors, (1905), 1412 states have internal predecessors, (1905), 152 states have call successors, (152), 111 states have call predecessors, (152), 136 states have return successors, (195), 157 states have call predecessors, (195), 149 states have call successors, (195) [2025-03-03 16:23:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2252 transitions. [2025-03-03 16:23:23,201 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2252 transitions. Word has length 59 [2025-03-03 16:23:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:23,202 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2252 transitions. [2025-03-03 16:23:23,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2252 transitions. [2025-03-03 16:23:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:23,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:23,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:23:23,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 43996422, now seen corresponding path program 1 times [2025-03-03 16:23:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637502859] [2025-03-03 16:23:23,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:23,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:23,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:23,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:23,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:23,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:23,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637502859] [2025-03-03 16:23:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637502859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:23,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:23,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:23,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329849935] [2025-03-03 16:23:23,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:23,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:23,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:23,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:23,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:23,329 INFO L87 Difference]: Start difference. First operand 1678 states and 2252 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:24,122 INFO L93 Difference]: Finished difference Result 2912 states and 3770 transitions. [2025-03-03 16:23:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:23:24,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2025-03-03 16:23:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:24,131 INFO L225 Difference]: With dead ends: 2912 [2025-03-03 16:23:24,131 INFO L226 Difference]: Without dead ends: 1901 [2025-03-03 16:23:24,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:23:24,134 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 1153 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:24,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1719 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-03 16:23:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1619. [2025-03-03 16:23:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1345 states have (on average 1.3702602230483272) internal successors, (1843), 1364 states have internal predecessors, (1843), 146 states have call successors, (146), 106 states have call predecessors, (146), 126 states have return successors, (180), 150 states have call predecessors, (180), 143 states have call successors, (180) [2025-03-03 16:23:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2169 transitions. [2025-03-03 16:23:24,206 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2169 transitions. Word has length 59 [2025-03-03 16:23:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:24,207 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2169 transitions. [2025-03-03 16:23:24,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2169 transitions. [2025-03-03 16:23:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:24,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:24,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:24,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:23:24,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:24,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -953075931, now seen corresponding path program 1 times [2025-03-03 16:23:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654630932] [2025-03-03 16:23:24,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:24,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:24,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:24,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:24,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:23:24,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 16:23:24,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:24,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:24,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:24,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:23:24,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 16:23:24,278 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 16:23:24,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-03 16:23:24,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 16:23:24,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:23:24,284 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:24,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:23:24,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:23:24 BoogieIcfgContainer [2025-03-03 16:23:24,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:23:24,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:23:24,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:23:24,398 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:23:24,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:19" (3/4) ... [2025-03-03 16:23:24,399 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 16:23:24,505 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 41. [2025-03-03 16:23:24,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 16:23:24,572 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 16:23:24,572 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:23:24,573 INFO L158 Benchmark]: Toolchain (without parser) took 7079.67ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 125.8MB in the beginning and 201.8MB in the end (delta: -76.0MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2025-03-03 16:23:24,573 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:23:24,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.32ms. Allocated memory is still 167.8MB. Free memory was 125.8MB in the beginning and 99.5MB in the end (delta: 26.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 16:23:24,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.82ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 95.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:23:24,573 INFO L158 Benchmark]: Boogie Preprocessor took 54.11ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 91.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:23:24,573 INFO L158 Benchmark]: IcfgBuilder took 1090.86ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 79.9MB in the end (delta: 11.2MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-03-03 16:23:24,573 INFO L158 Benchmark]: TraceAbstraction took 5324.02ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 79.0MB in the beginning and 80.1MB in the end (delta: -1.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2025-03-03 16:23:24,574 INFO L158 Benchmark]: Witness Printer took 173.89ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 80.1MB in the beginning and 201.8MB in the end (delta: -121.7MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2025-03-03 16:23:24,575 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.32ms. Allocated memory is still 167.8MB. Free memory was 125.8MB in the beginning and 99.5MB in the end (delta: 26.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.82ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 95.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.11ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 91.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1090.86ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 79.9MB in the end (delta: 11.2MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5324.02ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 79.0MB in the beginning and 80.1MB in the end (delta: -1.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Witness Printer took 173.89ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 80.1MB in the beginning and 201.8MB in the end (delta: -121.7MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int t8_pc = 0; [L509] int t9_pc = 0; [L510] int t10_pc = 0; [L511] int t11_pc = 0; [L512] int t12_pc = 0; [L513] int t13_pc = 0; [L514] int m_st ; [L515] int t1_st ; [L516] int t2_st ; [L517] int t3_st ; [L518] int t4_st ; [L519] int t5_st ; [L520] int t6_st ; [L521] int t7_st ; [L522] int t8_st ; [L523] int t9_st ; [L524] int t10_st ; [L525] int t11_st ; [L526] int t12_st ; [L527] int t13_st ; [L528] int m_i ; [L529] int t1_i ; [L530] int t2_i ; [L531] int t3_i ; [L532] int t4_i ; [L533] int t5_i ; [L534] int t6_i ; [L535] int t7_i ; [L536] int t8_i ; [L537] int t9_i ; [L538] int t10_i ; [L539] int t11_i ; [L540] int t12_i ; [L541] int t13_i ; [L542] int M_E = 2; [L543] int T1_E = 2; [L544] int T2_E = 2; [L545] int T3_E = 2; [L546] int T4_E = 2; [L547] int T5_E = 2; [L548] int T6_E = 2; [L549] int T7_E = 2; [L550] int T8_E = 2; [L551] int T9_E = 2; [L552] int T10_E = 2; [L553] int T11_E = 2; [L554] int T12_E = 2; [L555] int T13_E = 2; [L556] int E_M = 2; [L557] int E_1 = 2; [L558] int E_2 = 2; [L559] int E_3 = 2; [L560] int E_4 = 2; [L561] int E_5 = 2; [L562] int E_6 = 2; [L563] int E_7 = 2; [L564] int E_8 = 2; [L565] int E_9 = 2; [L566] int E_10 = 2; [L567] int E_11 = 2; [L568] int E_12 = 2; [L569] int E_13 = 2; [L585] int token ; [L587] int local ; VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L2462] COND TRUE __VERIFIER_nondet_int() [L2463] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] CALL update_channels1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L420] RET update_channels1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] CALL activate_threads1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L70] int __retres1 ; VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L83] __retres1 = 0 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L85] return (__retres1); VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L89] int __retres1 ; VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L102] __retres1 = 0 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L104] return (__retres1); VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L423] RET activate_threads1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L427] COND TRUE 1 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L347] COND TRUE 1 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L260] int __retres1 ; VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L276] return (__retres1); VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, \result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L367] CALL error1() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] [L28] reach_error() VAL [E_10=2, E_11=2, E_12=2, E_13=2, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_9=2, E_M=2, M_E=2, T10_E=2, T11_E=2, T12_E=2, T13_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, T9_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t10_i=0, t10_pc=0, t10_st=0, t11_i=0, t11_pc=0, t11_st=0, t12_i=0, t12_pc=0, t12_st=0, t13_i=0, t13_pc=0, t13_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, t9_i=0, t9_pc=0, t9_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 539 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6330 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6244 mSDsluCounter, 15459 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11917 mSDsCounter, 684 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5486 IncrementalHoareTripleChecker+Invalid, 6170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 684 mSolverCounterUnsat, 3542 mSDtfsCounter, 5486 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1678occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 402 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-03 16:23:24,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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