./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:24:10,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:24:10,091 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:24:10,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:24:10,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:24:10,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:24:10,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:24:10,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:24:10,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:24:10,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:24:10,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:24:10,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:24:10,127 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:24:10,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:24:10,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:24:10,129 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:24:10,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:24:10,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:24:10,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:24:10,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:24:10,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:24:10,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:24:10,133 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:24:10,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:24:10,134 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:24:10,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:24:10,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:24:10,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:24:10,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:10,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:24:10,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:24:10,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:24:10,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:24:10,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:24:10,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:24:10,140 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:24:10,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:24:10,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:24:10,141 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:24:10,142 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_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/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_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f [2023-11-06 22:24:10,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:24:10,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:24:10,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:24:10,494 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:24:10,494 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:24:10,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe002_rmo.oepc.i [2023-11-06 22:24:13,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:24:14,065 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:24:14,068 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/sv-benchmarks/c/pthread-wmm/safe002_rmo.oepc.i [2023-11-06 22:24:14,090 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/data/d29eb43dc/0494a628a50049d4b91197cf8c6d41ab/FLAGa01dff918 [2023-11-06 22:24:14,105 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/data/d29eb43dc/0494a628a50049d4b91197cf8c6d41ab [2023-11-06 22:24:14,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:24:14,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:24:14,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:14,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:24:14,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:24:14,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe47a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14, skipping insertion in model container [2023-11-06 22:24:14,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,175 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:24:14,387 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_d0bb1369-1d37-454f-b38b-48c5815d8a0e/sv-benchmarks/c/pthread-wmm/safe002_rmo.oepc.i[993,1006] [2023-11-06 22:24:14,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:14,639 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:24:14,654 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_d0bb1369-1d37-454f-b38b-48c5815d8a0e/sv-benchmarks/c/pthread-wmm/safe002_rmo.oepc.i[993,1006] [2023-11-06 22:24:14,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:14,813 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:24:14,813 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:24:14,821 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:24:14,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14 WrapperNode [2023-11-06 22:24:14,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:14,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:14,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:24:14,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:24:14,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,938 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2023-11-06 22:24:14,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:14,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:24:14,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:24:14,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:24:14,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:24:14,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:24:14,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:24:14,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:24:14,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (1/1) ... [2023-11-06 22:24:14,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:15,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:24:15,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:24:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:24:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:24:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:24:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:24:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:24:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:24:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:24:15,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:24:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:24:15,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:24:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:24:15,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:24:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:24:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:24:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:24:15,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:24:15,091 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:24:15,279 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:24:15,281 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:24:15,922 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:24:16,357 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:24:16,357 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:24:16,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:16 BoogieIcfgContainer [2023-11-06 22:24:16,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:24:16,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:24:16,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:24:16,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:24:16,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:14" (1/3) ... [2023-11-06 22:24:16,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2800e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:16, skipping insertion in model container [2023-11-06 22:24:16,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:14" (2/3) ... [2023-11-06 22:24:16,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2800e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:16, skipping insertion in model container [2023-11-06 22:24:16,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:16" (3/3) ... [2023-11-06 22:24:16,377 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2023-11-06 22:24:16,386 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:24:16,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:24:16,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:24:16,397 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:24:16,485 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:24:16,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 128 transitions, 268 flow [2023-11-06 22:24:16,628 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-11-06 22:24:16,629 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:16,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-11-06 22:24:16,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 128 transitions, 268 flow [2023-11-06 22:24:16,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2023-11-06 22:24:16,682 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:24:16,696 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2023-11-06 22:24:16,701 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2023-11-06 22:24:16,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2023-11-06 22:24:16,763 INFO L124 PetriNetUnfolderBase]: 1/110 cut-off events. [2023-11-06 22:24:16,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:16,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-11-06 22:24:16,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 1252 [2023-11-06 22:24:26,554 INFO L134 LiptonReduction]: Checked pairs total: 3512 [2023-11-06 22:24:26,554 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-11-06 22:24:26,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:26,577 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=LoopsAndPotentialCycles, 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;@59b53780, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:26,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 22:24:26,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:24:26,586 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-11-06 22:24:26,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:26,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:26,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:26,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:26,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1192841759, now seen corresponding path program 1 times [2023-11-06 22:24:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853916413] [2023-11-06 22:24:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,951 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-06 22:24:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853916413] [2023-11-06 22:24:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853916413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:26,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:26,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209063345] [2023-11-06 22:24:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:26,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:24:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:26,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:24:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:24:27,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 220 [2023-11-06 22:24:27,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 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-06 22:24:27,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:27,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 220 [2023-11-06 22:24:27,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:27,400 INFO L124 PetriNetUnfolderBase]: 511/798 cut-off events. [2023-11-06 22:24:27,400 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-06 22:24:27,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 798 events. 511/798 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3458 event pairs, 511 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1606. Up to 783 conditions per place. [2023-11-06 22:24:27,416 INFO L140 encePairwiseOnDemand]: 219/220 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-06 22:24:27,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 87 flow [2023-11-06 22:24:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:24:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:24:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 251 transitions. [2023-11-06 22:24:27,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5704545454545454 [2023-11-06 22:24:27,438 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 251 transitions. [2023-11-06 22:24:27,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 251 transitions. [2023-11-06 22:24:27,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:27,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 251 transitions. [2023-11-06 22:24:27,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.5) internal successors, (251), 2 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-06 22:24:27,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-06 22:24:27,471 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-06 22:24:27,473 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 251 transitions. [2023-11-06 22:24:27,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 87 flow [2023-11-06 22:24:27,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:27,478 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 48 flow [2023-11-06 22:24:27,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-11-06 22:24:27,483 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-11-06 22:24:27,484 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 48 flow [2023-11-06 22:24:27,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 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-06 22:24:27,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:27,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:27,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:24:27,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:27,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1675827722, now seen corresponding path program 1 times [2023-11-06 22:24:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637914748] [2023-11-06 22:24:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:28,060 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-06 22:24:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637914748] [2023-11-06 22:24:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637914748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545046187] [2023-11-06 22:24:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:28,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:28,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 220 [2023-11-06 22:24:28,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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-06 22:24:28,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:28,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 220 [2023-11-06 22:24:28,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:28,447 INFO L124 PetriNetUnfolderBase]: 521/871 cut-off events. [2023-11-06 22:24:28,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:28,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 871 events. 521/871 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4190 event pairs, 126 based on Foata normal form. 48/915 useless extension candidates. Maximal degree in co-relation 1719. Up to 556 conditions per place. [2023-11-06 22:24:28,455 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 23 selfloop transitions, 2 changer transitions 14/42 dead transitions. [2023-11-06 22:24:28,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 168 flow [2023-11-06 22:24:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:24:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-11-06 22:24:28,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5509090909090909 [2023-11-06 22:24:28,461 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-11-06 22:24:28,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-11-06 22:24:28,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:28,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-11-06 22:24:28,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 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-06 22:24:28,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:28,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:28,470 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 48 flow. Second operand 5 states and 606 transitions. [2023-11-06 22:24:28,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 168 flow [2023-11-06 22:24:28,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:24:28,472 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 60 flow [2023-11-06 22:24:28,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-11-06 22:24:28,474 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-11-06 22:24:28,474 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 60 flow [2023-11-06 22:24:28,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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-06 22:24:28,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:28,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:28,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:24:28,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:28,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash 411068930, now seen corresponding path program 1 times [2023-11-06 22:24:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:28,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058058218] [2023-11-06 22:24:28,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:28,983 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-06 22:24:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:28,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058058218] [2023-11-06 22:24:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058058218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539632635] [2023-11-06 22:24:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:28,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:24:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:24:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:29,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 220 [2023-11-06 22:24:29,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 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-06 22:24:29,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:29,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 220 [2023-11-06 22:24:29,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:29,386 INFO L124 PetriNetUnfolderBase]: 446/743 cut-off events. [2023-11-06 22:24:29,386 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2023-11-06 22:24:29,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 743 events. 446/743 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3321 event pairs, 207 based on Foata normal form. 36/775 useless extension candidates. Maximal degree in co-relation 1637. Up to 497 conditions per place. [2023-11-06 22:24:29,395 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 28 selfloop transitions, 2 changer transitions 13/46 dead transitions. [2023-11-06 22:24:29,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 205 flow [2023-11-06 22:24:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:24:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2023-11-06 22:24:29,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2023-11-06 22:24:29,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 615 transitions. [2023-11-06 22:24:29,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 615 transitions. [2023-11-06 22:24:29,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:29,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 615 transitions. [2023-11-06 22:24:29,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 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-06 22:24:29,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:29,408 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:29,409 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 60 flow. Second operand 5 states and 615 transitions. [2023-11-06 22:24:29,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 205 flow [2023-11-06 22:24:29,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 195 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:24:29,415 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 64 flow [2023-11-06 22:24:29,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-11-06 22:24:29,417 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-11-06 22:24:29,421 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 64 flow [2023-11-06 22:24:29,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 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-06 22:24:29,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:29,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:29,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:24:29,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:29,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash -173029469, now seen corresponding path program 1 times [2023-11-06 22:24:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:29,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259730058] [2023-11-06 22:24:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,373 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-06 22:24:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259730058] [2023-11-06 22:24:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259730058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:30,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17972762] [2023-11-06 22:24:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:30,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:30,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:30,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 220 [2023-11-06 22:24:30,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 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-06 22:24:30,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:30,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 220 [2023-11-06 22:24:30,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:31,081 INFO L124 PetriNetUnfolderBase]: 847/1306 cut-off events. [2023-11-06 22:24:31,082 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2023-11-06 22:24:31,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1306 events. 847/1306 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5852 event pairs, 157 based on Foata normal form. 40/1345 useless extension candidates. Maximal degree in co-relation 3117. Up to 465 conditions per place. [2023-11-06 22:24:31,090 INFO L140 encePairwiseOnDemand]: 214/220 looper letters, 29 selfloop transitions, 3 changer transitions 31/64 dead transitions. [2023-11-06 22:24:31,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 300 flow [2023-11-06 22:24:31,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:24:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 898 transitions. [2023-11-06 22:24:31,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102272727272728 [2023-11-06 22:24:31,095 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 898 transitions. [2023-11-06 22:24:31,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 898 transitions. [2023-11-06 22:24:31,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:31,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 898 transitions. [2023-11-06 22:24:31,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 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-06 22:24:31,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 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-06 22:24:31,137 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 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-06 22:24:31,137 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 64 flow. Second operand 8 states and 898 transitions. [2023-11-06 22:24:31,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 300 flow [2023-11-06 22:24:31,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 286 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:24:31,143 INFO L231 Difference]: Finished difference. Result has 44 places, 21 transitions, 82 flow [2023-11-06 22:24:31,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=21} [2023-11-06 22:24:31,144 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2023-11-06 22:24:31,145 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 21 transitions, 82 flow [2023-11-06 22:24:31,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 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-06 22:24:31,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:31,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:31,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:24:31,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:31,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash 277096457, now seen corresponding path program 1 times [2023-11-06 22:24:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335127977] [2023-11-06 22:24:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,599 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-06 22:24:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335127977] [2023-11-06 22:24:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335127977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:32,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:32,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681025807] [2023-11-06 22:24:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:32,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:32,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220 [2023-11-06 22:24:32,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 21 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 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-06 22:24:32,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:32,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220 [2023-11-06 22:24:32,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:33,047 INFO L124 PetriNetUnfolderBase]: 479/763 cut-off events. [2023-11-06 22:24:33,047 INFO L125 PetriNetUnfolderBase]: For 687/687 co-relation queries the response was YES. [2023-11-06 22:24:33,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 763 events. 479/763 cut-off events. For 687/687 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3084 event pairs, 334 based on Foata normal form. 24/786 useless extension candidates. Maximal degree in co-relation 2088. Up to 665 conditions per place. [2023-11-06 22:24:33,054 INFO L140 encePairwiseOnDemand]: 212/220 looper letters, 23 selfloop transitions, 6 changer transitions 10/40 dead transitions. [2023-11-06 22:24:33,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 227 flow [2023-11-06 22:24:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:24:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions. [2023-11-06 22:24:33,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174242424242425 [2023-11-06 22:24:33,058 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 683 transitions. [2023-11-06 22:24:33,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions. [2023-11-06 22:24:33,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:33,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions. [2023-11-06 22:24:33,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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-06 22:24:33,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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-06 22:24:33,065 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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-06 22:24:33,066 INFO L175 Difference]: Start difference. First operand has 44 places, 21 transitions, 82 flow. Second operand 6 states and 683 transitions. [2023-11-06 22:24:33,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 227 flow [2023-11-06 22:24:33,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 207 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-06 22:24:33,070 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 115 flow [2023-11-06 22:24:33,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-11-06 22:24:33,071 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-11-06 22:24:33,071 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 115 flow [2023-11-06 22:24:33,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 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-06 22:24:33,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:33,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:33,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:24:33,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:33,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash 198332897, now seen corresponding path program 2 times [2023-11-06 22:24:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:33,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726805163] [2023-11-06 22:24:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,256 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-06 22:24:34,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726805163] [2023-11-06 22:24:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726805163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:34,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:34,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085797017] [2023-11-06 22:24:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:34,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:34,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 220 [2023-11-06 22:24:34,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 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-06 22:24:34,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:34,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 220 [2023-11-06 22:24:34,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:34,860 INFO L124 PetriNetUnfolderBase]: 588/944 cut-off events. [2023-11-06 22:24:34,860 INFO L125 PetriNetUnfolderBase]: For 1140/1140 co-relation queries the response was YES. [2023-11-06 22:24:34,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 944 events. 588/944 cut-off events. For 1140/1140 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4212 event pairs, 109 based on Foata normal form. 24/968 useless extension candidates. Maximal degree in co-relation 2935. Up to 538 conditions per place. [2023-11-06 22:24:34,871 INFO L140 encePairwiseOnDemand]: 209/220 looper letters, 30 selfloop transitions, 22 changer transitions 11/64 dead transitions. [2023-11-06 22:24:34,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 406 flow [2023-11-06 22:24:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:24:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 898 transitions. [2023-11-06 22:24:34,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102272727272728 [2023-11-06 22:24:34,877 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 898 transitions. [2023-11-06 22:24:34,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 898 transitions. [2023-11-06 22:24:34,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:34,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 898 transitions. [2023-11-06 22:24:34,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 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-06 22:24:34,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 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-06 22:24:34,888 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 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-06 22:24:34,889 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 115 flow. Second operand 8 states and 898 transitions. [2023-11-06 22:24:34,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 406 flow [2023-11-06 22:24:34,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 377 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:34,897 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 260 flow [2023-11-06 22:24:34,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-06 22:24:34,900 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-11-06 22:24:34,900 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 260 flow [2023-11-06 22:24:34,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 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-06 22:24:34,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:34,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:24:34,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:34,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 861126534, now seen corresponding path program 1 times [2023-11-06 22:24:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862552459] [2023-11-06 22:24:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,268 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-06 22:24:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:35,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862552459] [2023-11-06 22:24:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862552459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:35,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:35,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317702099] [2023-11-06 22:24:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:35,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:24:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:24:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:35,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 220 [2023-11-06 22:24:35,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 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-06 22:24:35,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:35,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 220 [2023-11-06 22:24:35,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:35,635 INFO L124 PetriNetUnfolderBase]: 422/731 cut-off events. [2023-11-06 22:24:35,636 INFO L125 PetriNetUnfolderBase]: For 1694/1720 co-relation queries the response was YES. [2023-11-06 22:24:35,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2604 conditions, 731 events. 422/731 cut-off events. For 1694/1720 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3412 event pairs, 52 based on Foata normal form. 98/823 useless extension candidates. Maximal degree in co-relation 2589. Up to 431 conditions per place. [2023-11-06 22:24:35,645 INFO L140 encePairwiseOnDemand]: 214/220 looper letters, 74 selfloop transitions, 7 changer transitions 7/94 dead transitions. [2023-11-06 22:24:35,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 746 flow [2023-11-06 22:24:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:24:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-11-06 22:24:35,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5445454545454546 [2023-11-06 22:24:35,649 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-11-06 22:24:35,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-11-06 22:24:35,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:35,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-11-06 22:24:35,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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-06 22:24:35,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:35,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:35,657 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 260 flow. Second operand 5 states and 599 transitions. [2023-11-06 22:24:35,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 746 flow [2023-11-06 22:24:35,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 725 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-06 22:24:35,672 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 315 flow [2023-11-06 22:24:35,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-11-06 22:24:35,674 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2023-11-06 22:24:35,674 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 315 flow [2023-11-06 22:24:35,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 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-06 22:24:35,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:35,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:35,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:24:35,675 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:35,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash -887802131, now seen corresponding path program 1 times [2023-11-06 22:24:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:35,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951353484] [2023-11-06 22:24:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,943 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-06 22:24:35,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:35,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951353484] [2023-11-06 22:24:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951353484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:35,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610361711] [2023-11-06 22:24:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:35,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:35,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:35,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:35,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 220 [2023-11-06 22:24:35,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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-06 22:24:35,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:35,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 220 [2023-11-06 22:24:35,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:36,483 INFO L124 PetriNetUnfolderBase]: 793/1384 cut-off events. [2023-11-06 22:24:36,483 INFO L125 PetriNetUnfolderBase]: For 3406/3439 co-relation queries the response was YES. [2023-11-06 22:24:36,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 1384 events. 793/1384 cut-off events. For 3406/3439 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7110 event pairs, 119 based on Foata normal form. 32/1416 useless extension candidates. Maximal degree in co-relation 5739. Up to 719 conditions per place. [2023-11-06 22:24:36,497 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 68 selfloop transitions, 2 changer transitions 16/91 dead transitions. [2023-11-06 22:24:36,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 785 flow [2023-11-06 22:24:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:24:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-11-06 22:24:36,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2023-11-06 22:24:36,501 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-11-06 22:24:36,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-11-06 22:24:36,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:36,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-11-06 22:24:36,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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-06 22:24:36,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:36,507 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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-06 22:24:36,507 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 315 flow. Second operand 5 states and 594 transitions. [2023-11-06 22:24:36,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 785 flow [2023-11-06 22:24:36,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 91 transitions, 771 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:24:36,520 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 300 flow [2023-11-06 22:24:36,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-11-06 22:24:36,522 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2023-11-06 22:24:36,522 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 300 flow [2023-11-06 22:24:36,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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-06 22:24:36,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:36,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:36,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:24:36,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:36,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash -254856615, now seen corresponding path program 2 times [2023-11-06 22:24:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981410884] [2023-11-06 22:24:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,798 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-06 22:24:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981410884] [2023-11-06 22:24:36,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981410884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:36,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:36,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254830393] [2023-11-06 22:24:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:36,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:36,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:36,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:36,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 220 [2023-11-06 22:24:36,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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-06 22:24:36,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:36,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 220 [2023-11-06 22:24:36,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:37,252 INFO L124 PetriNetUnfolderBase]: 392/746 cut-off events. [2023-11-06 22:24:37,252 INFO L125 PetriNetUnfolderBase]: For 2241/2292 co-relation queries the response was YES. [2023-11-06 22:24:37,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 746 events. 392/746 cut-off events. For 2241/2292 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3862 event pairs, 18 based on Foata normal form. 115/853 useless extension candidates. Maximal degree in co-relation 3009. Up to 295 conditions per place. [2023-11-06 22:24:37,260 INFO L140 encePairwiseOnDemand]: 214/220 looper letters, 80 selfloop transitions, 11 changer transitions 10/108 dead transitions. [2023-11-06 22:24:37,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 904 flow [2023-11-06 22:24:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:24:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2023-11-06 22:24:37,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409090909090909 [2023-11-06 22:24:37,265 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2023-11-06 22:24:37,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2023-11-06 22:24:37,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:37,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2023-11-06 22:24:37,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 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-06 22:24:37,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 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-06 22:24:37,275 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 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-06 22:24:37,276 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 300 flow. Second operand 7 states and 833 transitions. [2023-11-06 22:24:37,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 904 flow [2023-11-06 22:24:37,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 894 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:37,288 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 355 flow [2023-11-06 22:24:37,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=355, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-06 22:24:37,289 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2023-11-06 22:24:37,289 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 355 flow [2023-11-06 22:24:37,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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-06 22:24:37,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:37,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:37,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:24:37,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:37,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash -764528459, now seen corresponding path program 1 times [2023-11-06 22:24:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:37,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793482860] [2023-11-06 22:24:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:37,674 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-06 22:24:37,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:37,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793482860] [2023-11-06 22:24:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793482860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462524789] [2023-11-06 22:24:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:37,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:37,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:37,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 220 [2023-11-06 22:24:37,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 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-06 22:24:37,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:37,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 220 [2023-11-06 22:24:37,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:38,098 INFO L124 PetriNetUnfolderBase]: 347/670 cut-off events. [2023-11-06 22:24:38,099 INFO L125 PetriNetUnfolderBase]: For 2284/2324 co-relation queries the response was YES. [2023-11-06 22:24:38,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 670 events. 347/670 cut-off events. For 2284/2324 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3542 event pairs, 10 based on Foata normal form. 56/715 useless extension candidates. Maximal degree in co-relation 3040. Up to 270 conditions per place. [2023-11-06 22:24:38,105 INFO L140 encePairwiseOnDemand]: 214/220 looper letters, 55 selfloop transitions, 15 changer transitions 32/107 dead transitions. [2023-11-06 22:24:38,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 938 flow [2023-11-06 22:24:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:24:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:24:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1053 transitions. [2023-11-06 22:24:38,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2023-11-06 22:24:38,111 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1053 transitions. [2023-11-06 22:24:38,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1053 transitions. [2023-11-06 22:24:38,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:38,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1053 transitions. [2023-11-06 22:24:38,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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-06 22:24:38,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 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-06 22:24:38,123 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 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-06 22:24:38,123 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 355 flow. Second operand 9 states and 1053 transitions. [2023-11-06 22:24:38,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 938 flow [2023-11-06 22:24:38,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 869 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-06 22:24:38,140 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 314 flow [2023-11-06 22:24:38,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2023-11-06 22:24:38,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2023-11-06 22:24:38,142 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 314 flow [2023-11-06 22:24:38,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 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-06 22:24:38,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:38,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:38,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:24:38,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 22:24:38,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1274504952, now seen corresponding path program 1 times [2023-11-06 22:24:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802275107] [2023-11-06 22:24:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:38,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:24:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:38,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:24:38,514 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:24:38,516 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-06 22:24:38,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-06 22:24:38,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-06 22:24:38,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-06 22:24:38,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:24:38,520 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:38,525 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:24:38,525 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:24:38,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:38 BasicIcfg [2023-11-06 22:24:38,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:24:38,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:24:38,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:24:38,680 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:24:38,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:16" (3/4) ... [2023-11-06 22:24:38,681 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:24:38,816 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:24:38,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:24:38,817 INFO L158 Benchmark]: Toolchain (without parser) took 24705.21ms. Allocated memory was 140.5MB in the beginning and 453.0MB in the end (delta: 312.5MB). Free memory was 93.2MB in the beginning and 274.4MB in the end (delta: -181.1MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2023-11-06 22:24:38,817 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:38,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.32ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 67.3MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-06 22:24:38,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.61ms. Allocated memory is still 140.5MB. Free memory was 67.3MB in the beginning and 109.0MB in the end (delta: -41.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-11-06 22:24:38,818 INFO L158 Benchmark]: Boogie Preprocessor took 43.97ms. Allocated memory is still 140.5MB. Free memory was 109.0MB in the beginning and 106.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:38,819 INFO L158 Benchmark]: RCFGBuilder took 1377.96ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 76.3MB in the end (delta: 30.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2023-11-06 22:24:38,819 INFO L158 Benchmark]: TraceAbstraction took 22312.57ms. Allocated memory was 140.5MB in the beginning and 453.0MB in the end (delta: 312.5MB). Free memory was 75.7MB in the beginning and 290.1MB in the end (delta: -214.4MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2023-11-06 22:24:38,820 INFO L158 Benchmark]: Witness Printer took 137.18ms. Allocated memory is still 453.0MB. Free memory was 289.0MB in the beginning and 274.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:24:38,824 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.31ms. Allocated memory is still 109.1MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.32ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 67.3MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.61ms. Allocated memory is still 140.5MB. Free memory was 67.3MB in the beginning and 109.0MB in the end (delta: -41.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.97ms. Allocated memory is still 140.5MB. Free memory was 109.0MB in the beginning and 106.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1377.96ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 76.3MB in the end (delta: 30.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22312.57ms. Allocated memory was 140.5MB in the beginning and 453.0MB in the end (delta: 312.5MB). Free memory was 75.7MB in the beginning and 290.1MB in the end (delta: -214.4MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Witness Printer took 137.18ms. Allocated memory is still 453.0MB. Free memory was 289.0MB in the beginning and 274.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9s, 119 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 22 TransitionsAfterwards, 1252 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3512 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1342, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 641, independent: 606, independent conditional: 0, independent unconditional: 606, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1342, independent: 563, independent conditional: 0, independent unconditional: 563, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 641, unknown conditional: 0, unknown unconditional: 641] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1837; [L853] FCALL, FORK 0 pthread_create(&t1837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1837, ((void *)0), P0, ((void *)0))=-3, t1837={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1838; [L855] FCALL, FORK 0 pthread_create(&t1838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1838, ((void *)0), P1, ((void *)0))=-2, t1837={6:0}, t1838={7:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1839; [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1839, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1839, ((void *)0), P2, ((void *)0))=-1, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 857]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 4 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: 22.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 549 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127 IncrementalHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 82 mSDtfsCounter, 1127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-06 22:24:38,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bb1369-1d37-454f-b38b-48c5815d8a0e/bin/uautomizer-verify-WvqO1wxjHP/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