./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1 --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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 13:34:40,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 13:34:40,778 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 13:34:40,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 13:34:40,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 13:34:40,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 13:34:40,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 13:34:40,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 13:34:40,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 13:34:40,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 13:34:40,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 13:34:40,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 13:34:40,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 13:34:40,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 13:34:40,817 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 13:34:40,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 13:34:40,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 13:34:40,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 13:34:40,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 13:34:40,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 13:34:40,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:34:40,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:34:40,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:34:40,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:34:40,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 13:34:40,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:34:40,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 13:34:40,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 13:34:40,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 13:34:40,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 13:34:40,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 13:34:40,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 13:34:40,821 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1 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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2024-12-02 13:34:41,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 13:34:41,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 13:34:41,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 13:34:41,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 13:34:41,132 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 13:34:41,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 13:34:44,561 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/data/a759fac66/f9fca16f7a0f47d7a52c86a545309954/FLAGfa95962eb [2024-12-02 13:34:44,876 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 13:34:44,876 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 13:34:44,892 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/data/a759fac66/f9fca16f7a0f47d7a52c86a545309954/FLAGfa95962eb [2024-12-02 13:34:44,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/data/a759fac66/f9fca16f7a0f47d7a52c86a545309954 [2024-12-02 13:34:44,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 13:34:44,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 13:34:44,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 13:34:44,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 13:34:44,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 13:34:44,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:34:44" (1/1) ... [2024-12-02 13:34:44,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11178e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:44, skipping insertion in model container [2024-12-02 13:34:44,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:34:44" (1/1) ... [2024-12-02 13:34:44,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 13:34:45,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2024-12-02 13:34:45,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:34:45,388 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 13:34:45,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2024-12-02 13:34:45,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 13:34:45,496 INFO L204 MainTranslator]: Completed translation [2024-12-02 13:34:45,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45 WrapperNode [2024-12-02 13:34:45,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 13:34:45,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 13:34:45,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 13:34:45,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 13:34:45,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,549 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2024-12-02 13:34:45,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 13:34:45,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 13:34:45,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 13:34:45,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 13:34:45,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,584 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 13:34:45,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 13:34:45,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 13:34:45,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 13:34:45,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 13:34:45,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (1/1) ... [2024-12-02 13:34:45,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 13:34:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 13:34:45,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 13:34:45,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 13:34:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 13:34:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 13:34:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 13:34:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 13:34:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 13:34:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 13:34:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 13:34:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 13:34:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 13:34:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 13:34:45,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 13:34:45,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 13:34:45,674 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 13:34:45,810 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 13:34:45,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 13:34:46,178 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 13:34:46,178 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 13:34:46,449 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 13:34:46,449 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 13:34:46,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:34:46 BoogieIcfgContainer [2024-12-02 13:34:46,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 13:34:46,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 13:34:46,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 13:34:46,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 13:34:46,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:34:44" (1/3) ... [2024-12-02 13:34:46,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbc6030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:34:46, skipping insertion in model container [2024-12-02 13:34:46,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:45" (2/3) ... [2024-12-02 13:34:46,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbc6030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:34:46, skipping insertion in model container [2024-12-02 13:34:46,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:34:46" (3/3) ... [2024-12-02 13:34:46,462 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 13:34:46,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 13:34:46,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-12-02 13:34:46,484 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 13:34:46,558 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 13:34:46,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-12-02 13:34:46,640 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-12-02 13:34:46,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 13:34:46,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-12-02 13:34:46,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-12-02 13:34:46,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-12-02 13:34:46,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 13:34:46,675 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;@2b8f7196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 13:34:46,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-12-02 13:34:46,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 13:34:46,682 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-12-02 13:34:46,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 13:34:46,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:46,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 13:34:46,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1470397411, now seen corresponding path program 1 times [2024-12-02 13:34:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:46,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752022809] [2024-12-02 13:34:46,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:47,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752022809] [2024-12-02 13:34:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752022809] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 13:34:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911340344] [2024-12-02 13:34:47,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:47,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 13:34:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:47,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 13:34:47,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 13:34:47,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-12-02 13:34:47,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:47,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:47,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-12-02 13:34:47,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:47,686 INFO L124 PetriNetUnfolderBase]: 580/1071 cut-off events. [2024-12-02 13:34:47,687 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-12-02 13:34:47,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 1071 events. 580/1071 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6379 event pairs, 180 based on Foata normal form. 45/1094 useless extension candidates. Maximal degree in co-relation 1990. Up to 749 conditions per place. [2024-12-02 13:34:47,700 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 26 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2024-12-02 13:34:47,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 162 flow [2024-12-02 13:34:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 13:34:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 13:34:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-12-02 13:34:47,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-12-02 13:34:47,719 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 87 transitions. [2024-12-02 13:34:47,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 162 flow [2024-12-02 13:34:47,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 13:34:47,729 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-12-02 13:34:47,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-12-02 13:34:47,736 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-12-02 13:34:47,736 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-12-02 13:34:47,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:47,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:47,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:47,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 13:34:47,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:47,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 89626333, now seen corresponding path program 1 times [2024-12-02 13:34:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208609605] [2024-12-02 13:34:47,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:47,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:47,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:47,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208609605] [2024-12-02 13:34:47,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208609605] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:47,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:47,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 13:34:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134056243] [2024-12-02 13:34:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:47,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 13:34:47,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:47,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 13:34:47,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 13:34:48,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-12-02 13:34:48,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:48,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:48,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-12-02 13:34:48,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:48,730 INFO L124 PetriNetUnfolderBase]: 1283/2289 cut-off events. [2024-12-02 13:34:48,730 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-12-02 13:34:48,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4403 conditions, 2289 events. 1283/2289 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14550 event pairs, 179 based on Foata normal form. 96/2286 useless extension candidates. Maximal degree in co-relation 4393. Up to 1025 conditions per place. [2024-12-02 13:34:48,752 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 41 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-12-02 13:34:48,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 228 flow [2024-12-02 13:34:48,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 13:34:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 13:34:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-12-02 13:34:48,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2024-12-02 13:34:48,755 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 105 transitions. [2024-12-02 13:34:48,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 228 flow [2024-12-02 13:34:48,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 13:34:48,758 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-12-02 13:34:48,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-12-02 13:34:48,759 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-12-02 13:34:48,759 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-12-02 13:34:48,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:48,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:48,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 13:34:48,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 13:34:48,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:48,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 762519901, now seen corresponding path program 1 times [2024-12-02 13:34:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:48,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616418534] [2024-12-02 13:34:48,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:49,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:49,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616418534] [2024-12-02 13:34:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616418534] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 13:34:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450677960] [2024-12-02 13:34:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:49,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 13:34:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:49,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 13:34:49,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 13:34:49,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-12-02 13:34:49,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:49,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:49,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-12-02 13:34:49,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:49,582 INFO L124 PetriNetUnfolderBase]: 875/1545 cut-off events. [2024-12-02 13:34:49,582 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2024-12-02 13:34:49,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 1545 events. 875/1545 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8509 event pairs, 95 based on Foata normal form. 80/1570 useless extension candidates. Maximal degree in co-relation 3497. Up to 465 conditions per place. [2024-12-02 13:34:49,594 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 52 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-12-02 13:34:49,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 321 flow [2024-12-02 13:34:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 13:34:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 13:34:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-12-02 13:34:49,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6820512820512821 [2024-12-02 13:34:49,596 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 133 transitions. [2024-12-02 13:34:49,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 321 flow [2024-12-02 13:34:49,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 311 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 13:34:49,600 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-12-02 13:34:49,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-12-02 13:34:49,601 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-12-02 13:34:49,601 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-12-02 13:34:49,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:49,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:49,602 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 13:34:49,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 13:34:49,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 73641871, now seen corresponding path program 1 times [2024-12-02 13:34:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315592384] [2024-12-02 13:34:49,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:49,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:49,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315592384] [2024-12-02 13:34:49,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315592384] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:49,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:49,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 13:34:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412636901] [2024-12-02 13:34:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:49,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 13:34:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:49,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 13:34:49,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 13:34:49,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-12-02 13:34:49,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:49,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:49,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-12-02 13:34:49,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:50,331 INFO L124 PetriNetUnfolderBase]: 551/925 cut-off events. [2024-12-02 13:34:50,331 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2024-12-02 13:34:50,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 925 events. 551/925 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4212 event pairs, 79 based on Foata normal form. 40/942 useless extension candidates. Maximal degree in co-relation 2403. Up to 308 conditions per place. [2024-12-02 13:34:50,338 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-12-02 13:34:50,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 328 flow [2024-12-02 13:34:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:34:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 13:34:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-12-02 13:34:50,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-12-02 13:34:50,340 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 143 transitions. [2024-12-02 13:34:50,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 328 flow [2024-12-02 13:34:50,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 303 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-12-02 13:34:50,348 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-12-02 13:34:50,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-12-02 13:34:50,348 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-12-02 13:34:50,349 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-12-02 13:34:50,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:50,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:50,349 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 13:34:50,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 13:34:50,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 865922885, now seen corresponding path program 1 times [2024-12-02 13:34:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402183714] [2024-12-02 13:34:50,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 13:34:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 13:34:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:52,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402183714] [2024-12-02 13:34:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402183714] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 13:34:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323570175] [2024-12-02 13:34:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:52,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 13:34:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:52,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 13:34:52,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-12-02 13:34:52,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-12-02 13:34:52,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:52,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:52,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-12-02 13:34:52,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:53,027 INFO L124 PetriNetUnfolderBase]: 1000/1800 cut-off events. [2024-12-02 13:34:53,028 INFO L125 PetriNetUnfolderBase]: For 770/784 co-relation queries the response was YES. [2024-12-02 13:34:53,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4220 conditions, 1800 events. 1000/1800 cut-off events. For 770/784 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10309 event pairs, 255 based on Foata normal form. 8/1757 useless extension candidates. Maximal degree in co-relation 4205. Up to 671 conditions per place. [2024-12-02 13:34:53,036 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 42 selfloop transitions, 8 changer transitions 20/86 dead transitions. [2024-12-02 13:34:53,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 408 flow [2024-12-02 13:34:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 13:34:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 13:34:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2024-12-02 13:34:53,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359 [2024-12-02 13:34:53,038 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 8 states and 175 transitions. [2024-12-02 13:34:53,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 408 flow [2024-12-02 13:34:53,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 344 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-12-02 13:34:53,047 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 155 flow [2024-12-02 13:34:53,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-12-02 13:34:53,048 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2024-12-02 13:34:53,048 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 155 flow [2024-12-02 13:34:53,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:53,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:53,049 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 13:34:53,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 13:34:53,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:53,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash 994123399, now seen corresponding path program 2 times [2024-12-02 13:34:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:53,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014816398] [2024-12-02 13:34:53,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 13:34:53,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:53,180 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 13:34:53,180 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:34:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014816398] [2024-12-02 13:34:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014816398] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 13:34:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519260388] [2024-12-02 13:34:53,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:53,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 13:34:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:53,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 13:34:53,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:34:54,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-12-02 13:34:54,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 155 flow. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:54,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:54,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-12-02 13:34:54,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:54,733 INFO L124 PetriNetUnfolderBase]: 707/1293 cut-off events. [2024-12-02 13:34:54,733 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-12-02 13:34:54,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2879 conditions, 1293 events. 707/1293 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6897 event pairs, 90 based on Foata normal form. 8/1257 useless extension candidates. Maximal degree in co-relation 2863. Up to 535 conditions per place. [2024-12-02 13:34:54,740 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 41 selfloop transitions, 15 changer transitions 21/96 dead transitions. [2024-12-02 13:34:54,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 456 flow [2024-12-02 13:34:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 13:34:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 13:34:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2024-12-02 13:34:54,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5268065268065268 [2024-12-02 13:34:54,742 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 155 flow. Second operand 11 states and 226 transitions. [2024-12-02 13:34:54,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 456 flow [2024-12-02 13:34:54,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 441 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-12-02 13:34:54,746 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 241 flow [2024-12-02 13:34:54,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-12-02 13:34:54,747 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-12-02 13:34:54,747 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 241 flow [2024-12-02 13:34:54,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:54,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:54,747 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 13:34:54,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 13:34:54,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:54,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -739532047, now seen corresponding path program 3 times [2024-12-02 13:34:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:54,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755967686] [2024-12-02 13:34:54,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 13:34:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:54,840 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 13:34:54,840 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:34:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755967686] [2024-12-02 13:34:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755967686] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 13:34:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127455261] [2024-12-02 13:34:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:55,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 13:34:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:55,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 13:34:55,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 13:34:55,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-12-02 13:34:55,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:55,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:55,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-12-02 13:34:55,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:55,663 INFO L124 PetriNetUnfolderBase]: 1057/2004 cut-off events. [2024-12-02 13:34:55,663 INFO L125 PetriNetUnfolderBase]: For 862/865 co-relation queries the response was YES. [2024-12-02 13:34:55,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4776 conditions, 2004 events. 1057/2004 cut-off events. For 862/865 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12233 event pairs, 205 based on Foata normal form. 8/1937 useless extension candidates. Maximal degree in co-relation 4756. Up to 683 conditions per place. [2024-12-02 13:34:55,673 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 28 selfloop transitions, 3 changer transitions 37/84 dead transitions. [2024-12-02 13:34:55,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 470 flow [2024-12-02 13:34:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 13:34:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 13:34:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-12-02 13:34:55,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-12-02 13:34:55,675 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 241 flow. Second operand 6 states and 130 transitions. [2024-12-02 13:34:55,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 470 flow [2024-12-02 13:34:55,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 445 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-12-02 13:34:55,681 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 143 flow [2024-12-02 13:34:55,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2024-12-02 13:34:55,682 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-12-02 13:34:55,682 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 143 flow [2024-12-02 13:34:55,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:55,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:55,682 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 13:34:55,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 13:34:55,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:55,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:55,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2017729403, now seen corresponding path program 4 times [2024-12-02 13:34:55,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:55,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615471161] [2024-12-02 13:34:55,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 13:34:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:55,755 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 13:34:55,755 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 13:34:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 13:34:58,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 13:34:58,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615471161] [2024-12-02 13:34:58,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615471161] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 13:34:58,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 13:34:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 13:34:58,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473065628] [2024-12-02 13:34:58,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 13:34:58,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 13:34:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 13:34:58,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 13:34:58,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 13:34:58,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 13:34:58,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 39 transitions, 143 flow. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:58,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 13:34:58,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 13:34:58,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 13:34:59,081 INFO L124 PetriNetUnfolderBase]: 348/704 cut-off events. [2024-12-02 13:34:59,081 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2024-12-02 13:34:59,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 704 events. 348/704 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3257 event pairs, 88 based on Foata normal form. 8/675 useless extension candidates. Maximal degree in co-relation 1545. Up to 259 conditions per place. [2024-12-02 13:34:59,085 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 25 selfloop transitions, 4 changer transitions 31/78 dead transitions. [2024-12-02 13:34:59,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 363 flow [2024-12-02 13:34:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 13:34:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 13:34:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2024-12-02 13:34:59,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5268065268065268 [2024-12-02 13:34:59,088 INFO L175 Difference]: Start difference. First operand has 67 places, 39 transitions, 143 flow. Second operand 11 states and 226 transitions. [2024-12-02 13:34:59,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 363 flow [2024-12-02 13:34:59,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 316 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-12-02 13:34:59,091 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 130 flow [2024-12-02 13:34:59,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=130, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2024-12-02 13:34:59,092 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-12-02 13:34:59,093 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 130 flow [2024-12-02 13:34:59,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 13:34:59,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 13:34:59,093 INFO L206 CegarLoopForPetriNet]: 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] [2024-12-02 13:34:59,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 13:34:59,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 13:34:59,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 13:34:59,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1725211905, now seen corresponding path program 5 times [2024-12-02 13:34:59,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 13:34:59,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637872835] [2024-12-02 13:34:59,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-02 13:34:59,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 13:34:59,193 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 13:34:59,194 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 13:34:59,194 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 13:34:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 13:34:59,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 13:34:59,313 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 13:34:59,314 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-12-02 13:34:59,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-12-02 13:34:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-12-02 13:34:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-12-02 13:34:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-12-02 13:34:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-12-02 13:34:59,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 13:34:59,317 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-12-02 13:34:59,389 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 13:34:59,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 13:34:59,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:34:59 BasicIcfg [2024-12-02 13:34:59,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 13:34:59,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 13:34:59,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 13:34:59,397 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 13:34:59,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:34:46" (3/4) ... [2024-12-02 13:34:59,398 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 13:34:59,494 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-12-02 13:34:59,549 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 13:34:59,549 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 13:34:59,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 13:34:59,550 INFO L158 Benchmark]: Toolchain (without parser) took 14636.68ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 116.1MB in the beginning and 190.9MB in the end (delta: -74.8MB). Peak memory consumption was 236.1MB. Max. memory is 16.1GB. [2024-12-02 13:34:59,551 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:34:59,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.03ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 91.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 13:34:59,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.80ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 13:34:59,552 INFO L158 Benchmark]: Boogie Preprocessor took 55.31ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 13:34:59,552 INFO L158 Benchmark]: RCFGBuilder took 844.05ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 89.8MB in the end (delta: -4.2MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2024-12-02 13:34:59,552 INFO L158 Benchmark]: TraceAbstraction took 12942.63ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 89.2MB in the beginning and 207.7MB in the end (delta: -118.5MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2024-12-02 13:34:59,553 INFO L158 Benchmark]: Witness Printer took 153.19ms. Allocated memory is still 453.0MB. Free memory was 207.7MB in the beginning and 190.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 13:34:59,554 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.35ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.03ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 91.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.80ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.31ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 844.05ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 89.8MB in the end (delta: -4.2MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12942.63ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 89.2MB in the beginning and 207.7MB in the end (delta: -118.5MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. * Witness Printer took 153.19ms. Allocated memory is still 453.0MB. Free memory was 207.7MB in the beginning and 190.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1740=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740=-1, t1741=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740=-1, t1741=0, t1742=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740=-1, t1741=0, t1742=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740=-1, t1741=0, t1742=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740=-1, t1741=0, t1742=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: 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. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 244 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1297 IncrementalHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 21 mSDtfsCounter, 1297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=6, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 2043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2024-12-02 13:34:59,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c5a1b0-586e-4bfc-be46-b7b5fbfe54df/bin/uautomizer-verify-84ZbGMXZE1/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