./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.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_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB --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 d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:24:56,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:24:56,392 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:24:56,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:24:56,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:24:56,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:24:56,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:24:56,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:24:56,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:24:56,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:24:56,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:24:56,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:24:56,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:24:56,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:24:56,427 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:24:56,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:24:56,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:24:56,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:24:56,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:24:56,428 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:24:56,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:24:56,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:24:56,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:56,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:56,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:56,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:56,429 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:56,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:24:56,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:24:56,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:24:56,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:24:56,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:24:56,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:24:56,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:24:56,431 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_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB 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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 [2024-11-28 03:24:56,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:24:56,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:24:56,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:24:56,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:24:56,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:24:56,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:24:59,849 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/data/1bbd8aae1/2696caf1fe9e4ecfb4b3685a9c6e7680/FLAGc211d2552 [2024-11-28 03:25:00,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:25:00,245 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:25:00,268 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/data/1bbd8aae1/2696caf1fe9e4ecfb4b3685a9c6e7680/FLAGc211d2552 [2024-11-28 03:25:00,283 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/data/1bbd8aae1/2696caf1fe9e4ecfb4b3685a9c6e7680 [2024-11-28 03:25:00,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:25:00,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:25:00,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:25:00,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:25:00,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:25:00,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:00,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1625d007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00, skipping insertion in model container [2024-11-28 03:25:00,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:00,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:25:00,559 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_37bf2775-8d71-4fae-a162-00355429b680/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-28 03:25:00,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:25:00,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:25:00,787 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_37bf2775-8d71-4fae-a162-00355429b680/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-28 03:25:00,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:25:00,919 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:25:00,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00 WrapperNode [2024-11-28 03:25:00,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:25:00,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:25:00,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:25:00,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:25:00,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:00,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:00,999 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-28 03:25:00,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:25:01,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:25:01,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:25:01,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:25:01,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,049 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-11-28 03:25:01,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:25:01,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:25:01,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:25:01,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:25:01,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (1/1) ... [2024-11-28 03:25:01,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:25:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:25:01,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:25:01,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:25:01,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:25:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:25:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 03:25:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 03:25:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 03:25:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 03:25:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 03:25:01,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 03:25:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-28 03:25:01,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-28 03:25:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:25:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:25:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:25:01,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:25:01,186 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:25:01,380 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:25:01,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:25:01,880 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:25:01,880 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:25:02,196 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:25:02,197 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:25:02,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:25:02 BoogieIcfgContainer [2024-11-28 03:25:02,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:25:02,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:25:02,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:25:02,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:25:02,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:25:00" (1/3) ... [2024-11-28 03:25:02,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72553eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:25:02, skipping insertion in model container [2024-11-28 03:25:02,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:25:00" (2/3) ... [2024-11-28 03:25:02,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72553eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:25:02, skipping insertion in model container [2024-11-28 03:25:02,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:25:02" (3/3) ... [2024-11-28 03:25:02,209 INFO L128 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2024-11-28 03:25:02,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:25:02,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i that has 5 procedures, 49 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-28 03:25:02,234 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:25:02,323 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:25:02,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-11-28 03:25:02,426 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-11-28 03:25:02,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:25:02,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-28 03:25:02,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-11-28 03:25:02,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-11-28 03:25:02,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:25:02,470 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;@6d85c54c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:25:02,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-28 03:25:02,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:25:02,476 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-28 03:25:02,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:25:02,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:02,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 03:25:02,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:02,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash 11930355, now seen corresponding path program 1 times [2024-11-28 03:25:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:02,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131838544] [2024-11-28 03:25:02,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131838544] [2024-11-28 03:25:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131838544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 03:25:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136333303] [2024-11-28 03:25:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:03,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:25:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:03,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:25:03,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:25:03,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-11-28 03:25:03,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-28 03:25:03,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:03,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-11-28 03:25:03,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:04,477 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2024-11-28 03:25:04,477 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-28 03:25:04,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28519 event pairs, 443 based on Foata normal form. 135/4200 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2024-11-28 03:25:04,529 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-11-28 03:25:04,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2024-11-28 03:25:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:25:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:25:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-28 03:25:04,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-11-28 03:25:04,556 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2024-11-28 03:25:04,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2024-11-28 03:25:04,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:25:04,570 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-11-28 03:25:04,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-28 03:25:04,578 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-28 03:25:04,581 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-11-28 03:25:04,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-28 03:25:04,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:04,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:04,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:25:04,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:04,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1457321110, now seen corresponding path program 1 times [2024-11-28 03:25:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378692168] [2024-11-28 03:25:04,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:04,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378692168] [2024-11-28 03:25:04,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378692168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:25:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193948808] [2024-11-28 03:25:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:25:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:04,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:25:04,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:25:04,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-28 03:25:04,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-11-28 03:25:04,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:04,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-28 03:25:04,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:07,152 INFO L124 PetriNetUnfolderBase]: 7779/12167 cut-off events. [2024-11-28 03:25:07,153 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-11-28 03:25:07,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23583 conditions, 12167 events. 7779/12167 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 86792 event pairs, 1033 based on Foata normal form. 400/12068 useless extension candidates. Maximal degree in co-relation 23573. Up to 5841 conditions per place. [2024-11-28 03:25:07,250 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-28 03:25:07,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 288 flow [2024-11-28 03:25:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:25:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:25:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-11-28 03:25:07,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2024-11-28 03:25:07,252 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 137 transitions. [2024-11-28 03:25:07,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 288 flow [2024-11-28 03:25:07,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:25:07,257 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-11-28 03:25:07,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-11-28 03:25:07,258 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-28 03:25:07,259 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-11-28 03:25:07,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-11-28 03:25:07,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:07,259 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] [2024-11-28 03:25:07,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:25:07,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:07,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1264106216, now seen corresponding path program 1 times [2024-11-28 03:25:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225860428] [2024-11-28 03:25:07,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225860428] [2024-11-28 03:25:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225860428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:25:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844171348] [2024-11-28 03:25:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:25:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:07,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:25:07,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:25:07,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-28 03:25:07,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-11-28 03:25:07,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:07,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-28 03:25:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:09,292 INFO L124 PetriNetUnfolderBase]: 6075/9467 cut-off events. [2024-11-28 03:25:09,292 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-11-28 03:25:09,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21251 conditions, 9467 events. 6075/9467 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 63571 event pairs, 451 based on Foata normal form. 364/9470 useless extension candidates. Maximal degree in co-relation 21239. Up to 3681 conditions per place. [2024-11-28 03:25:09,360 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 67 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-11-28 03:25:09,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 413 flow [2024-11-28 03:25:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:25:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:25:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-28 03:25:09,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-11-28 03:25:09,445 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 175 transitions. [2024-11-28 03:25:09,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 413 flow [2024-11-28 03:25:09,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 03:25:09,450 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-11-28 03:25:09,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-28 03:25:09,451 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-11-28 03:25:09,451 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-11-28 03:25:09,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-11-28 03:25:09,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:09,452 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] [2024-11-28 03:25:09,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:25:09,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:09,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1510528105, now seen corresponding path program 1 times [2024-11-28 03:25:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:09,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472380804] [2024-11-28 03:25:09,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472380804] [2024-11-28 03:25:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472380804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:09,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:25:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705469286] [2024-11-28 03:25:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:09,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:25:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:09,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:25:09,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:25:09,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-28 03:25:09,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-11-28 03:25:09,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:09,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-28 03:25:09,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:11,343 INFO L124 PetriNetUnfolderBase]: 4027/6115 cut-off events. [2024-11-28 03:25:11,344 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-11-28 03:25:11,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 6115 events. 4027/6115 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35758 event pairs, 289 based on Foata normal form. 244/6151 useless extension candidates. Maximal degree in co-relation 15551. Up to 1788 conditions per place. [2024-11-28 03:25:11,400 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 80 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-11-28 03:25:11,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 544 flow [2024-11-28 03:25:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:25:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:25:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-11-28 03:25:11,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717687074829932 [2024-11-28 03:25:11,405 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 211 transitions. [2024-11-28 03:25:11,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 544 flow [2024-11-28 03:25:11,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 514 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 03:25:11,451 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-11-28 03:25:11,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-11-28 03:25:11,453 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-11-28 03:25:11,454 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-11-28 03:25:11,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-11-28 03:25:11,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:11,454 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, 1, 1] [2024-11-28 03:25:11,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:25:11,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:11,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash 157947390, now seen corresponding path program 1 times [2024-11-28 03:25:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945198178] [2024-11-28 03:25:11,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:12,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:12,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945198178] [2024-11-28 03:25:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945198178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:12,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:12,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:25:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16774556] [2024-11-28 03:25:12,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:12,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:25:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:12,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:25:12,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:25:12,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-28 03:25:12,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-11-28 03:25:12,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:12,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-28 03:25:12,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:12,822 INFO L124 PetriNetUnfolderBase]: 2863/4163 cut-off events. [2024-11-28 03:25:12,822 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-11-28 03:25:12,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 4163 events. 2863/4163 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21805 event pairs, 231 based on Foata normal form. 96/4131 useless extension candidates. Maximal degree in co-relation 11575. Up to 1316 conditions per place. [2024-11-28 03:25:12,854 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-11-28 03:25:12,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 534 flow [2024-11-28 03:25:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:25:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:25:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-11-28 03:25:12,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-11-28 03:25:12,856 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-11-28 03:25:12,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 534 flow [2024-11-28 03:25:12,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 488 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-28 03:25:12,897 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-11-28 03:25:12,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-11-28 03:25:12,898 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-11-28 03:25:12,899 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-11-28 03:25:12,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-11-28 03:25:12,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:12,899 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:12,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:25:12,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:12,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1391379549, now seen corresponding path program 1 times [2024-11-28 03:25:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:12,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700031085] [2024-11-28 03:25:12,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:12,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700031085] [2024-11-28 03:25:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700031085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:25:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709591236] [2024-11-28 03:25:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:15,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:25:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:15,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:25:15,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:25:15,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-28 03:25:15,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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-11-28 03:25:15,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:15,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-28 03:25:15,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:18,449 INFO L124 PetriNetUnfolderBase]: 12440/18673 cut-off events. [2024-11-28 03:25:18,449 INFO L125 PetriNetUnfolderBase]: For 7396/7752 co-relation queries the response was YES. [2024-11-28 03:25:18,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43282 conditions, 18673 events. 12440/18673 cut-off events. For 7396/7752 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 126586 event pairs, 942 based on Foata normal form. 16/18069 useless extension candidates. Maximal degree in co-relation 43266. Up to 2763 conditions per place. [2024-11-28 03:25:18,608 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 117 selfloop transitions, 34 changer transitions 14/189 dead transitions. [2024-11-28 03:25:18,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 189 transitions, 900 flow [2024-11-28 03:25:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:25:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 03:25:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 342 transitions. [2024-11-28 03:25:18,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.634508348794063 [2024-11-28 03:25:18,611 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 11 states and 342 transitions. [2024-11-28 03:25:18,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 189 transitions, 900 flow [2024-11-28 03:25:18,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 189 transitions, 774 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-11-28 03:25:18,944 INFO L231 Difference]: Finished difference. Result has 76 places, 87 transitions, 418 flow [2024-11-28 03:25:18,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=418, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2024-11-28 03:25:18,945 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2024-11-28 03:25:18,945 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 87 transitions, 418 flow [2024-11-28 03:25:18,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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-11-28 03:25:18,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:18,945 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:18,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:25:18,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash 466706779, now seen corresponding path program 2 times [2024-11-28 03:25:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766101021] [2024-11-28 03:25:18,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:25:18,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:19,110 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:25:19,110 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:25:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766101021] [2024-11-28 03:25:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766101021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:25:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652062378] [2024-11-28 03:25:19,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:19,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:25:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:19,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:25:19,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:25:19,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-28 03:25:19,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 87 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-11-28 03:25:19,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:19,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-28 03:25:19,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:22,683 INFO L124 PetriNetUnfolderBase]: 16734/26400 cut-off events. [2024-11-28 03:25:22,683 INFO L125 PetriNetUnfolderBase]: For 29150/31107 co-relation queries the response was YES. [2024-11-28 03:25:22,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72128 conditions, 26400 events. 16734/26400 cut-off events. For 29150/31107 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 208121 event pairs, 3461 based on Foata normal form. 593/24878 useless extension candidates. Maximal degree in co-relation 72107. Up to 9587 conditions per place. [2024-11-28 03:25:22,853 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 52 selfloop transitions, 1 changer transitions 56/150 dead transitions. [2024-11-28 03:25:22,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 150 transitions, 912 flow [2024-11-28 03:25:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:25:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:25:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-11-28 03:25:22,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6258503401360545 [2024-11-28 03:25:22,855 INFO L175 Difference]: Start difference. First operand has 76 places, 87 transitions, 418 flow. Second operand 6 states and 184 transitions. [2024-11-28 03:25:22,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 150 transitions, 912 flow [2024-11-28 03:25:22,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 150 transitions, 906 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-28 03:25:22,996 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 369 flow [2024-11-28 03:25:22,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2024-11-28 03:25:22,997 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2024-11-28 03:25:22,997 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 369 flow [2024-11-28 03:25:22,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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-11-28 03:25:22,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:22,998 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:25:22,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -428656969, now seen corresponding path program 3 times [2024-11-28 03:25:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315063112] [2024-11-28 03:25:23,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:25:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:23,137 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:25:23,137 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:25:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315063112] [2024-11-28 03:25:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315063112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:23,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:25:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714487630] [2024-11-28 03:25:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:23,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:25:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:23,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:25:23,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:25:23,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-28 03:25:23,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-11-28 03:25:23,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:23,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-28 03:25:23,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:26,961 INFO L124 PetriNetUnfolderBase]: 14546/22953 cut-off events. [2024-11-28 03:25:26,962 INFO L125 PetriNetUnfolderBase]: For 21833/22037 co-relation queries the response was YES. [2024-11-28 03:25:27,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62778 conditions, 22953 events. 14546/22953 cut-off events. For 21833/22037 co-relation queries the response was YES. Maximal size of possible extension queue 1316. Compared 177521 event pairs, 3637 based on Foata normal form. 49/21732 useless extension candidates. Maximal degree in co-relation 62754. Up to 8669 conditions per place. [2024-11-28 03:25:27,065 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 49 selfloop transitions, 10 changer transitions 56/139 dead transitions. [2024-11-28 03:25:27,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 139 transitions, 873 flow [2024-11-28 03:25:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:25:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:25:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-11-28 03:25:27,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-11-28 03:25:27,070 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 369 flow. Second operand 6 states and 182 transitions. [2024-11-28 03:25:27,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 139 transitions, 873 flow [2024-11-28 03:25:27,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 139 transitions, 856 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-28 03:25:27,178 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 331 flow [2024-11-28 03:25:27,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2024-11-28 03:25:27,179 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2024-11-28 03:25:27,179 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 331 flow [2024-11-28 03:25:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-11-28 03:25:27,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:27,180 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:27,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:25:27,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:27,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2131511709, now seen corresponding path program 4 times [2024-11-28 03:25:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513835316] [2024-11-28 03:25:27,181 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:25:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:27,211 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:25:27,212 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:25:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:25:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513835316] [2024-11-28 03:25:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513835316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:25:27,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:25:27,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:25:27,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745759934] [2024-11-28 03:25:27,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:25:27,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:25:27,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:27,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:25:27,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:25:27,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-28 03:25:27,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-11-28 03:25:27,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:25:27,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-28 03:25:27,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:28,442 INFO L124 PetriNetUnfolderBase]: 3977/6770 cut-off events. [2024-11-28 03:25:28,442 INFO L125 PetriNetUnfolderBase]: For 4676/4869 co-relation queries the response was YES. [2024-11-28 03:25:28,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17110 conditions, 6770 events. 3977/6770 cut-off events. For 4676/4869 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 46958 event pairs, 2358 based on Foata normal form. 50/6379 useless extension candidates. Maximal degree in co-relation 17084. Up to 3042 conditions per place. [2024-11-28 03:25:28,496 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 32 selfloop transitions, 2 changer transitions 36/97 dead transitions. [2024-11-28 03:25:28,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 97 transitions, 568 flow [2024-11-28 03:25:28,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:25:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:25:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-11-28 03:25:28,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2024-11-28 03:25:28,498 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 331 flow. Second operand 6 states and 171 transitions. [2024-11-28 03:25:28,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 97 transitions, 568 flow [2024-11-28 03:25:28,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 97 transitions, 520 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-11-28 03:25:28,519 INFO L231 Difference]: Finished difference. Result has 81 places, 56 transitions, 240 flow [2024-11-28 03:25:28,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=81, PETRI_TRANSITIONS=56} [2024-11-28 03:25:28,520 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2024-11-28 03:25:28,520 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 56 transitions, 240 flow [2024-11-28 03:25:28,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-11-28 03:25:28,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:28,521 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:28,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:25:28,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 03:25:28,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:28,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2098336959, now seen corresponding path program 5 times [2024-11-28 03:25:28,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:28,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797633275] [2024-11-28 03:25:28,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:25:28,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:28,615 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:25:28,615 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 03:25:28,615 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:25:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:25:28,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:25:28,752 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:25:28,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-28 03:25:28,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-28 03:25:28,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-28 03:25:28,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-28 03:25:28,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-28 03:25:28,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-28 03:25:28,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-28 03:25:28,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:25:28,757 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-28 03:25:28,895 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:25:28,896 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:25:28,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:25:28 BasicIcfg [2024-11-28 03:25:28,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:25:28,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:25:28,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:25:28,907 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:25:28,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:25:02" (3/4) ... [2024-11-28 03:25:28,908 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:25:29,133 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-28 03:25:29,194 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:25:29,197 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:25:29,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:25:29,198 INFO L158 Benchmark]: Toolchain (without parser) took 28911.12ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 92.6MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-28 03:25:29,198 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:25:29,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.38ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 68.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:25:29,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.06ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:25:29,200 INFO L158 Benchmark]: Boogie Preprocessor took 85.51ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 62.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:25:29,200 INFO L158 Benchmark]: RCFGBuilder took 1109.38ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 62.2MB in the end (delta: 458.2kB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-28 03:25:29,201 INFO L158 Benchmark]: TraceAbstraction took 26706.19ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 61.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-28 03:25:29,201 INFO L158 Benchmark]: Witness Printer took 290.35ms. Allocated memory is still 2.6GB. Free memory was 1.5GB in the beginning and 2.1GB in the end (delta: -671.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-28 03:25:29,204 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.40ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.38ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 68.5MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.06ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.51ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 62.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1109.38ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 62.2MB in the end (delta: 458.2kB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26706.19ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 61.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 290.35ms. Allocated memory is still 2.6GB. Free memory was 1.5GB in the beginning and 2.1GB in the end (delta: -671.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t713=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t713=-3, t714=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L868] 0 pthread_t t715; [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t713=-3, t714=-2, t715=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0: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=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0: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=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713=-3, t714=-2, t715=-1, t716=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: 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: 871]: 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: 869]: 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: 867]: 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: 865]: 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 9 procedures, 83 locations, 7 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: 26.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 318 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1549 IncrementalHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 63 mSDtfsCounter, 1549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 1419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-11-28 03:25:29,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37bf2775-8d71-4fae-a162-00355429b680/bin/uautomizer-verify-aQ6SnzHsRB/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