./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl --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 bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:29:42,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:29:42,909 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:29:42,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:29:42,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:29:42,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:29:42,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:29:42,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:29:42,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:29:42,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:29:42,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:29:42,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:29:42,970 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:29:42,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:29:42,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:29:42,974 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:29:42,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:29:42,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:29:42,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:29:42,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:29:42,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:29:42,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:29:42,978 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:29:42,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:29:42,979 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:29:42,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:29:42,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:29:42,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:29:42,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:29:42,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:29:42,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:29:42,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:29:42,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:29:42,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:29:42,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:29:42,985 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:29:42,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:29:42,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:29:42,985 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:29:42,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl 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 -> bcf8be2e0ebdad705b2868a16d6f5dfa937315d70be824d82e2d5945253ac067 [2023-11-12 02:29:43,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:29:43,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:29:43,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:29:43,395 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:29:43,396 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:29:43,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-12 02:29:46,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:29:46,929 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:29:46,929 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-12 02:29:46,945 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/data/eda62f162/de01b5bb2cd3419c8e76be71f1a9da44/FLAG0fd2017f7 [2023-11-12 02:29:46,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/data/eda62f162/de01b5bb2cd3419c8e76be71f1a9da44 [2023-11-12 02:29:46,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:29:46,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:29:46,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:29:46,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:29:46,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:29:46,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:29:46" (1/1) ... [2023-11-12 02:29:46,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc38aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:46, skipping insertion in model container [2023-11-12 02:29:46,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:29:46" (1/1) ... [2023-11-12 02:29:47,016 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:29:47,179 WARN L240 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_6290a2ff-7659-456e-8257-257aa263211f/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-12 02:29:47,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:29:47,455 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:29:47,473 WARN L240 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_6290a2ff-7659-456e-8257-257aa263211f/sv-benchmarks/c/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-12 02:29:47,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:29:47,595 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:29:47,595 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:29:47,604 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:29:47,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47 WrapperNode [2023-11-12 02:29:47,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:29:47,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:29:47,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:29:47,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:29:47,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,759 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-11-12 02:29:47,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:29:47,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:29:47,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:29:47,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:29:47,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:29:47,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:29:47,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:29:47,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:29:47,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (1/1) ... [2023-11-12 02:29:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:29:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:29:47,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:29:47,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:29:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:29:47,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:29:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:29:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:29:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:29:47,942 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:29:47,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:29:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:29:47,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:29:47,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:29:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:29:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:29:47,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:29:47,948 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:29:48,171 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:29:48,173 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:29:48,526 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:29:48,766 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:29:48,766 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:29:48,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:29:48 BoogieIcfgContainer [2023-11-12 02:29:48,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:29:48,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:29:48,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:29:48,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:29:48,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:29:46" (1/3) ... [2023-11-12 02:29:48,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736e2ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:29:48, skipping insertion in model container [2023-11-12 02:29:48,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:29:47" (2/3) ... [2023-11-12 02:29:48,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736e2ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:29:48, skipping insertion in model container [2023-11-12 02:29:48,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:29:48" (3/3) ... [2023-11-12 02:29:48,805 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-12 02:29:48,826 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:29:48,839 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:29:48,839 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:29:48,839 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:29:48,892 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:29:48,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 196 flow [2023-11-12 02:29:48,987 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2023-11-12 02:29:48,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:29:48,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-12 02:29:48,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 196 flow [2023-11-12 02:29:48,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2023-11-12 02:29:49,001 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:29:49,012 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 92 transitions, 190 flow [2023-11-12 02:29:49,018 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 92 transitions, 190 flow [2023-11-12 02:29:49,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 190 flow [2023-11-12 02:29:49,060 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2023-11-12 02:29:49,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:29:49,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-12 02:29:49,063 INFO L119 LiptonReduction]: Number of co-enabled transitions 1292 [2023-11-12 02:29:54,568 INFO L134 LiptonReduction]: Checked pairs total: 3308 [2023-11-12 02:29:54,569 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-11-12 02:29:54,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:29:54,591 INFO L357 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, mHoare=true, 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;@149188dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:29:54,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-12 02:29:54,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:29:54,597 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-12 02:29:54,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:29:54,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:54,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:29:54,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:54,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash 408666698, now seen corresponding path program 1 times [2023-11-12 02:29:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511607825] [2023-11-12 02:29:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:29:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:29:55,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:29:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511607825] [2023-11-12 02:29:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511607825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:29:55,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:29:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:29:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831469853] [2023-11-12 02:29:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:29:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:29:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:29:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:29:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:29:55,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 180 [2023-11-12 02:29:55,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2023-11-12 02:29:55,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:29:55,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 180 [2023-11-12 02:29:55,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:29:55,371 INFO L124 PetriNetUnfolderBase]: 111/242 cut-off events. [2023-11-12 02:29:55,372 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:29:55,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 242 events. 111/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1025 event pairs, 18 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 446. Up to 154 conditions per place. [2023-11-12 02:29:55,376 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 17 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-11-12 02:29:55,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 96 flow [2023-11-12 02:29:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:29:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:29:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-11-12 02:29:55,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2023-11-12 02:29:55,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-11-12 02:29:55,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-11-12 02:29:55,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:29:55,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-11-12 02:29:55,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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) [2023-11-12 02:29:55,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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) [2023-11-12 02:29:55,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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) [2023-11-12 02:29:55,413 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 268 transitions. [2023-11-12 02:29:55,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 96 flow [2023-11-12 02:29:55,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:29:55,419 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-11-12 02:29:55,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-12 02:29:55,425 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-12 02:29:55,426 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-11-12 02:29:55,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2023-11-12 02:29:55,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:55,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:29:55,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:29:55,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:55,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1886728506, now seen corresponding path program 1 times [2023-11-12 02:29:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346292186] [2023-11-12 02:29:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:29:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:29:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:29:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346292186] [2023-11-12 02:29:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346292186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:29:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:29:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:29:55,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200987823] [2023-11-12 02:29:55,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:29:55,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:29:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:29:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:29:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:29:55,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 180 [2023-11-12 02:29:55,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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) [2023-11-12 02:29:55,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:29:55,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 180 [2023-11-12 02:29:55,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:29:56,004 INFO L124 PetriNetUnfolderBase]: 97/192 cut-off events. [2023-11-12 02:29:56,005 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-12 02:29:56,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 192 events. 97/192 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 676 event pairs, 37 based on Foata normal form. 8/199 useless extension candidates. Maximal degree in co-relation 386. Up to 117 conditions per place. [2023-11-12 02:29:56,013 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-11-12 02:29:56,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 88 flow [2023-11-12 02:29:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:29:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:29:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-11-12 02:29:56,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48703703703703705 [2023-11-12 02:29:56,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-11-12 02:29:56,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-11-12 02:29:56,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:29:56,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-11-12 02:29:56,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2023-11-12 02:29:56,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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) [2023-11-12 02:29:56,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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) [2023-11-12 02:29:56,030 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 263 transitions. [2023-11-12 02:29:56,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 88 flow [2023-11-12 02:29:56,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:29:56,032 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2023-11-12 02:29:56,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-12 02:29:56,033 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-12 02:29:56,034 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2023-11-12 02:29:56,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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) [2023-11-12 02:29:56,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:56,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:29:56,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:29:56,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:56,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 650180706, now seen corresponding path program 1 times [2023-11-12 02:29:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112145554] [2023-11-12 02:29:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:29:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:29:56,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:29:56,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112145554] [2023-11-12 02:29:56,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112145554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:29:56,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:29:56,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:29:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351597691] [2023-11-12 02:29:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:29:56,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:29:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:29:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:29:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:29:56,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 180 [2023-11-12 02:29:56,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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) [2023-11-12 02:29:56,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:29:56,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 180 [2023-11-12 02:29:56,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:29:57,048 INFO L124 PetriNetUnfolderBase]: 106/218 cut-off events. [2023-11-12 02:29:57,049 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-12 02:29:57,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 218 events. 106/218 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 794 event pairs, 46 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 457. Up to 172 conditions per place. [2023-11-12 02:29:57,053 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 20 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-11-12 02:29:57,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 122 flow [2023-11-12 02:29:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:29:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:29:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2023-11-12 02:29:57,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47638888888888886 [2023-11-12 02:29:57,056 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 343 transitions. [2023-11-12 02:29:57,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 343 transitions. [2023-11-12 02:29:57,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:29:57,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 343 transitions. [2023-11-12 02:29:57,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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) [2023-11-12 02:29:57,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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) [2023-11-12 02:29:57,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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) [2023-11-12 02:29:57,065 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 4 states and 343 transitions. [2023-11-12 02:29:57,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 122 flow [2023-11-12 02:29:57,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:29:57,068 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 79 flow [2023-11-12 02:29:57,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-11-12 02:29:57,070 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-11-12 02:29:57,074 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 79 flow [2023-11-12 02:29:57,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 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) [2023-11-12 02:29:57,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:57,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:29:57,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:29:57,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:57,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash 669871596, now seen corresponding path program 2 times [2023-11-12 02:29:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106182219] [2023-11-12 02:29:57,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:29:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:29:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:29:57,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106182219] [2023-11-12 02:29:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106182219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:29:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:29:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:29:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554705630] [2023-11-12 02:29:57,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:29:57,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:29:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:29:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:29:57,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:29:57,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 180 [2023-11-12 02:29:57,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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) [2023-11-12 02:29:57,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:29:57,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 180 [2023-11-12 02:29:57,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:29:57,853 INFO L124 PetriNetUnfolderBase]: 102/212 cut-off events. [2023-11-12 02:29:57,854 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-12 02:29:57,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 212 events. 102/212 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 773 event pairs, 47 based on Foata normal form. 2/211 useless extension candidates. Maximal degree in co-relation 535. Up to 163 conditions per place. [2023-11-12 02:29:57,856 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 22 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2023-11-12 02:29:57,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 187 flow [2023-11-12 02:29:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:29:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:29:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-11-12 02:29:57,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48194444444444445 [2023-11-12 02:29:57,859 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-11-12 02:29:57,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-11-12 02:29:57,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:29:57,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-11-12 02:29:57,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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) [2023-11-12 02:29:57,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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) [2023-11-12 02:29:57,865 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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) [2023-11-12 02:29:57,865 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 79 flow. Second operand 4 states and 347 transitions. [2023-11-12 02:29:57,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 187 flow [2023-11-12 02:29:57,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 187 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:29:57,867 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 155 flow [2023-11-12 02:29:57,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-11-12 02:29:57,869 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-11-12 02:29:57,869 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 155 flow [2023-11-12 02:29:57,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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) [2023-11-12 02:29:57,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:57,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:29:57,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:29:57,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:57,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash -931046628, now seen corresponding path program 1 times [2023-11-12 02:29:57,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:57,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178194230] [2023-11-12 02:29:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:29:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:29:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:29:58,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178194230] [2023-11-12 02:29:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178194230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:29:58,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:29:58,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:29:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127526501] [2023-11-12 02:29:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:29:58,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:29:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:29:58,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:29:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:29:58,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 180 [2023-11-12 02:29:58,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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) [2023-11-12 02:29:58,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:29:58,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 180 [2023-11-12 02:29:58,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:29:58,790 INFO L124 PetriNetUnfolderBase]: 108/228 cut-off events. [2023-11-12 02:29:58,790 INFO L125 PetriNetUnfolderBase]: For 246/253 co-relation queries the response was YES. [2023-11-12 02:29:58,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 228 events. 108/228 cut-off events. For 246/253 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 889 event pairs, 17 based on Foata normal form. 3/230 useless extension candidates. Maximal degree in co-relation 683. Up to 121 conditions per place. [2023-11-12 02:29:58,793 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 29 selfloop transitions, 14 changer transitions 0/45 dead transitions. [2023-11-12 02:29:58,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 297 flow [2023-11-12 02:29:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:29:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:29:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2023-11-12 02:29:58,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46555555555555556 [2023-11-12 02:29:58,796 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 419 transitions. [2023-11-12 02:29:58,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 419 transitions. [2023-11-12 02:29:58,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:29:58,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 419 transitions. [2023-11-12 02:29:58,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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) [2023-11-12 02:29:58,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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) [2023-11-12 02:29:58,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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) [2023-11-12 02:29:58,803 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 155 flow. Second operand 5 states and 419 transitions. [2023-11-12 02:29:58,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 297 flow [2023-11-12 02:29:58,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 295 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-12 02:29:58,806 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 227 flow [2023-11-12 02:29:58,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-12 02:29:58,808 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 13 predicate places. [2023-11-12 02:29:58,808 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 227 flow [2023-11-12 02:29:58,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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) [2023-11-12 02:29:58,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:58,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:29:58,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:29:58,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:58,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1385141589, now seen corresponding path program 1 times [2023-11-12 02:29:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045735528] [2023-11-12 02:29:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:29:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:29:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:29:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045735528] [2023-11-12 02:29:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045735528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:29:59,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:29:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:29:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502712173] [2023-11-12 02:29:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:29:59,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:29:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:29:59,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:29:59,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:29:59,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 180 [2023-11-12 02:29:59,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 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) [2023-11-12 02:29:59,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:29:59,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 180 [2023-11-12 02:29:59,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:29:59,215 INFO L124 PetriNetUnfolderBase]: 58/144 cut-off events. [2023-11-12 02:29:59,215 INFO L125 PetriNetUnfolderBase]: For 418/427 co-relation queries the response was YES. [2023-11-12 02:29:59,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 144 events. 58/144 cut-off events. For 418/427 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 539 event pairs, 9 based on Foata normal form. 26/169 useless extension candidates. Maximal degree in co-relation 504. Up to 64 conditions per place. [2023-11-12 02:29:59,217 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 29 selfloop transitions, 5 changer transitions 14/53 dead transitions. [2023-11-12 02:29:59,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 415 flow [2023-11-12 02:29:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:29:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:29:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2023-11-12 02:29:59,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-11-12 02:29:59,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 426 transitions. [2023-11-12 02:29:59,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 426 transitions. [2023-11-12 02:29:59,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:29:59,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 426 transitions. [2023-11-12 02:29:59,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 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) [2023-11-12 02:29:59,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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) [2023-11-12 02:29:59,227 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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) [2023-11-12 02:29:59,227 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 227 flow. Second operand 5 states and 426 transitions. [2023-11-12 02:29:59,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 415 flow [2023-11-12 02:29:59,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 347 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-11-12 02:29:59,235 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 156 flow [2023-11-12 02:29:59,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-12 02:29:59,237 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2023-11-12 02:29:59,238 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 156 flow [2023-11-12 02:29:59,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 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) [2023-11-12 02:29:59,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:59,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:29:59,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:29:59,239 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:59,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1674888255, now seen corresponding path program 1 times [2023-11-12 02:29:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:59,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862625290] [2023-11-12 02:29:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:29:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:29:59,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:29:59,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862625290] [2023-11-12 02:29:59,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862625290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:29:59,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:29:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:29:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132575857] [2023-11-12 02:29:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:29:59,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:29:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:29:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:29:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:29:59,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 180 [2023-11-12 02:29:59,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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) [2023-11-12 02:29:59,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:29:59,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 180 [2023-11-12 02:29:59,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:29:59,633 INFO L124 PetriNetUnfolderBase]: 42/111 cut-off events. [2023-11-12 02:29:59,633 INFO L125 PetriNetUnfolderBase]: For 273/280 co-relation queries the response was YES. [2023-11-12 02:29:59,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 111 events. 42/111 cut-off events. For 273/280 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 377 event pairs, 6 based on Foata normal form. 11/121 useless extension candidates. Maximal degree in co-relation 380. Up to 35 conditions per place. [2023-11-12 02:29:59,635 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 26 selfloop transitions, 7 changer transitions 15/53 dead transitions. [2023-11-12 02:29:59,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 384 flow [2023-11-12 02:29:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:29:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:29:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 582 transitions. [2023-11-12 02:29:59,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2023-11-12 02:29:59,639 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 582 transitions. [2023-11-12 02:29:59,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 582 transitions. [2023-11-12 02:29:59,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:29:59,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 582 transitions. [2023-11-12 02:29:59,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 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) [2023-11-12 02:29:59,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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) [2023-11-12 02:29:59,646 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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) [2023-11-12 02:29:59,646 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 156 flow. Second operand 7 states and 582 transitions. [2023-11-12 02:29:59,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 384 flow [2023-11-12 02:29:59,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 376 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-12 02:29:59,650 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 172 flow [2023-11-12 02:29:59,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-11-12 02:29:59,651 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 22 predicate places. [2023-11-12 02:29:59,651 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 172 flow [2023-11-12 02:29:59,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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) [2023-11-12 02:29:59,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:29:59,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:29:59,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:29:59,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:29:59,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:29:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash -11970849, now seen corresponding path program 1 times [2023-11-12 02:29:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:29:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589909124] [2023-11-12 02:29:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:29:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:29:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:30:00,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589909124] [2023-11-12 02:30:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589909124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:00,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:00,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:30:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310653683] [2023-11-12 02:30:00,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:00,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:30:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:30:00,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:00,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 180 [2023-11-12 02:30:00,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 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) [2023-11-12 02:30:00,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:30:00,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 180 [2023-11-12 02:30:00,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:30:00,533 INFO L124 PetriNetUnfolderBase]: 79/189 cut-off events. [2023-11-12 02:30:00,533 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2023-11-12 02:30:00,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 189 events. 79/189 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 708 event pairs, 10 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 721. Up to 97 conditions per place. [2023-11-12 02:30:00,535 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 22 selfloop transitions, 3 changer transitions 28/55 dead transitions. [2023-11-12 02:30:00,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 449 flow [2023-11-12 02:30:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:30:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:30:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2023-11-12 02:30:00,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2023-11-12 02:30:00,539 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 475 transitions. [2023-11-12 02:30:00,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 475 transitions. [2023-11-12 02:30:00,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:30:00,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 475 transitions. [2023-11-12 02:30:00,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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) [2023-11-12 02:30:00,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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) [2023-11-12 02:30:00,546 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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) [2023-11-12 02:30:00,546 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 172 flow. Second operand 6 states and 475 transitions. [2023-11-12 02:30:00,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 449 flow [2023-11-12 02:30:00,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 401 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-11-12 02:30:00,550 INFO L231 Difference]: Finished difference. Result has 47 places, 24 transitions, 135 flow [2023-11-12 02:30:00,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=24} [2023-11-12 02:30:00,552 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 22 predicate places. [2023-11-12 02:30:00,552 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 24 transitions, 135 flow [2023-11-12 02:30:00,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 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) [2023-11-12 02:30:00,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:30:00,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:00,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:30:00,553 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:30:00,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash -176408309, now seen corresponding path program 2 times [2023-11-12 02:30:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149245314] [2023-11-12 02:30:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:00,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:30:00,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:30:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:30:00,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:30:00,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:30:00,681 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-12 02:30:00,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-12 02:30:00,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-12 02:30:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-12 02:30:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-12 02:30:00,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:30:00,685 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-11-12 02:30:00,692 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:30:00,692 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:30:00,743 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:30:00,746 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:30:00,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:30:00 BasicIcfg [2023-11-12 02:30:00,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:30:00,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:30:00,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:30:00,786 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:30:00,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:29:48" (3/4) ... [2023-11-12 02:30:00,788 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:30:00,820 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 02:30:00,821 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:30:00,917 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:30:00,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:30:00,918 INFO L158 Benchmark]: Toolchain (without parser) took 13955.15ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 115.2MB in the beginning and 118.5MB in the end (delta: -3.3MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2023-11-12 02:30:00,919 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 153.1MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:30:00,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.13ms. Allocated memory is still 153.1MB. Free memory was 114.7MB in the beginning and 92.0MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:30:00,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.77ms. Allocated memory is still 153.1MB. Free memory was 92.0MB in the beginning and 89.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:30:00,920 INFO L158 Benchmark]: Boogie Preprocessor took 72.24ms. Allocated memory is still 153.1MB. Free memory was 89.6MB in the beginning and 87.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:30:00,921 INFO L158 Benchmark]: RCFGBuilder took 934.68ms. Allocated memory is still 153.1MB. Free memory was 87.5MB in the beginning and 54.4MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-12 02:30:00,921 INFO L158 Benchmark]: TraceAbstraction took 12012.88ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 53.9MB in the beginning and 124.8MB in the end (delta: -70.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:30:00,922 INFO L158 Benchmark]: Witness Printer took 132.20ms. Allocated memory is still 209.7MB. Free memory was 124.8MB in the beginning and 118.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:30:00,924 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.24ms. Allocated memory is still 153.1MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.13ms. Allocated memory is still 153.1MB. Free memory was 114.7MB in the beginning and 92.0MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.77ms. Allocated memory is still 153.1MB. Free memory was 92.0MB in the beginning and 89.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.24ms. Allocated memory is still 153.1MB. Free memory was 89.6MB in the beginning and 87.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 934.68ms. Allocated memory is still 153.1MB. Free memory was 87.5MB in the beginning and 54.4MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12012.88ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 53.9MB in the beginning and 124.8MB in the end (delta: -70.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 132.20ms. Allocated memory is still 209.7MB. Free memory was 124.8MB in the beginning and 118.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 97 PlacesBefore, 25 PlacesAfterwards, 92 TransitionsBefore, 18 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 3308 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1606, independent: 1459, independent conditional: 0, independent unconditional: 1459, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 740, independent: 710, independent conditional: 0, independent unconditional: 710, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1606, independent: 749, independent conditional: 0, independent unconditional: 749, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 740, unknown conditional: 0, unknown unconditional: 740] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5: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, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, t1092={3: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, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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, z=1] [L746] 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) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 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 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 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) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 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 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3: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=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 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) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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, 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: 803]: 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: 805]: 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, 114 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: 11.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 488 IncrementalHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 50 mSDtfsCounter, 488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 3.4s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:30:00,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6290a2ff-7659-456e-8257-257aa263211f/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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