./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.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 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:14:02,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:14:02,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:14:02,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:14:02,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:14:02,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:14:02,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:14:02,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:14:02,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:14:02,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:14:02,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:14:02,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:14:02,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:14:02,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:14:02,348 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:14:02,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:14:02,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:14:02,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:14:02,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:14:02,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:14:02,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:14:02,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:14:02,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:14:02,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:14:02,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:14:02,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:14:02,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:14:02,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:14:02,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:14:02,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:14:02,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:14:02,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:14:02,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:14:02,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:14:02,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:14:02,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:14:02,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:14:02,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:14:02,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:14:02,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:14:02,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:14:02,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:14:02,359 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f [2024-10-14 05:14:02,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:14:02,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:14:02,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:14:02,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:14:02,658 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:14:02,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2024-10-14 05:14:04,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:14:04,250 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:14:04,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2024-10-14 05:14:04,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1ab98bf9/63628c79944a4685b3fa9523108c53dd/FLAGbbe93b549 [2024-10-14 05:14:04,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1ab98bf9/63628c79944a4685b3fa9523108c53dd [2024-10-14 05:14:04,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:14:04,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:14:04,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:14:04,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:14:04,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:14:04,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af833a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04, skipping insertion in model container [2024-10-14 05:14:04,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:14:04,531 WARN L248 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.03.cil-2.c[914,927] [2024-10-14 05:14:04,584 WARN L248 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.03.cil-2.c[7125,7138] [2024-10-14 05:14:04,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:14:04,630 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:14:04,641 WARN L248 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.03.cil-2.c[914,927] [2024-10-14 05:14:04,666 WARN L248 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.03.cil-2.c[7125,7138] [2024-10-14 05:14:04,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:14:04,725 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:14:04,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04 WrapperNode [2024-10-14 05:14:04,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:14:04,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:14:04,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:14:04,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:14:04,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,783 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 529 [2024-10-14 05:14:04,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:14:04,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:14:04,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:14:04,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:14:04,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,815 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]. [2024-10-14 05:14:04,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:14:04,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:14:04,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:14:04,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:14:04,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (1/1) ... [2024-10-14 05:14:04,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:14:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:14:04,889 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) [2024-10-14 05:14:04,895 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 [2024-10-14 05:14:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:14:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:14:04,941 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:14:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:14:04,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:14:04,943 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:14:04,943 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:14:04,943 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:14:04,944 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:14:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:14:04,944 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:14:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:14:04,944 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:14:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:14:04,944 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:14:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:14:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:14:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:14:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:14:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:14:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:14:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:14:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:14:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:14:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:14:04,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:14:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:14:04,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:14:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:14:04,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:14:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:14:04,946 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:14:05,068 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:14:05,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:14:05,671 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-14 05:14:05,671 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:14:05,729 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:14:05,730 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 05:14:05,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:14:05 BoogieIcfgContainer [2024-10-14 05:14:05,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:14:05,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:14:05,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:14:05,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:14:05,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:14:04" (1/3) ... [2024-10-14 05:14:05,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0d3b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:14:05, skipping insertion in model container [2024-10-14 05:14:05,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:14:04" (2/3) ... [2024-10-14 05:14:05,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0d3b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:14:05, skipping insertion in model container [2024-10-14 05:14:05,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:14:05" (3/3) ... [2024-10-14 05:14:05,740 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2024-10-14 05:14:05,753 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:14:05,754 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:14:05,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:14:05,827 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;@407eb0d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:14:05,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:14:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 191 states have internal predecessors, (304), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 05:14:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 05:14:05,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:05,844 INFO L215 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] [2024-10-14 05:14:05,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:05,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:05,850 INFO L85 PathProgramCache]: Analyzing trace with hash 428124607, now seen corresponding path program 1 times [2024-10-14 05:14:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488658795] [2024-10-14 05:14:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:14:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488658795] [2024-10-14 05:14:06,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488658795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:06,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:06,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:14:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659954585] [2024-10-14 05:14:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:14:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:06,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:14:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:14:06,495 INFO L87 Difference]: Start difference. First operand has 233 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 191 states have internal predecessors, (304), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:14:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:07,656 INFO L93 Difference]: Finished difference Result 576 states and 907 transitions. [2024-10-14 05:14:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:14:07,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 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 53 [2024-10-14 05:14:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:07,677 INFO L225 Difference]: With dead ends: 576 [2024-10-14 05:14:07,678 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 05:14:07,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:14:07,688 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 627 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:07,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 909 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:14:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 05:14:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 316. [2024-10-14 05:14:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 249 states have (on average 1.502008032128514) internal successors, (374), 256 states have internal predecessors, (374), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2024-10-14 05:14:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 462 transitions. [2024-10-14 05:14:07,801 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 462 transitions. Word has length 53 [2024-10-14 05:14:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:07,802 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 462 transitions. [2024-10-14 05:14:07,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:14:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 462 transitions. [2024-10-14 05:14:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 05:14:07,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:07,806 INFO L215 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] [2024-10-14 05:14:07,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:14:07,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:07,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash -952379172, now seen corresponding path program 1 times [2024-10-14 05:14:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793343869] [2024-10-14 05:14:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:14:08,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:08,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793343869] [2024-10-14 05:14:08,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793343869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:08,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:08,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:14:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623311335] [2024-10-14 05:14:08,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:08,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:14:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:14:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:14:08,030 INFO L87 Difference]: Start difference. First operand 316 states and 462 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:14:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:09,136 INFO L93 Difference]: Finished difference Result 638 states and 914 transitions. [2024-10-14 05:14:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:14:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 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 53 [2024-10-14 05:14:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:09,146 INFO L225 Difference]: With dead ends: 638 [2024-10-14 05:14:09,146 INFO L226 Difference]: Without dead ends: 475 [2024-10-14 05:14:09,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:14:09,150 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 666 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:09,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1114 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:14:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-14 05:14:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 404. [2024-10-14 05:14:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 317 states have (on average 1.4826498422712935) internal successors, (470), 326 states have internal predecessors, (470), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2024-10-14 05:14:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 588 transitions. [2024-10-14 05:14:09,210 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 588 transitions. Word has length 53 [2024-10-14 05:14:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:09,211 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 588 transitions. [2024-10-14 05:14:09,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:14:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 588 transitions. [2024-10-14 05:14:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 05:14:09,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:09,214 INFO L215 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] [2024-10-14 05:14:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:14:09,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash -528732450, now seen corresponding path program 1 times [2024-10-14 05:14:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258218387] [2024-10-14 05:14:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:14:09,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:09,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258218387] [2024-10-14 05:14:09,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258218387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:09,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:09,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:14:09,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124115061] [2024-10-14 05:14:09,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:09,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:14:09,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:09,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:14:09,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:14:09,372 INFO L87 Difference]: Start difference. First operand 404 states and 588 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:14:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:10,160 INFO L93 Difference]: Finished difference Result 679 states and 975 transitions. [2024-10-14 05:14:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:14:10,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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 53 [2024-10-14 05:14:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:10,166 INFO L225 Difference]: With dead ends: 679 [2024-10-14 05:14:10,167 INFO L226 Difference]: Without dead ends: 434 [2024-10-14 05:14:10,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:14:10,170 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 397 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:10,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1081 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:14:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-14 05:14:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 408. [2024-10-14 05:14:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 320 states have (on average 1.471875) internal successors, (471), 329 states have internal predecessors, (471), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2024-10-14 05:14:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 590 transitions. [2024-10-14 05:14:10,218 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 590 transitions. Word has length 53 [2024-10-14 05:14:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:10,218 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 590 transitions. [2024-10-14 05:14:10,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:14:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 590 transitions. [2024-10-14 05:14:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 05:14:10,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:10,224 INFO L215 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] [2024-10-14 05:14:10,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:14:10,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:10,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash 857470944, now seen corresponding path program 1 times [2024-10-14 05:14:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:10,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141024522] [2024-10-14 05:14:10,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:10,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:14:10,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141024522] [2024-10-14 05:14:10,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141024522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:10,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:14:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641535218] [2024-10-14 05:14:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:10,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:14:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:10,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:14:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:14:10,370 INFO L87 Difference]: Start difference. First operand 408 states and 590 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:14:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:11,179 INFO L93 Difference]: Finished difference Result 697 states and 993 transitions. [2024-10-14 05:14:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:14:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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 53 [2024-10-14 05:14:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:11,183 INFO L225 Difference]: With dead ends: 697 [2024-10-14 05:14:11,184 INFO L226 Difference]: Without dead ends: 448 [2024-10-14 05:14:11,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:14:11,187 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 403 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:11,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1079 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:14:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-14 05:14:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 420. [2024-10-14 05:14:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 329 states have (on average 1.458966565349544) internal successors, (480), 338 states have internal predecessors, (480), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2024-10-14 05:14:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 602 transitions. [2024-10-14 05:14:11,215 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 602 transitions. Word has length 53 [2024-10-14 05:14:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:11,216 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 602 transitions. [2024-10-14 05:14:11,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:14:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 602 transitions. [2024-10-14 05:14:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 05:14:11,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:11,218 INFO L215 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] [2024-10-14 05:14:11,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:14:11,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:11,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1280172770, now seen corresponding path program 1 times [2024-10-14 05:14:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:11,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624321373] [2024-10-14 05:14:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:11,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:14:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:14:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:14:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:14:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:14:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:14:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:14:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:14:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:14:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:14:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624321373] [2024-10-14 05:14:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624321373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:14:11,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:14:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:14:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296108807] [2024-10-14 05:14:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:14:11,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:14:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:14:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:14:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:14:11,399 INFO L87 Difference]: Start difference. First operand 420 states and 602 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:14:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:14:12,349 INFO L93 Difference]: Finished difference Result 778 states and 1079 transitions. [2024-10-14 05:14:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:14:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 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 53 [2024-10-14 05:14:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:14:12,353 INFO L225 Difference]: With dead ends: 778 [2024-10-14 05:14:12,353 INFO L226 Difference]: Without dead ends: 519 [2024-10-14 05:14:12,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:14:12,355 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 673 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:14:12,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 914 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:14:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-10-14 05:14:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 430. [2024-10-14 05:14:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 337 states have (on average 1.4480712166172107) internal successors, (488), 346 states have internal predecessors, (488), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2024-10-14 05:14:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 610 transitions. [2024-10-14 05:14:12,394 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 610 transitions. Word has length 53 [2024-10-14 05:14:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:14:12,395 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 610 transitions. [2024-10-14 05:14:12,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:14:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 610 transitions. [2024-10-14 05:14:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 05:14:12,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:14:12,396 INFO L215 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] [2024-10-14 05:14:12,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:14:12,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:14:12,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:14:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 259104416, now seen corresponding path program 1 times [2024-10-14 05:14:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:14:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395241561] [2024-10-14 05:14:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:14:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:14:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:14:12,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 05:14:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:14:12,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 05:14:12,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 05:14:12,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-14 05:14:12,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-14 05:14:12,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:14:12,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 05:14:12,569 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 05:14:12,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:14:12 BoogieIcfgContainer [2024-10-14 05:14:12,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 05:14:12,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 05:14:12,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 05:14:12,577 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 05:14:12,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:14:05" (3/4) ... [2024-10-14 05:14:12,579 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 05:14:12,655 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 05:14:12,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 05:14:12,656 INFO L158 Benchmark]: Toolchain (without parser) took 8375.96ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 89.8MB in the beginning and 74.6MB in the end (delta: 15.2MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-10-14 05:14:12,657 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:14:12,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.72ms. Allocated memory is still 157.3MB. Free memory was 89.8MB in the beginning and 116.4MB in the end (delta: -26.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 05:14:12,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.11ms. Allocated memory is still 157.3MB. Free memory was 116.4MB in the beginning and 112.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 05:14:12,658 INFO L158 Benchmark]: Boogie Preprocessor took 56.98ms. Allocated memory is still 157.3MB. Free memory was 112.9MB in the beginning and 109.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 05:14:12,658 INFO L158 Benchmark]: RCFGBuilder took 888.40ms. Allocated memory is still 157.3MB. Free memory was 109.5MB in the beginning and 66.1MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-14 05:14:12,658 INFO L158 Benchmark]: TraceAbstraction took 6842.18ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 65.5MB in the beginning and 85.1MB in the end (delta: -19.7MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-10-14 05:14:12,658 INFO L158 Benchmark]: Witness Printer took 79.05ms. Allocated memory is still 232.8MB. Free memory was 85.1MB in the beginning and 74.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 05:14:12,660 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.17ms. Allocated memory is still 157.3MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.72ms. Allocated memory is still 157.3MB. Free memory was 89.8MB in the beginning and 116.4MB in the end (delta: -26.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.11ms. Allocated memory is still 157.3MB. Free memory was 116.4MB in the beginning and 112.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.98ms. Allocated memory is still 157.3MB. Free memory was 112.9MB in the beginning and 109.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 888.40ms. Allocated memory is still 157.3MB. Free memory was 109.5MB in the beginning and 66.1MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6842.18ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 65.5MB in the beginning and 85.1MB in the end (delta: -19.7MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Witness Printer took 79.05ms. Allocated memory is still 232.8MB. Free memory was 85.1MB in the beginning and 74.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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 m_st ; [L505] int t1_st ; [L506] int t2_st ; [L507] int t3_st ; [L508] int m_i ; [L509] int t1_i ; [L510] int t2_i ; [L511] int t3_i ; [L512] int M_E = 2; [L513] int T1_E = 2; [L514] int T2_E = 2; [L515] int T3_E = 2; [L516] int E_M = 2; [L517] int E_1 = 2; [L518] int E_2 = 2; [L519] int E_3 = 2; [L525] int token ; [L527] int local ; [L1212] COND TRUE __VERIFIER_nondet_int() [L1213] 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 [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L85] return (__retres1); [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L104] return (__retres1); [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L427] COND TRUE 1 [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L276] return (__retres1); [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, 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, 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, 233 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2817 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2766 mSDsluCounter, 5097 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4107 mSDsCounter, 592 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5132 IncrementalHoareTripleChecker+Invalid, 5724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 592 mSolverCounterUnsat, 990 mSDtfsCounter, 5132 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=5, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 252 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-14 05:14:12,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE