./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC --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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:41:33,813 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:41:33,967 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-24 00:41:33,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:41:33,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:41:34,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:41:34,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:41:34,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:41:34,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:41:34,015 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:41:34,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 00:41:34,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 00:41:34,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:41:34,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:41:34,016 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:41:34,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:41:34,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-24 00:41:34,017 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:41:34,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 00:41:34,018 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:41:34,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:41:34,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-24 00:41:34,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 00:41:34,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-24 00:41:34,019 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:41:34,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-24 00:41:34,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:41:34,019 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:41:34,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 00:41:34,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:41:34,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:41:34,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:41:34,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:41:34,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:41:34,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:41:34,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:41:34,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:41:34,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:41:34,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:41:34,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 00:41:34,022 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-24 00:41:34,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-24 00:41:34,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 00:41:34,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 00:41:34,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 00:41:34,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 00:41:34,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 00:41:34,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 00:41:34,023 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_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC
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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd
[2024-11-24 00:41:34,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:41:34,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:41:34,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:41:34,428 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:41:34,428 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:41:34,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i
[2024-11-24 00:41:38,241 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/data/3a4e99e9b/c6480e244b464a319dd4570341167fde/FLAG9e8ac9109
[2024-11-24 00:41:38,797 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:41:38,798 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i
[2024-11-24 00:41:38,818 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/data/3a4e99e9b/c6480e244b464a319dd4570341167fde/FLAG9e8ac9109
[2024-11-24 00:41:38,838 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/data/3a4e99e9b/c6480e244b464a319dd4570341167fde
[2024-11-24 00:41:38,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:41:38,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:41:38,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:41:38,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:41:38,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:41:38,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:41:38" (1/1) ...
[2024-11-24 00:41:38,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d04b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:38, skipping insertion in model container
[2024-11-24 00:41:38,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:41:38" (1/1) ...
[2024-11-24 00:41:38,904 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:41:39,231 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_3724cd5c-7ab9-424a-9694-8d1235884d6f/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977]
[2024-11-24 00:41:39,565 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:41:39,579 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:41:39,598 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_3724cd5c-7ab9-424a-9694-8d1235884d6f/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977]
[2024-11-24 00:41:39,665 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:41:39,711 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:41:39,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39 WrapperNode
[2024-11-24 00:41:39,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:41:39,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:41:39,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:41:39,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:41:39,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,784 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127
[2024-11-24 00:41:39,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:41:39,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:41:39,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:41:39,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:41:39,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,852 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-24 00:41:39,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:41:39,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:41:39,902 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:41:39,902 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:41:39,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (1/1) ...
[2024-11-24 00:41:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:41:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:41:39,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 00:41:39,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:41:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 00:41:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:41:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 00:41:40,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 00:41:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 00:41:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 00:41:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 00:41:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 00:41:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2024-11-24 00:41:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2024-11-24 00:41:40,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 00:41:40,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 00:41:40,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:41:40,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:41:40,005 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 00:41:40,181 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:41:40,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:41:40,663 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 00:41:40,663 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:41:41,006 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:41:41,007 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 00:41:41,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:41:41 BoogieIcfgContainer
[2024-11-24 00:41:41,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:41:41,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 00:41:41,011 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 00:41:41,018 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 00:41:41,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:41:38" (1/3) ...
[2024-11-24 00:41:41,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a666e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:41:41, skipping insertion in model container
[2024-11-24 00:41:41,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:41:39" (2/3) ...
[2024-11-24 00:41:41,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a666e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:41:41, skipping insertion in model container
[2024-11-24 00:41:41,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:41:41" (3/3) ...
[2024-11-24 00:41:41,022 INFO L128 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i
[2024-11-24 00:41:41,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 00:41:41,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_pso.opt_rmo.opt_tso.opt.i that has 5 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2024-11-24 00:41:41,047 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 00:41:41,123 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 00:41:41,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow
[2024-11-24 00:41:41,270 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events.
[2024-11-24 00:41:41,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:41:41,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place.
[2024-11-24 00:41:41,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow
[2024-11-24 00:41:41,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow
[2024-11-24 00:41:41,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 00:41:41,329 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;@154dc30c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 00:41:41,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-24 00:41:41,356 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 00:41:41,357 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events.
[2024-11-24 00:41:41,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:41:41,357 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:41,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:41:41,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:41,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 753619468, now seen corresponding path program 1 times
[2024-11-24 00:41:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:41,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515255685]
[2024-11-24 00:41:41,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:41:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:41:42,247 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-24 00:41:42,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:42,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515255685]
[2024-11-24 00:41:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515255685] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:42,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:42,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 00:41:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509189901]
[2024-11-24 00:41:42,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:42,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 00:41:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:42,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 00:41:42,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 00:41:42,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 48
[2024-11-24 00:41:42,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-24 00:41:42,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:42,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 48
[2024-11-24 00:41:42,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:42,949 INFO L124 PetriNetUnfolderBase]: 699/1271 cut-off events.
[2024-11-24 00:41:42,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 00:41:42,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1271 events. 699/1271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8745 event pairs, 159 based on Foata normal form. 48/1270 useless extension candidates. Maximal degree in co-relation 2327. Up to 757 conditions per place.
[2024-11-24 00:41:42,980 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 25 selfloop transitions, 2 changer transitions 2/51 dead transitions.
[2024-11-24 00:41:42,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 172 flow
[2024-11-24 00:41:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 00:41:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 00:41:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions.
[2024-11-24 00:41:43,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888
[2024-11-24 00:41:43,008 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 110 transitions.
[2024-11-24 00:41:43,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 172 flow
[2024-11-24 00:41:43,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-24 00:41:43,026 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow
[2024-11-24 00:41:43,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, 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=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41}
[2024-11-24 00:41:43,037 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places.
[2024-11-24 00:41:43,039 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow
[2024-11-24 00:41:43,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-24 00:41:43,040 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:43,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:41:43,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 00:41:43,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:43,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -879168094, now seen corresponding path program 1 times
[2024-11-24 00:41:43,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:43,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406562933]
[2024-11-24 00:41:43,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:41:43,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:41:43,475 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-24 00:41:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406562933]
[2024-11-24 00:41:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406562933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:41:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011263945]
[2024-11-24 00:41:43,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:43,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:41:43,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:43,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:41:43,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:41:43,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48
[2024-11-24 00:41:43,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-24 00:41:43,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:43,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48
[2024-11-24 00:41:43,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:45,082 INFO L124 PetriNetUnfolderBase]: 3362/5406 cut-off events.
[2024-11-24 00:41:45,083 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES.
[2024-11-24 00:41:45,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10447 conditions, 5406 events. 3362/5406 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 37886 event pairs, 536 based on Foata normal form. 180/5399 useless extension candidates. Maximal degree in co-relation 10437. Up to 2677 conditions per place.
[2024-11-24 00:41:45,164 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 43 selfloop transitions, 6 changer transitions 1/67 dead transitions.
[2024-11-24 00:41:45,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 256 flow
[2024-11-24 00:41:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:41:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 00:41:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions.
[2024-11-24 00:41:45,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334
[2024-11-24 00:41:45,168 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 4 states and 136 transitions.
[2024-11-24 00:41:45,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 256 flow
[2024-11-24 00:41:45,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 00:41:45,176 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 132 flow
[2024-11-24 00:41:45,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=45}
[2024-11-24 00:41:45,179 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places.
[2024-11-24 00:41:45,179 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 132 flow
[2024-11-24 00:41:45,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-24 00:41:45,180 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:45,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]
[2024-11-24 00:41:45,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 00:41:45,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1810141972, now seen corresponding path program 1 times
[2024-11-24 00:41:45,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:45,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14914290]
[2024-11-24 00:41:45,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:41:45,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:41:45,717 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-24 00:41:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14914290]
[2024-11-24 00:41:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14914290] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 00:41:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207544410]
[2024-11-24 00:41:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:45,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 00:41:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:45,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 00:41:45,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:41:45,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48
[2024-11-24 00:41:45,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-24 00:41:45,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:45,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48
[2024-11-24 00:41:45,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:46,979 INFO L124 PetriNetUnfolderBase]: 2896/4662 cut-off events.
[2024-11-24 00:41:46,980 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES.
[2024-11-24 00:41:47,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10661 conditions, 4662 events. 2896/4662 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 31315 event pairs, 192 based on Foata normal form. 174/4683 useless extension candidates. Maximal degree in co-relation 10649. Up to 2065 conditions per place.
[2024-11-24 00:41:47,039 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 55 selfloop transitions, 10 changer transitions 1/83 dead transitions.
[2024-11-24 00:41:47,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 369 flow
[2024-11-24 00:41:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 00:41:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 00:41:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions.
[2024-11-24 00:41:47,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7208333333333333
[2024-11-24 00:41:47,042 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 132 flow. Second operand 5 states and 173 transitions.
[2024-11-24 00:41:47,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 369 flow
[2024-11-24 00:41:47,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-24 00:41:47,052 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 184 flow
[2024-11-24 00:41:47,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=49}
[2024-11-24 00:41:47,055 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places.
[2024-11-24 00:41:47,055 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 184 flow
[2024-11-24 00:41:47,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-24 00:41:47,056 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:47,056 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-24 00:41:47,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 00:41:47,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1649521380, now seen corresponding path program 1 times
[2024-11-24 00:41:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665019680]
[2024-11-24 00:41:47,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:41:47,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:41:47,453 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-24 00:41:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665019680]
[2024-11-24 00:41:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665019680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:47,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 00:41:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964649326]
[2024-11-24 00:41:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:41:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:47,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:41:47,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:41:47,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48
[2024-11-24 00:41:47,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-24 00:41:47,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:47,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48
[2024-11-24 00:41:47,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:48,406 INFO L124 PetriNetUnfolderBase]: 2029/3217 cut-off events.
[2024-11-24 00:41:48,406 INFO L125 PetriNetUnfolderBase]: For 2626/2626 co-relation queries the response was YES.
[2024-11-24 00:41:48,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8411 conditions, 3217 events. 2029/3217 cut-off events. For 2626/2626 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 18985 event pairs, 69 based on Foata normal form. 140/3272 useless extension candidates. Maximal degree in co-relation 8397. Up to 977 conditions per place.
[2024-11-24 00:41:48,442 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 65 selfloop transitions, 14 changer transitions 1/97 dead transitions.
[2024-11-24 00:41:48,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 488 flow
[2024-11-24 00:41:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:41:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:41:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions.
[2024-11-24 00:41:48,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222
[2024-11-24 00:41:48,446 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 184 flow. Second operand 6 states and 208 transitions.
[2024-11-24 00:41:48,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 488 flow
[2024-11-24 00:41:48,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 458 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-24 00:41:48,466 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 234 flow
[2024-11-24 00:41:48,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=62, PETRI_TRANSITIONS=53}
[2024-11-24 00:41:48,467 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places.
[2024-11-24 00:41:48,467 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 234 flow
[2024-11-24 00:41:48,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-24 00:41:48,468 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:48,470 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-24 00:41:48,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 00:41:48,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:48,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash -134937434, now seen corresponding path program 1 times
[2024-11-24 00:41:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350662857]
[2024-11-24 00:41:48,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:41:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:41:49,052 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-24 00:41:49,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:49,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350662857]
[2024-11-24 00:41:49,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350662857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:49,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:49,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:41:49,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289513910]
[2024-11-24 00:41:49,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:49,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:41:49,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:49,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:41:49,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:41:49,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48
[2024-11-24 00:41:49,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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-24 00:41:49,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:49,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48
[2024-11-24 00:41:49,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:49,820 INFO L124 PetriNetUnfolderBase]: 1321/1993 cut-off events.
[2024-11-24 00:41:49,820 INFO L125 PetriNetUnfolderBase]: For 3006/3006 co-relation queries the response was YES.
[2024-11-24 00:41:49,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5956 conditions, 1993 events. 1321/1993 cut-off events. For 3006/3006 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9789 event pairs, 39 based on Foata normal form. 72/2036 useless extension candidates. Maximal degree in co-relation 5941. Up to 668 conditions per place.
[2024-11-24 00:41:49,844 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 59 selfloop transitions, 18 changer transitions 1/95 dead transitions.
[2024-11-24 00:41:49,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 490 flow
[2024-11-24 00:41:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:41:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:41:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions.
[2024-11-24 00:41:49,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6755952380952381
[2024-11-24 00:41:49,848 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 234 flow. Second operand 7 states and 227 transitions.
[2024-11-24 00:41:49,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 490 flow
[2024-11-24 00:41:49,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 444 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-24 00:41:49,874 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 244 flow
[2024-11-24 00:41:49,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=53}
[2024-11-24 00:41:49,879 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places.
[2024-11-24 00:41:49,880 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 244 flow
[2024-11-24 00:41:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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-24 00:41:49,883 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:49,883 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]
[2024-11-24 00:41:49,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 00:41:49,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:49,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash -71176592, now seen corresponding path program 1 times
[2024-11-24 00:41:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:49,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771909135]
[2024-11-24 00:41:49,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:41:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:41:50,675 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-24 00:41:50,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:50,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771909135]
[2024-11-24 00:41:50,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771909135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:50,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:50,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:41:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213639809]
[2024-11-24 00:41:50,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:50,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:41:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:50,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:41:50,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:41:50,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48
[2024-11-24 00:41:50,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-24 00:41:50,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:50,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48
[2024-11-24 00:41:50,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:52,000 INFO L124 PetriNetUnfolderBase]: 3971/6623 cut-off events.
[2024-11-24 00:41:52,000 INFO L125 PetriNetUnfolderBase]: For 3092/3205 co-relation queries the response was YES.
[2024-11-24 00:41:52,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15419 conditions, 6623 events. 3971/6623 cut-off events. For 3092/3205 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 45822 event pairs, 445 based on Foata normal form. 16/6350 useless extension candidates. Maximal degree in co-relation 15403. Up to 2314 conditions per place.
[2024-11-24 00:41:52,073 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 55 selfloop transitions, 12 changer transitions 12/106 dead transitions.
[2024-11-24 00:41:52,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 526 flow
[2024-11-24 00:41:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 00:41:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 00:41:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions.
[2024-11-24 00:41:52,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6339285714285714
[2024-11-24 00:41:52,076 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 244 flow. Second operand 7 states and 213 transitions.
[2024-11-24 00:41:52,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 526 flow
[2024-11-24 00:41:52,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 420 flow, removed 22 selfloop flow, removed 10 redundant places.
[2024-11-24 00:41:52,142 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 240 flow
[2024-11-24 00:41:52,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2024-11-24 00:41:52,144 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places.
[2024-11-24 00:41:52,144 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 240 flow
[2024-11-24 00:41:52,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-24 00:41:52,144 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:52,144 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]
[2024-11-24 00:41:52,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 00:41:52,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:52,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1487703146, now seen corresponding path program 2 times
[2024-11-24 00:41:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672361129]
[2024-11-24 00:41:52,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 00:41:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:52,251 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 00:41:52,252 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:41:52,794 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-24 00:41:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:52,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672361129]
[2024-11-24 00:41:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672361129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-24 00:41:52,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436658847]
[2024-11-24 00:41:52,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:52,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 00:41:52,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:52,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:41:52,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:41:52,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48
[2024-11-24 00:41:52,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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-24 00:41:52,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:52,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48
[2024-11-24 00:41:52,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:54,881 INFO L124 PetriNetUnfolderBase]: 6998/11668 cut-off events.
[2024-11-24 00:41:54,881 INFO L125 PetriNetUnfolderBase]: For 5021/5283 co-relation queries the response was YES.
[2024-11-24 00:41:54,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27918 conditions, 11668 events. 6998/11668 cut-off events. For 5021/5283 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 87418 event pairs, 1067 based on Foata normal form. 222/11296 useless extension candidates. Maximal degree in co-relation 27901. Up to 3698 conditions per place.
[2024-11-24 00:41:54,978 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 48 selfloop transitions, 15 changer transitions 49/140 dead transitions.
[2024-11-24 00:41:54,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 140 transitions, 740 flow
[2024-11-24 00:41:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 00:41:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 00:41:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions.
[2024-11-24 00:41:54,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6380208333333334
[2024-11-24 00:41:54,981 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 240 flow. Second operand 8 states and 245 transitions.
[2024-11-24 00:41:54,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 140 transitions, 740 flow
[2024-11-24 00:41:54,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 140 transitions, 734 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-11-24 00:41:54,992 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 345 flow
[2024-11-24 00:41:54,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=76, PETRI_TRANSITIONS=69}
[2024-11-24 00:41:54,993 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places.
[2024-11-24 00:41:54,993 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 345 flow
[2024-11-24 00:41:54,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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-24 00:41:54,996 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:54,997 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]
[2024-11-24 00:41:54,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 00:41:54,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:54,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash -257888700, now seen corresponding path program 3 times
[2024-11-24 00:41:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:54,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547667445]
[2024-11-24 00:41:54,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 00:41:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:55,101 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-24 00:41:55,102 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:41:55,432 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-24 00:41:55,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 00:41:55,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547667445]
[2024-11-24 00:41:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547667445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:41:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:41:55,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 00:41:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626974084]
[2024-11-24 00:41:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:41:55,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 00:41:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 00:41:55,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 00:41:55,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 00:41:55,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48
[2024-11-24 00:41:55,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-24 00:41:55,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 00:41:55,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48
[2024-11-24 00:41:55,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 00:41:56,868 INFO L124 PetriNetUnfolderBase]: 4966/8707 cut-off events.
[2024-11-24 00:41:56,869 INFO L125 PetriNetUnfolderBase]: For 7857/8037 co-relation queries the response was YES.
[2024-11-24 00:41:56,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21529 conditions, 8707 events. 4966/8707 cut-off events. For 7857/8037 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 66153 event pairs, 1491 based on Foata normal form. 126/8202 useless extension candidates. Maximal degree in co-relation 21506. Up to 3615 conditions per place.
[2024-11-24 00:41:56,919 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 35 selfloop transitions, 9 changer transitions 29/102 dead transitions.
[2024-11-24 00:41:56,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 102 transitions, 589 flow
[2024-11-24 00:41:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:41:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 00:41:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions.
[2024-11-24 00:41:56,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6284722222222222
[2024-11-24 00:41:56,923 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 345 flow. Second operand 6 states and 181 transitions.
[2024-11-24 00:41:56,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 102 transitions, 589 flow
[2024-11-24 00:41:56,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 568 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-11-24 00:41:56,942 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 310 flow
[2024-11-24 00:41:56,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=77, PETRI_TRANSITIONS=64}
[2024-11-24 00:41:56,945 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places.
[2024-11-24 00:41:56,945 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 310 flow
[2024-11-24 00:41:56,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-24 00:41:56,949 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 00:41:56,949 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]
[2024-11-24 00:41:56,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 00:41:56,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2024-11-24 00:41:56,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:41:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash 950149078, now seen corresponding path program 4 times
[2024-11-24 00:41:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:41:56,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364380370]
[2024-11-24 00:41:56,950 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 00:41:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:41:57,072 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 00:41:57,073 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 00:41:57,073 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:41:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:41:57,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 00:41:57,234 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 00:41:57,235 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2024-11-24 00:41:57,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2024-11-24 00:41:57,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2024-11-24 00:41:57,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-24 00:41:57,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-24 00:41:57,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-24 00:41:57,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2024-11-24 00:41:57,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 00:41:57,241 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1]
[2024-11-24 00:41:57,375 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 00:41:57,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 00:41:57,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:41:57 BasicIcfg
[2024-11-24 00:41:57,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 00:41:57,388 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 00:41:57,388 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 00:41:57,388 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 00:41:57,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:41:41" (3/4) ...
[2024-11-24 00:41:57,391 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-24 00:41:57,593 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9.
[2024-11-24 00:41:57,674 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/witness.graphml
[2024-11-24 00:41:57,675 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/witness.yml
[2024-11-24 00:41:57,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 00:41:57,677 INFO L158 Benchmark]: Toolchain (without parser) took 18832.44ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 129.4MB in the beginning and 418.7MB in the end (delta: -289.3MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB.
[2024-11-24 00:41:57,679 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:41:57,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 867.30ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 106.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 00:41:57,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.80ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 104.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:41:57,681 INFO L158 Benchmark]: Boogie Preprocessor took 108.60ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 101.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:41:57,682 INFO L158 Benchmark]: RCFGBuilder took 1109.40ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 54.8MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
[2024-11-24 00:41:57,682 INFO L158 Benchmark]: TraceAbstraction took 16376.45ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 54.1MB in the beginning and 439.6MB in the end (delta: -385.5MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB.
[2024-11-24 00:41:57,684 INFO L158 Benchmark]: Witness Printer took 286.92ms. Allocated memory is still 645.9MB. Free memory was 439.6MB in the beginning and 418.7MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 00:41:57,686 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.54ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 867.30ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 106.4MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 70.80ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 104.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 108.60ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 101.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 1109.40ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 54.8MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 16376.45ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 54.1MB in the beginning and 439.6MB in the end (delta: -385.5MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB.
* Witness Printer took 286.92ms. Allocated memory is still 645.9MB. Free memory was 439.6MB in the beginning and 418.7MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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_p2_EAX = 0;
[L716] 0 int __unbuffered_p3_EAX = 0;
[L718] 0 int a = 0;
[L719] 0 _Bool main$tmp_guard0;
[L720] 0 _Bool main$tmp_guard1;
[L722] 0 int x = 0;
[L724] 0 int y = 0;
[L726] 0 int z = 0;
[L727] 0 _Bool z$flush_delayed;
[L728] 0 int z$mem_tmp;
[L729] 0 _Bool z$r_buff0_thd0;
[L730] 0 _Bool z$r_buff0_thd1;
[L731] 0 _Bool z$r_buff0_thd2;
[L732] 0 _Bool z$r_buff0_thd3;
[L733] 0 _Bool z$r_buff0_thd4;
[L734] 0 _Bool z$r_buff1_thd0;
[L735] 0 _Bool z$r_buff1_thd1;
[L736] 0 _Bool z$r_buff1_thd2;
[L737] 0 _Bool z$r_buff1_thd3;
[L738] 0 _Bool z$r_buff1_thd4;
[L739] 0 _Bool z$read_delayed;
[L740] 0 int *z$read_delayed_var;
[L741] 0 int z$w_buff0;
[L742] 0 _Bool z$w_buff0_used;
[L743] 0 int z$w_buff1;
[L744] 0 _Bool z$w_buff1_used;
[L745] 0 _Bool weak$$choice0;
[L746] 0 _Bool weak$$choice2;
[L846] 0 pthread_t t1365;
[L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L848] 0 pthread_t t1366;
[L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-3, t1366=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L850] 0 pthread_t t1367;
[L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-3, t1366=-2, t1367=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L852] 0 pthread_t t1368;
[L853] FCALL, FORK 0 pthread_create(&t1368, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-3, t1366=-2, t1367=-1, t1368=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L808] 4 z$w_buff1 = z$w_buff0
[L809] 4 z$w_buff0 = 1
[L810] 4 z$w_buff1_used = z$w_buff0_used
[L811] 4 z$w_buff0_used = (_Bool)1
[L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 4 !(!expression)
[L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L818] 4 z$r_buff0_thd4 = (_Bool)1
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_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L821] 4 __unbuffered_p3_EAX = a
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_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L750] 1 a = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L753] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L765] 2 x = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L768] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L780] 3 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L783] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L784] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L785] 3 z$flush_delayed = weak$$choice2
[L786] 3 z$mem_tmp = z
[L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L794] 3 __unbuffered_p2_EAX = z
[L795] 3 z = z$flush_delayed ? z$mem_tmp : z
[L796] 3 z$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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
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_p2_EAX=0, __unbuffered_p3_EAX=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=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L758] 1 __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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L801] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L855] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365=-3, t1366=-2, t1367=-1, t1368=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L857] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L857] RET 0 assume_abort_if_not(main$tmp_guard0)
[L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365=-3, t1366=-2, t1367=-1, t1368=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365=-3, t1366=-2, t1367=-1, t1368=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L868] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
- 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: 851]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 9 procedures, 81 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: 16.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 954 IncrementalHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 42 mSDtfsCounter, 954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=7, InterpolantAutomatonStates: 46, 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.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-24 00:41:57,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3724cd5c-7ab9-424a-9694-8d1235884d6f/bin/uautomizer-verify-LYvppIcaGC/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