./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_tso.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9c6cc212d45f96c9e6587b0ee0d7644c3fabb2c198a03ef385d6df2e7b46689
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 11:34:05,782 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 11:34:05,836 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-12-02 11:34:05,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 11:34:05,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 11:34:05,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 11:34:05,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 11:34:05,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 11:34:05,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-12-02 11:34:05,862 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-12-02 11:34:05,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 11:34:05,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 11:34:05,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 11:34:05,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 11:34:05,863 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 11:34:05,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 11:34:05,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-12-02 11:34:05,863 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 11:34:05,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 11:34:05,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 11:34:05,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 11:34:05,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 11:34:05,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-02 11:34:05,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-02 11:34:05,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 11:34:05,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 11:34:05,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 11:34:05,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 11:34:05,866 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_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9c6cc212d45f96c9e6587b0ee0d7644c3fabb2c198a03ef385d6df2e7b46689
[2024-12-02 11:34:06,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 11:34:06,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 11:34:06,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 11:34:06,089 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 11:34:06,089 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 11:34:06,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix022_tso.i
[2024-12-02 11:34:08,814 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/data/8a5ef416d/89777e2401544302b63cc6d93481ef7f/FLAG1cb27fded
[2024-12-02 11:34:09,055 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 11:34:09,056 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/sv-benchmarks/c/pthread-wmm/mix022_tso.i
[2024-12-02 11:34:09,068 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/data/8a5ef416d/89777e2401544302b63cc6d93481ef7f/FLAG1cb27fded
[2024-12-02 11:34:09,374 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/data/8a5ef416d/89777e2401544302b63cc6d93481ef7f
[2024-12-02 11:34:09,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 11:34:09,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 11:34:09,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 11:34:09,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 11:34:09,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 11:34:09,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475d1118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09, skipping insertion in model container
[2024-12-02 11:34:09,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,411 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 11:34:09,538 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_6f4bd527-f819-48cb-bd1e-473c129369b8/sv-benchmarks/c/pthread-wmm/mix022_tso.i[944,957]
[2024-12-02 11:34:09,671 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 11:34:09,680 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 11:34:09,688 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_6f4bd527-f819-48cb-bd1e-473c129369b8/sv-benchmarks/c/pthread-wmm/mix022_tso.i[944,957]
[2024-12-02 11:34:09,736 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 11:34:09,761 INFO L204 MainTranslator]: Completed translation
[2024-12-02 11:34:09,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09 WrapperNode
[2024-12-02 11:34:09,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 11:34:09,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 11:34:09,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 11:34:09,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 11:34:09,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,799 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2024-12-02 11:34:09,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 11:34:09,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 11:34:09,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 11:34:09,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 11:34:09,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-12-02 11:34:09,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 11:34:09,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 11:34:09,844 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 11:34:09,844 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 11:34:09,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (1/1) ...
[2024-12-02 11:34:09,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 11:34:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 11:34:09,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 11:34:09,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 11:34:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-12-02 11:34:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 11:34:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-12-02 11:34:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-12-02 11:34:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-12-02 11:34:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-12-02 11:34:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-12-02 11:34:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-12-02 11:34:09,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 11:34:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 11:34:09,895 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 11:34:10,000 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 11:34:10,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 11:34:10,288 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 11:34:10,288 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 11:34:10,502 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 11:34:10,502 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 11:34:10,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:34:10 BoogieIcfgContainer
[2024-12-02 11:34:10,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 11:34:10,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 11:34:10,505 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 11:34:10,509 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 11:34:10,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:34:09" (1/3) ...
[2024-12-02 11:34:10,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed187e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:34:10, skipping insertion in model container
[2024-12-02 11:34:10,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:34:09" (2/3) ...
[2024-12-02 11:34:10,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed187e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:34:10, skipping insertion in model container
[2024-12-02 11:34:10,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:34:10" (3/3) ...
[2024-12-02 11:34:10,512 INFO L128 eAbstractionObserver]: Analyzing ICFG mix022_tso.i
[2024-12-02 11:34:10,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 11:34:10,528 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix022_tso.i that has 3 procedures, 31 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2024-12-02 11:34:10,528 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 11:34:10,578 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-12-02 11:34:10,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 70 flow
[2024-12-02 11:34:10,639 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events.
[2024-12-02 11:34:10,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 11:34:10,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place.
[2024-12-02 11:34:10,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 70 flow
[2024-12-02 11:34:10,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 64 flow
[2024-12-02 11:34:10,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 11:34:10,666 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;@3a2fdd7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 11:34:10,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-12-02 11:34:10,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 11:34:10,671 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events.
[2024-12-02 11:34:10,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 11:34:10,671 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 11:34:10,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-12-02 11:34:10,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-02 11:34:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 11:34:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1838594265, now seen corresponding path program 1 times
[2024-12-02 11:34:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 11:34:10,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679917965]
[2024-12-02 11:34:10,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 11:34:10,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 11:34:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 11:34:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 11:34:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 11:34:11,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679917965]
[2024-12-02 11:34:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679917965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 11:34:11,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 11:34:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-12-02 11:34:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409454767]
[2024-12-02 11:34:11,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 11:34:11,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 11:34:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 11:34:11,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 11:34:11,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 11:34:11,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 31
[2024-12-02 11:34:11,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:11,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 11:34:11,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 31
[2024-12-02 11:34:11,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 11:34:11,308 INFO L124 PetriNetUnfolderBase]: 144/317 cut-off events.
[2024-12-02 11:34:11,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 11:34:11,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 317 events. 144/317 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1628 event pairs, 16 based on Foata normal form. 15/326 useless extension candidates. Maximal degree in co-relation 575. Up to 213 conditions per place.
[2024-12-02 11:34:11,312 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 20 selfloop transitions, 2 changer transitions 2/35 dead transitions.
[2024-12-02 11:34:11,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 124 flow
[2024-12-02 11:34:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 11:34:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 11:34:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions.
[2024-12-02 11:34:11,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387
[2024-12-02 11:34:11,327 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 66 transitions.
[2024-12-02 11:34:11,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 124 flow
[2024-12-02 11:34:11,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 11:34:11,334 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 60 flow
[2024-12-02 11:34:11,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=26}
[2024-12-02 11:34:11,339 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places.
[2024-12-02 11:34:11,339 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 60 flow
[2024-12-02 11:34:11,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:11,340 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 11:34:11,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 11:34:11,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-02 11:34:11,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-02 11:34:11,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 11:34:11,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1669036513, now seen corresponding path program 1 times
[2024-12-02 11:34:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 11:34:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226490739]
[2024-12-02 11:34:11,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 11:34:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 11:34:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 11:34:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 11:34:11,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 11:34:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226490739]
[2024-12-02 11:34:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226490739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 11:34:11,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 11:34:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-12-02 11:34:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953300386]
[2024-12-02 11:34:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 11:34:11,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-12-02 11:34:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 11:34:11,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-12-02 11:34:11,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-12-02 11:34:11,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31
[2024-12-02 11:34:11,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:11,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 11:34:11,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31
[2024-12-02 11:34:11,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 11:34:11,874 INFO L124 PetriNetUnfolderBase]: 191/411 cut-off events.
[2024-12-02 11:34:11,874 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-12-02 11:34:11,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 411 events. 191/411 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1982 event pairs, 31 based on Foata normal form. 24/417 useless extension candidates. Maximal degree in co-relation 789. Up to 191 conditions per place.
[2024-12-02 11:34:11,878 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 31 selfloop transitions, 4 changer transitions 1/44 dead transitions.
[2024-12-02 11:34:11,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 174 flow
[2024-12-02 11:34:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-12-02 11:34:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-12-02 11:34:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions.
[2024-12-02 11:34:11,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161
[2024-12-02 11:34:11,880 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 60 flow. Second operand 4 states and 78 transitions.
[2024-12-02 11:34:11,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 174 flow
[2024-12-02 11:34:11,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 11:34:11,882 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 82 flow
[2024-12-02 11:34:11,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-12-02 11:34:11,883 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places.
[2024-12-02 11:34:11,883 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 82 flow
[2024-12-02 11:34:11,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:11,883 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 11:34:11,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 11:34:11,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-12-02 11:34:11,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-02 11:34:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 11:34:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1611496895, now seen corresponding path program 1 times
[2024-12-02 11:34:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 11:34:11,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631047418]
[2024-12-02 11:34:11,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 11:34:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 11:34:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 11:34:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 11:34:12,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 11:34:12,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631047418]
[2024-12-02 11:34:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631047418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 11:34:12,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 11:34:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-12-02 11:34:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134026354]
[2024-12-02 11:34:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 11:34:12,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-12-02 11:34:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 11:34:12,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-12-02 11:34:12,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-12-02 11:34:12,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31
[2024-12-02 11:34:12,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:12,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 11:34:12,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31
[2024-12-02 11:34:12,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 11:34:12,352 INFO L124 PetriNetUnfolderBase]: 97/211 cut-off events.
[2024-12-02 11:34:12,352 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES.
[2024-12-02 11:34:12,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 211 events. 97/211 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 736 event pairs, 21 based on Foata normal form. 16/221 useless extension candidates. Maximal degree in co-relation 485. Up to 86 conditions per place.
[2024-12-02 11:34:12,354 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 26 selfloop transitions, 6 changer transitions 1/41 dead transitions.
[2024-12-02 11:34:12,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 179 flow
[2024-12-02 11:34:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-12-02 11:34:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-12-02 11:34:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions.
[2024-12-02 11:34:12,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935
[2024-12-02 11:34:12,356 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 82 flow. Second operand 5 states and 85 transitions.
[2024-12-02 11:34:12,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 179 flow
[2024-12-02 11:34:12,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-12-02 11:34:12,358 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 98 flow
[2024-12-02 11:34:12,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=40, PETRI_TRANSITIONS=28}
[2024-12-02 11:34:12,359 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places.
[2024-12-02 11:34:12,359 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 98 flow
[2024-12-02 11:34:12,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:12,359 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 11:34:12,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 11:34:12,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-12-02 11:34:12,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-02 11:34:12,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 11:34:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash 309745009, now seen corresponding path program 1 times
[2024-12-02 11:34:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 11:34:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713318558]
[2024-12-02 11:34:12,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 11:34:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 11:34:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 11:34:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 11:34:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 11:34:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713318558]
[2024-12-02 11:34:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713318558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 11:34:12,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 11:34:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-12-02 11:34:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642111190]
[2024-12-02 11:34:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 11:34:12,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-12-02 11:34:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 11:34:12,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-12-02 11:34:12,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-12-02 11:34:12,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31
[2024-12-02 11:34:12,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:12,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 11:34:12,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31
[2024-12-02 11:34:12,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 11:34:13,103 INFO L124 PetriNetUnfolderBase]: 118/288 cut-off events.
[2024-12-02 11:34:13,103 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES.
[2024-12-02 11:34:13,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 288 events. 118/288 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1173 event pairs, 31 based on Foata normal form. 4/286 useless extension candidates. Maximal degree in co-relation 639. Up to 133 conditions per place.
[2024-12-02 11:34:13,104 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 20 selfloop transitions, 1 changer transitions 18/49 dead transitions.
[2024-12-02 11:34:13,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 226 flow
[2024-12-02 11:34:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-12-02 11:34:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-12-02 11:34:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-12-02 11:34:13,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505
[2024-12-02 11:34:13,106 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 98 flow. Second operand 6 states and 100 transitions.
[2024-12-02 11:34:13,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 226 flow
[2024-12-02 11:34:13,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 192 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-12-02 11:34:13,108 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 81 flow
[2024-12-02 11:34:13,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=43, PETRI_TRANSITIONS=28}
[2024-12-02 11:34:13,109 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places.
[2024-12-02 11:34:13,109 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 81 flow
[2024-12-02 11:34:13,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 11:34:13,109 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 11:34:13,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 11:34:13,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-12-02 11:34:13,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-02 11:34:13,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 11:34:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash -102520847, now seen corresponding path program 2 times
[2024-12-02 11:34:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 11:34:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424311070]
[2024-12-02 11:34:13,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-12-02 11:34:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 11:34:13,176 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-12-02 11:34:13,176 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-12-02 11:34:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 11:34:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 11:34:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424311070]
[2024-12-02 11:34:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424311070] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 11:34:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 11:34:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-12-02 11:34:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504192249]
[2024-12-02 11:34:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 11:34:15,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-12-02 11:34:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 11:34:15,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-12-02 11:34:15,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-12-02 11:34:15,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31
[2024-12-02 11:34:15,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 81 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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-12-02 11:34:15,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 11:34:15,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31
[2024-12-02 11:34:15,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 11:34:15,664 INFO L124 PetriNetUnfolderBase]: 112/277 cut-off events.
[2024-12-02 11:34:15,664 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-02 11:34:15,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 277 events. 112/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1092 event pairs, 20 based on Foata normal form. 4/274 useless extension candidates. Maximal degree in co-relation 561. Up to 75 conditions per place.
[2024-12-02 11:34:15,665 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 18 selfloop transitions, 4 changer transitions 26/59 dead transitions.
[2024-12-02 11:34:15,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 245 flow
[2024-12-02 11:34:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-12-02 11:34:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-12-02 11:34:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions.
[2024-12-02 11:34:15,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5129032258064516
[2024-12-02 11:34:15,667 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 81 flow. Second operand 10 states and 159 transitions.
[2024-12-02 11:34:15,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 245 flow
[2024-12-02 11:34:15,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 234 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-12-02 11:34:15,669 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 99 flow
[2024-12-02 11:34:15,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=99, PETRI_PLACES=51, PETRI_TRANSITIONS=28}
[2024-12-02 11:34:15,670 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places.
[2024-12-02 11:34:15,670 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 99 flow
[2024-12-02 11:34:15,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 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-12-02 11:34:15,671 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 11:34:15,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 11:34:15,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-02 11:34:15,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-12-02 11:34:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 11:34:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1849221657, now seen corresponding path program 3 times
[2024-12-02 11:34:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 11:34:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330669752]
[2024-12-02 11:34:15,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-12-02 11:34:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 11:34:15,786 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-12-02 11:34:15,786 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-12-02 11:34:15,787 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-12-02 11:34:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-12-02 11:34:15,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-12-02 11:34:15,923 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-12-02 11:34:15,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-12-02 11:34:15,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-12-02 11:34:15,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-12-02 11:34:15,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-12-02 11:34:15,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-12-02 11:34:15,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-12-02 11:34:15,926 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1]
[2024-12-02 11:34:15,978 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 11:34:15,978 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 11:34:15,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:34:15 BasicIcfg
[2024-12-02 11:34:15,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 11:34:15,984 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 11:34:15,984 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 11:34:15,984 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 11:34:15,985 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:34:10" (3/4) ...
[2024-12-02 11:34:15,986 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-12-02 11:34:16,057 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9.
[2024-12-02 11:34:16,104 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml
[2024-12-02 11:34:16,104 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/witness.yml
[2024-12-02 11:34:16,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 11:34:16,105 INFO L158 Benchmark]: Toolchain (without parser) took 6728.55ms. Allocated memory was 117.4MB in the beginning and 360.7MB in the end (delta: 243.3MB). Free memory was 90.7MB in the beginning and 253.5MB in the end (delta: -162.7MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB.
[2024-12-02 11:34:16,105 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 11:34:16,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.92ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 66.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-12-02 11:34:16,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.36ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 63.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 11:34:16,106 INFO L158 Benchmark]: Boogie Preprocessor took 43.01ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 60.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-02 11:34:16,106 INFO L158 Benchmark]: RCFGBuilder took 658.98ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 59.2MB in the end (delta: 1.2MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB.
[2024-12-02 11:34:16,107 INFO L158 Benchmark]: TraceAbstraction took 5479.05ms. Allocated memory was 117.4MB in the beginning and 360.7MB in the end (delta: 243.3MB). Free memory was 58.1MB in the beginning and 264.6MB in the end (delta: -206.5MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB.
[2024-12-02 11:34:16,107 INFO L158 Benchmark]: Witness Printer took 120.05ms. Allocated memory is still 360.7MB. Free memory was 264.6MB in the beginning and 253.5MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-12-02 11:34:16,109 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.26ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 73.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 384.92ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 66.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 37.36ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 63.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 43.01ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 60.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 658.98ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 59.2MB in the end (delta: 1.2MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 5479.05ms. Allocated memory was 117.4MB in the beginning and 360.7MB in the end (delta: 243.3MB). Free memory was 58.1MB in the beginning and 264.6MB in the end (delta: -206.5MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB.
* Witness Printer took 120.05ms. Allocated memory is still 360.7MB. Free memory was 264.6MB in the beginning and 253.5MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. 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:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p1_EAX = 0;
[L712] 0 int __unbuffered_p1_EBX = 0;
[L713] 0 _Bool main$tmp_guard0;
[L714] 0 _Bool main$tmp_guard1;
[L716] 0 int x = 0;
[L717] 0 _Bool x$flush_delayed;
[L718] 0 int x$mem_tmp;
[L719] 0 _Bool x$r_buff0_thd0;
[L720] 0 _Bool x$r_buff0_thd1;
[L721] 0 _Bool x$r_buff0_thd2;
[L722] 0 _Bool x$r_buff1_thd0;
[L723] 0 _Bool x$r_buff1_thd1;
[L724] 0 _Bool x$r_buff1_thd2;
[L725] 0 _Bool x$read_delayed;
[L726] 0 int *x$read_delayed_var;
[L727] 0 int x$w_buff0;
[L728] 0 _Bool x$w_buff0_used;
[L729] 0 int x$w_buff1;
[L730] 0 _Bool x$w_buff1_used;
[L732] 0 int y = 0;
[L733] 0 _Bool weak$$choice0;
[L734] 0 _Bool weak$$choice2;
[L810] 0 pthread_t t597;
[L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L812] 0 pthread_t t598;
[L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L758] 2 x$w_buff1 = x$w_buff0
[L759] 2 x$w_buff0 = 2
[L760] 2 x$w_buff1_used = x$w_buff0_used
[L761] 2 x$w_buff0_used = (_Bool)1
[L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L766] 2 x$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L769] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L770] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L771] 2 x$flush_delayed = weak$$choice2
[L772] 2 x$mem_tmp = x
[L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L780] 2 __unbuffered_p1_EAX = x
[L781] 2 x = x$flush_delayed ? x$mem_tmp : x
[L782] 2 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L785] 2 __unbuffered_p1_EBX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0]
[L738] 1 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1]
[L741] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1]
[L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L817] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L817] RET 0 assume_abort_if_not(main$tmp_guard0)
[L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L826] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L827] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L828] 0 x$flush_delayed = weak$$choice2
[L829] 0 x$mem_tmp = x
[L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
[L838] 0 x = x$flush_delayed ? x$mem_tmp : x
[L839] 0 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t597=-1, t598=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L841] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 811]: 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: 813]: 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 5 procedures, 49 locations, 5 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: 5.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 475 IncrementalHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 6 mSDtfsCounter, 475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-12-02 11:34:16,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f4bd527-f819-48cb-bd1e-473c129369b8/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE