./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.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 c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:22:51,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:22:51,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:22:51,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:22:51,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:22:51,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:22:51,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:22:51,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:22:51,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:22:51,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:22:51,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:22:51,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:22:51,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:22:51,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:22:51,406 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:22:51,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:22:51,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:22:51,406 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:22:51,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:22:51,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:51,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:22:51,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:22:51,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:22:51,409 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2025-03-03 16:22:51,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:22:51,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:22:51,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:22:51,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:22:51,659 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:22:51,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2025-03-03 16:22:52,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f232e6ef/3b18eaef5fa5427aaa2da49dce613331/FLAG8fe8e7555 [2025-03-03 16:22:53,142 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:22:53,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2025-03-03 16:22:53,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f232e6ef/3b18eaef5fa5427aaa2da49dce613331/FLAG8fe8e7555 [2025-03-03 16:22:53,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f232e6ef/3b18eaef5fa5427aaa2da49dce613331 [2025-03-03 16:22:53,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:22:53,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:22:53,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:53,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:22:53,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:22:53,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb82fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53, skipping insertion in model container [2025-03-03 16:22:53,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:22:53,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2025-03-03 16:22:53,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2025-03-03 16:22:53,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:53,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:22:53,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2025-03-03 16:22:53,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2025-03-03 16:22:53,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:53,742 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:22:53,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53 WrapperNode [2025-03-03 16:22:53,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:53,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:53,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:22:53,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:22:53,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,789 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 442 [2025-03-03 16:22:53,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:53,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:22:53,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:22:53,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:22:53,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,814 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:22:53,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:22:53,824 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:22:53,824 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:22:53,824 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:22:53,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (1/1) ... [2025-03-03 16:22:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:53,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:22:53,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:22:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:22:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:22:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:22:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:22:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:22:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:22:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:22:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:22:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:22:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:22:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:22:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:22:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:22:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:22:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:22:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:22:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:22:53,875 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:22:53,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:22:53,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:22:54,337 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-03 16:22:54,337 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:22:54,349 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:22:54,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:22:54,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:54 BoogieIcfgContainer [2025-03-03 16:22:54,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:22:54,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:22:54,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:22:54,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:22:54,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:22:53" (1/3) ... [2025-03-03 16:22:54,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc6f4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:54, skipping insertion in model container [2025-03-03 16:22:54,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:53" (2/3) ... [2025-03-03 16:22:54,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc6f4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:54, skipping insertion in model container [2025-03-03 16:22:54,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:54" (3/3) ... [2025-03-03 16:22:54,360 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2025-03-03 16:22:54,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:22:54,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c that has 15 procedures, 242 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 16:22:54,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:22:54,428 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;@161cb657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:22:54,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:22:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 194 states have (on average 1.4845360824742269) internal successors, (288), 201 states have internal predecessors, (288), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 16:22:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:22:54,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:54,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:54,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 354549103, now seen corresponding path program 1 times [2025-03-03 16:22:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899961156] [2025-03-03 16:22:54,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:54,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:54,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:54,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899961156] [2025-03-03 16:22:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899961156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:54,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078560332] [2025-03-03 16:22:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:54,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:54,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:54,851 INFO L87 Difference]: Start difference. First operand has 242 states, 194 states have (on average 1.4845360824742269) internal successors, (288), 201 states have internal predecessors, (288), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:55,321 INFO L93 Difference]: Finished difference Result 572 states and 832 transitions. [2025-03-03 16:22:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:55,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2025-03-03 16:22:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:55,332 INFO L225 Difference]: With dead ends: 572 [2025-03-03 16:22:55,333 INFO L226 Difference]: Without dead ends: 338 [2025-03-03 16:22:55,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:55,342 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 283 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:55,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 780 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-03 16:22:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2025-03-03 16:22:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 264 states have (on average 1.4166666666666667) internal successors, (374), 271 states have internal predecessors, (374), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2025-03-03 16:22:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 460 transitions. [2025-03-03 16:22:55,391 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 460 transitions. Word has length 59 [2025-03-03 16:22:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:55,392 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 460 transitions. [2025-03-03 16:22:55,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 460 transitions. [2025-03-03 16:22:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:22:55,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:55,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:55,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:22:55,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:55,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash -699997588, now seen corresponding path program 1 times [2025-03-03 16:22:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775133105] [2025-03-03 16:22:55,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:55,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:55,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:55,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:55,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775133105] [2025-03-03 16:22:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775133105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463162619] [2025-03-03 16:22:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:55,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:55,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:55,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:55,586 INFO L87 Difference]: Start difference. First operand 330 states and 460 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:56,076 INFO L93 Difference]: Finished difference Result 655 states and 899 transitions. [2025-03-03 16:22:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2025-03-03 16:22:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:56,081 INFO L225 Difference]: With dead ends: 655 [2025-03-03 16:22:56,084 INFO L226 Difference]: Without dead ends: 473 [2025-03-03 16:22:56,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:56,086 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 486 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:56,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1003 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-03 16:22:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 428. [2025-03-03 16:22:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 342 states have (on average 1.4035087719298245) internal successors, (480), 351 states have internal predecessors, (480), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (63), 52 states have call predecessors, (63), 50 states have call successors, (63) [2025-03-03 16:22:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 596 transitions. [2025-03-03 16:22:56,146 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 596 transitions. Word has length 59 [2025-03-03 16:22:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:56,146 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 596 transitions. [2025-03-03 16:22:56,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 596 transitions. [2025-03-03 16:22:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:22:56,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:56,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:56,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:22:56,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:56,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1894229229, now seen corresponding path program 1 times [2025-03-03 16:22:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477455407] [2025-03-03 16:22:56,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:56,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:56,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:56,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:56,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:56,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477455407] [2025-03-03 16:22:56,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477455407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:56,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:56,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997695158] [2025-03-03 16:22:56,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:56,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:56,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:56,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:56,240 INFO L87 Difference]: Start difference. First operand 428 states and 596 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:56,277 INFO L93 Difference]: Finished difference Result 707 states and 976 transitions. [2025-03-03 16:22:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:56,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2025-03-03 16:22:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:56,280 INFO L225 Difference]: With dead ends: 707 [2025-03-03 16:22:56,280 INFO L226 Difference]: Without dead ends: 433 [2025-03-03 16:22:56,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:56,281 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:56,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1610 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-03 16:22:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-03-03 16:22:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 346 states have (on average 1.393063583815029) internal successors, (482), 355 states have internal predecessors, (482), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (64), 53 states have call predecessors, (64), 50 states have call successors, (64) [2025-03-03 16:22:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 599 transitions. [2025-03-03 16:22:56,313 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 599 transitions. Word has length 59 [2025-03-03 16:22:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 599 transitions. [2025-03-03 16:22:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 599 transitions. [2025-03-03 16:22:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:22:56,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:56,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:56,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:22:56,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:56,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -115874612, now seen corresponding path program 1 times [2025-03-03 16:22:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:56,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358619306] [2025-03-03 16:22:56,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:56,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:56,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:56,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:56,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:56,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358619306] [2025-03-03 16:22:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358619306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:22:56,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970816964] [2025-03-03 16:22:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:56,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:22:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:56,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:22:56,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:22:56,426 INFO L87 Difference]: Start difference. First operand 433 states and 599 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:57,277 INFO L93 Difference]: Finished difference Result 1715 states and 2331 transitions. [2025-03-03 16:22:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:22:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2025-03-03 16:22:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:57,284 INFO L225 Difference]: With dead ends: 1715 [2025-03-03 16:22:57,284 INFO L226 Difference]: Without dead ends: 1418 [2025-03-03 16:22:57,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:22:57,286 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1627 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:57,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 1180 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-03-03 16:22:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1351. [2025-03-03 16:22:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1078 states have (on average 1.3339517625231911) internal successors, (1438), 1102 states have internal predecessors, (1438), 141 states have call successors, (141), 111 states have call predecessors, (141), 130 states have return successors, (178), 140 states have call predecessors, (178), 138 states have call successors, (178) [2025-03-03 16:22:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1757 transitions. [2025-03-03 16:22:57,363 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1757 transitions. Word has length 59 [2025-03-03 16:22:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:57,363 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1757 transitions. [2025-03-03 16:22:57,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1757 transitions. [2025-03-03 16:22:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:22:57,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:57,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:57,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:22:57,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:57,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1086700175, now seen corresponding path program 1 times [2025-03-03 16:22:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:57,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9121803] [2025-03-03 16:22:57,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:57,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9121803] [2025-03-03 16:22:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9121803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:57,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010559808] [2025-03-03 16:22:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:57,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:57,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:57,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:57,450 INFO L87 Difference]: Start difference. First operand 1351 states and 1757 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:57,510 INFO L93 Difference]: Finished difference Result 2590 states and 3359 transitions. [2025-03-03 16:22:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:57,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2025-03-03 16:22:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:57,517 INFO L225 Difference]: With dead ends: 2590 [2025-03-03 16:22:57,517 INFO L226 Difference]: Without dead ends: 1381 [2025-03-03 16:22:57,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:57,521 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:57,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1610 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-03 16:22:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-03-03 16:22:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1102 states have (on average 1.3194192377495462) internal successors, (1454), 1126 states have internal predecessors, (1454), 141 states have call successors, (141), 111 states have call predecessors, (141), 136 states have return successors, (184), 146 states have call predecessors, (184), 138 states have call successors, (184) [2025-03-03 16:22:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1779 transitions. [2025-03-03 16:22:57,616 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1779 transitions. Word has length 59 [2025-03-03 16:22:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:57,617 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1779 transitions. [2025-03-03 16:22:57,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1779 transitions. [2025-03-03 16:22:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:22:57,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:57,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:22:57,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:57,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1963502640, now seen corresponding path program 1 times [2025-03-03 16:22:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823742921] [2025-03-03 16:22:57,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:57,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:57,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:57,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:57,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823742921] [2025-03-03 16:22:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823742921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:57,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:57,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99570231] [2025-03-03 16:22:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:57,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:57,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:57,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:57,752 INFO L87 Difference]: Start difference. First operand 1381 states and 1779 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:58,232 INFO L93 Difference]: Finished difference Result 2615 states and 3297 transitions. [2025-03-03 16:22:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:22:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2025-03-03 16:22:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:58,240 INFO L225 Difference]: With dead ends: 2615 [2025-03-03 16:22:58,240 INFO L226 Difference]: Without dead ends: 1604 [2025-03-03 16:22:58,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:22:58,243 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 471 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:58,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 784 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2025-03-03 16:22:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1322. [2025-03-03 16:22:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1059 states have (on average 1.3144475920679888) internal successors, (1392), 1078 states have internal predecessors, (1392), 135 states have call successors, (135), 106 states have call predecessors, (135), 126 states have return successors, (169), 139 states have call predecessors, (169), 132 states have call successors, (169) [2025-03-03 16:22:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1696 transitions. [2025-03-03 16:22:58,326 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1696 transitions. Word has length 59 [2025-03-03 16:22:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:58,326 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1696 transitions. [2025-03-03 16:22:58,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1696 transitions. [2025-03-03 16:22:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:22:58,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:58,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:58,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:22:58,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:58,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1334392303, now seen corresponding path program 1 times [2025-03-03 16:22:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:58,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673842913] [2025-03-03 16:22:58,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:58,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:58,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:58,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:58,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:22:58,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 16:22:58,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:22:58,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:22:58,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:58,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:22:58,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 16:22:58,370 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 16:22:58,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-03 16:22:58,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 16:22:58,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:22:58,374 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:58,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:22:58,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:22:58 BoogieIcfgContainer [2025-03-03 16:22:58,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:22:58,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:22:58,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:22:58,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:22:58,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:54" (3/4) ... [2025-03-03 16:22:58,445 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 16:22:58,504 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 41. [2025-03-03 16:22:58,552 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 16:22:58,552 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 16:22:58,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:22:58,553 INFO L158 Benchmark]: Toolchain (without parser) took 5123.01ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.7MB in the beginning and 103.7MB in the end (delta: 8.0MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2025-03-03 16:22:58,553 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:22:58,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.97ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 94.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 16:22:58,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.48ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:22:58,553 INFO L158 Benchmark]: Boogie Preprocessor took 33.17ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:22:58,553 INFO L158 Benchmark]: IcfgBuilder took 525.90ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 56.8MB in the end (delta: 32.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 16:22:58,553 INFO L158 Benchmark]: TraceAbstraction took 4091.46ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 118.8MB in the end (delta: -62.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:22:58,554 INFO L158 Benchmark]: Witness Printer took 108.69ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 103.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 16:22:58,555 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.97ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 94.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.48ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.17ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 525.90ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 56.8MB in the end (delta: 32.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4091.46ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 56.3MB in the beginning and 118.8MB in the end (delta: -62.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 108.69ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 103.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [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_M=2, M_E=2, T1_E=2, T2_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, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, 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_M=2, M_E=2, T1_E=2, T2_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, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L85] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L104] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [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_M=2, M_E=2, T1_E=2, T2_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, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, 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_M=2, M_E=2, T1_E=2, T2_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, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, 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, 242 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2931 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2867 mSDsluCounter, 6967 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5350 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2835 IncrementalHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 1617 mSDtfsCounter, 2835 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1381occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 402 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-03 16:22:58,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE