./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:24:40,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:24:40,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:24:40,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:24:40,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:24:40,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:24:40,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:24:40,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:24:40,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:24:40,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:24:40,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:24:40,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:24:40,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:24:40,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:24:40,321 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:24:40,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:24:40,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:24:40,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:24:40,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:24:40,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:24:40,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:24:40,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:24:40,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:24:40,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:24:40,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:24:40,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:24:40,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:24:40,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:24:40,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:24:40,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:24:40,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:24:40,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:24:40,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:24:40,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:24:40,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:24:40,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:24:40,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:24:40,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:24:40,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:24:40,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:24:40,328 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:24:40,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:24:40,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:24:40,328 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2024-06-27 17:24:40,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:24:40,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:24:40,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:24:40,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:24:40,582 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:24:40,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2024-06-27 17:24:41,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:24:41,849 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:24:41,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2024-06-27 17:24:41,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e45862a/bbee017243324681a9c861a15ce7e57c/FLAGc0dc04caf [2024-06-27 17:24:41,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e45862a/bbee017243324681a9c861a15ce7e57c [2024-06-27 17:24:41,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:24:41,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:24:41,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:24:41,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:24:41,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:24:41,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:24:41" (1/1) ... [2024-06-27 17:24:41,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d537171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:41, skipping insertion in model container [2024-06-27 17:24:41,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:24:41" (1/1) ... [2024-06-27 17:24:41,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:24:42,110 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i[945,958] [2024-06-27 17:24:42,297 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:24:42,329 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:24:42,337 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i[945,958] [2024-06-27 17:24:42,372 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:24:42,405 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:24:42,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42 WrapperNode [2024-06-27 17:24:42,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:24:42,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:24:42,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:24:42,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:24:42,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,466 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-06-27 17:24:42,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:24:42,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:24:42,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:24:42,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:24:42,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 17:24:42,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:24:42,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:24:42,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:24:42,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:24:42,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (1/1) ... [2024-06-27 17:24:42,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:24:42,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:24:42,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:24:42,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:24:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:24:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:24:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:24:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:24:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:24:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:24:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:24:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:24:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:24:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:24:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:24:42,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:24:42,786 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:24:42,896 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:24:42,898 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:24:43,087 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:24:43,087 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:24:43,238 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:24:43,242 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:24:43,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:24:43 BoogieIcfgContainer [2024-06-27 17:24:43,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:24:43,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:24:43,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:24:43,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:24:43,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:24:41" (1/3) ... [2024-06-27 17:24:43,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b14552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:24:43, skipping insertion in model container [2024-06-27 17:24:43,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:24:42" (2/3) ... [2024-06-27 17:24:43,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b14552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:24:43, skipping insertion in model container [2024-06-27 17:24:43,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:24:43" (3/3) ... [2024-06-27 17:24:43,251 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2024-06-27 17:24:43,257 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:24:43,264 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:24:43,265 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:24:43,265 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:24:43,305 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:24:43,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 98 flow [2024-06-27 17:24:43,363 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2024-06-27 17:24:43,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:24:43,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 1/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-06-27 17:24:43,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 98 flow [2024-06-27 17:24:43,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 89 flow [2024-06-27 17:24:43,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:24:43,393 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@395b0fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:24:43,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 17:24:43,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:24:43,400 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 17:24:43,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:24:43,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:43,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-06-27 17:24:43,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:43,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash 11482530, now seen corresponding path program 1 times [2024-06-27 17:24:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463727205] [2024-06-27 17:24:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463727205] [2024-06-27 17:24:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463727205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:43,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:24:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567276389] [2024-06-27 17:24:43,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:43,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:24:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:24:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:24:43,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2024-06-27 17:24:43,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:43,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:43,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2024-06-27 17:24:43,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:44,049 INFO L124 PetriNetUnfolderBase]: 617/1321 cut-off events. [2024-06-27 17:24:44,050 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-06-27 17:24:44,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 1321 events. 617/1321 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9054 event pairs, 95 based on Foata normal form. 45/1342 useless extension candidates. Maximal degree in co-relation 2287. Up to 763 conditions per place. [2024-06-27 17:24:44,062 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 29 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-06-27 17:24:44,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 185 flow [2024-06-27 17:24:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:24:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:24:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-06-27 17:24:44,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7906976744186046 [2024-06-27 17:24:44,075 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 102 transitions. [2024-06-27 17:24:44,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 185 flow [2024-06-27 17:24:44,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:24:44,083 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-06-27 17:24:44,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-06-27 17:24:44,087 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-06-27 17:24:44,088 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-06-27 17:24:44,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:44,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:44,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:44,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:24:44,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:44,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -397751217, now seen corresponding path program 1 times [2024-06-27 17:24:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949125881] [2024-06-27 17:24:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:44,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949125881] [2024-06-27 17:24:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949125881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:44,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:44,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:24:44,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446528189] [2024-06-27 17:24:44,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:44,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:24:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:24:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:24:44,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-06-27 17:24:44,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:44,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:44,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-06-27 17:24:44,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:44,742 INFO L124 PetriNetUnfolderBase]: 1280/2118 cut-off events. [2024-06-27 17:24:44,742 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-06-27 17:24:44,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4242 conditions, 2118 events. 1280/2118 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13591 event pairs, 205 based on Foata normal form. 0/2038 useless extension candidates. Maximal degree in co-relation 4232. Up to 1065 conditions per place. [2024-06-27 17:24:44,752 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 27 selfloop transitions, 2 changer transitions 42/86 dead transitions. [2024-06-27 17:24:44,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 336 flow [2024-06-27 17:24:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:24:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:24:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 17:24:44,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6308139534883721 [2024-06-27 17:24:44,759 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 8 states and 217 transitions. [2024-06-27 17:24:44,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 336 flow [2024-06-27 17:24:44,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:24:44,774 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 94 flow [2024-06-27 17:24:44,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2024-06-27 17:24:44,775 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-06-27 17:24:44,775 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 94 flow [2024-06-27 17:24:44,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:44,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:44,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:44,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:24:44,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:44,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 490270560, now seen corresponding path program 1 times [2024-06-27 17:24:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:44,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728190578] [2024-06-27 17:24:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728190578] [2024-06-27 17:24:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728190578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:24:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710620526] [2024-06-27 17:24:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:44,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:24:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:44,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:24:44,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:24:45,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 17:24:45,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:45,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:45,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 17:24:45,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:45,543 INFO L124 PetriNetUnfolderBase]: 2463/3926 cut-off events. [2024-06-27 17:24:45,544 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2024-06-27 17:24:45,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8545 conditions, 3926 events. 2463/3926 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 23943 event pairs, 579 based on Foata normal form. 120/4025 useless extension candidates. Maximal degree in co-relation 8530. Up to 2261 conditions per place. [2024-06-27 17:24:45,561 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 38 selfloop transitions, 2 changer transitions 41/92 dead transitions. [2024-06-27 17:24:45,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 92 transitions, 385 flow [2024-06-27 17:24:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:24:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:24:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 17:24:45,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013289036544851 [2024-06-27 17:24:45,563 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 94 flow. Second operand 7 states and 181 transitions. [2024-06-27 17:24:45,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 92 transitions, 385 flow [2024-06-27 17:24:45,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 363 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 17:24:45,589 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 98 flow [2024-06-27 17:24:45,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2024-06-27 17:24:45,591 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-06-27 17:24:45,591 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 98 flow [2024-06-27 17:24:45,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:45,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:45,591 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] [2024-06-27 17:24:45,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:24:45,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:45,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1285704575, now seen corresponding path program 1 times [2024-06-27 17:24:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997705817] [2024-06-27 17:24:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997705817] [2024-06-27 17:24:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997705817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:24:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792939854] [2024-06-27 17:24:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:45,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:24:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:24:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:24:45,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-06-27 17:24:45,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:45,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:45,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-06-27 17:24:45,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:45,999 INFO L124 PetriNetUnfolderBase]: 964/1698 cut-off events. [2024-06-27 17:24:45,999 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2024-06-27 17:24:46,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 1698 events. 964/1698 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9971 event pairs, 342 based on Foata normal form. 48/1730 useless extension candidates. Maximal degree in co-relation 3541. Up to 1024 conditions per place. [2024-06-27 17:24:46,006 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 30 selfloop transitions, 2 changer transitions 29/76 dead transitions. [2024-06-27 17:24:46,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 314 flow [2024-06-27 17:24:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:24:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:24:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2024-06-27 17:24:46,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-06-27 17:24:46,007 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 98 flow. Second operand 7 states and 189 transitions. [2024-06-27 17:24:46,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 314 flow [2024-06-27 17:24:46,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 294 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 17:24:46,014 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 102 flow [2024-06-27 17:24:46,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2024-06-27 17:24:46,015 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-06-27 17:24:46,015 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 102 flow [2024-06-27 17:24:46,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:46,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:46,016 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, 1, 1, 1] [2024-06-27 17:24:46,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:24:46,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:46,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash 831581751, now seen corresponding path program 1 times [2024-06-27 17:24:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88796656] [2024-06-27 17:24:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:46,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88796656] [2024-06-27 17:24:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88796656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:46,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:24:46,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228852105] [2024-06-27 17:24:46,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:46,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:24:46,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:46,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:24:46,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:24:46,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-06-27 17:24:46,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:46,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:46,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-06-27 17:24:46,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:46,327 INFO L124 PetriNetUnfolderBase]: 1285/2188 cut-off events. [2024-06-27 17:24:46,328 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2024-06-27 17:24:46,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4690 conditions, 2188 events. 1285/2188 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13280 event pairs, 188 based on Foata normal form. 100/2243 useless extension candidates. Maximal degree in co-relation 4673. Up to 1006 conditions per place. [2024-06-27 17:24:46,336 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 41 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-06-27 17:24:46,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 250 flow [2024-06-27 17:24:46,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:24:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:24:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-06-27 17:24:46,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233 [2024-06-27 17:24:46,337 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 102 flow. Second operand 4 states and 121 transitions. [2024-06-27 17:24:46,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 250 flow [2024-06-27 17:24:46,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 238 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 17:24:46,347 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 124 flow [2024-06-27 17:24:46,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-27 17:24:46,348 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-06-27 17:24:46,348 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 124 flow [2024-06-27 17:24:46,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:46,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:46,349 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, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:46,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:24:46,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:46,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1437738773, now seen corresponding path program 1 times [2024-06-27 17:24:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221597010] [2024-06-27 17:24:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221597010] [2024-06-27 17:24:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221597010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:46,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:46,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:24:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207289113] [2024-06-27 17:24:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:46,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:24:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:24:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:24:46,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-06-27 17:24:46,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:46,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:46,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-06-27 17:24:46,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:46,624 INFO L124 PetriNetUnfolderBase]: 878/1509 cut-off events. [2024-06-27 17:24:46,625 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2024-06-27 17:24:46,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1509 events. 878/1509 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8187 event pairs, 100 based on Foata normal form. 82/1556 useless extension candidates. Maximal degree in co-relation 3580. Up to 453 conditions per place. [2024-06-27 17:24:46,632 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 52 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-06-27 17:24:46,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 339 flow [2024-06-27 17:24:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:24:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:24:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-27 17:24:46,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7116279069767442 [2024-06-27 17:24:46,634 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 124 flow. Second operand 5 states and 153 transitions. [2024-06-27 17:24:46,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 339 flow [2024-06-27 17:24:46,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 329 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:24:46,636 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 164 flow [2024-06-27 17:24:46,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-06-27 17:24:46,637 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-06-27 17:24:46,637 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 164 flow [2024-06-27 17:24:46,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:46,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:46,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:46,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:24:46,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:46,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1335222816, now seen corresponding path program 1 times [2024-06-27 17:24:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928450947] [2024-06-27 17:24:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:46,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:46,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928450947] [2024-06-27 17:24:46,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928450947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:46,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:24:46,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863543134] [2024-06-27 17:24:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:46,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:24:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:46,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:24:46,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:24:46,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-06-27 17:24:46,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:46,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:46,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-06-27 17:24:46,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:46,935 INFO L124 PetriNetUnfolderBase]: 557/938 cut-off events. [2024-06-27 17:24:46,935 INFO L125 PetriNetUnfolderBase]: For 780/780 co-relation queries the response was YES. [2024-06-27 17:24:46,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 938 events. 557/938 cut-off events. For 780/780 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4350 event pairs, 83 based on Foata normal form. 40/943 useless extension candidates. Maximal degree in co-relation 2452. Up to 308 conditions per place. [2024-06-27 17:24:46,940 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 45 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-06-27 17:24:46,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 346 flow [2024-06-27 17:24:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:24:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:24:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2024-06-27 17:24:46,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6472868217054264 [2024-06-27 17:24:46,942 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 164 flow. Second operand 6 states and 167 transitions. [2024-06-27 17:24:46,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 346 flow [2024-06-27 17:24:46,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 309 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 17:24:46,945 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-06-27 17:24:46,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-06-27 17:24:46,945 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-06-27 17:24:46,946 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-06-27 17:24:46,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:46,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:46,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:46,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:24:46,946 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:46,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash 257575728, now seen corresponding path program 1 times [2024-06-27 17:24:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405877711] [2024-06-27 17:24:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405877711] [2024-06-27 17:24:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405877711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:47,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:24:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087372290] [2024-06-27 17:24:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:24:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:24:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:24:47,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 17:24:47,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:47,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:47,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 17:24:47,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:48,417 INFO L124 PetriNetUnfolderBase]: 1290/2265 cut-off events. [2024-06-27 17:24:48,417 INFO L125 PetriNetUnfolderBase]: For 1059/1077 co-relation queries the response was YES. [2024-06-27 17:24:48,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 2265 events. 1290/2265 cut-off events. For 1059/1077 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13199 event pairs, 220 based on Foata normal form. 8/2216 useless extension candidates. Maximal degree in co-relation 5345. Up to 529 conditions per place. [2024-06-27 17:24:48,429 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 71 selfloop transitions, 14 changer transitions 15/117 dead transitions. [2024-06-27 17:24:48,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 117 transitions, 548 flow [2024-06-27 17:24:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 17:24:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 17:24:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2024-06-27 17:24:48,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5391120507399577 [2024-06-27 17:24:48,431 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 11 states and 255 transitions. [2024-06-27 17:24:48,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 117 transitions, 548 flow [2024-06-27 17:24:48,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 117 transitions, 476 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-27 17:24:48,440 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 214 flow [2024-06-27 17:24:48,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=214, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2024-06-27 17:24:48,442 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2024-06-27 17:24:48,442 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 214 flow [2024-06-27 17:24:48,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:48,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:48,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:48,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:24:48,443 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:48,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1546460240, now seen corresponding path program 2 times [2024-06-27 17:24:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752452925] [2024-06-27 17:24:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752452925] [2024-06-27 17:24:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752452925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:48,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:48,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:24:48,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513923571] [2024-06-27 17:24:48,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:48,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:24:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:48,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:24:48,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:24:48,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-06-27 17:24:48,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:48,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:48,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-06-27 17:24:48,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:49,092 INFO L124 PetriNetUnfolderBase]: 1462/2812 cut-off events. [2024-06-27 17:24:49,093 INFO L125 PetriNetUnfolderBase]: For 1064/1121 co-relation queries the response was YES. [2024-06-27 17:24:49,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6602 conditions, 2812 events. 1462/2812 cut-off events. For 1064/1121 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19233 event pairs, 340 based on Foata normal form. 18/2684 useless extension candidates. Maximal degree in co-relation 6583. Up to 994 conditions per place. [2024-06-27 17:24:49,103 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 43 selfloop transitions, 2 changer transitions 17/87 dead transitions. [2024-06-27 17:24:49,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 453 flow [2024-06-27 17:24:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:24:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:24:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-27 17:24:49,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852713178294574 [2024-06-27 17:24:49,105 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 214 flow. Second operand 6 states and 151 transitions. [2024-06-27 17:24:49,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 453 flow [2024-06-27 17:24:49,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 437 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 17:24:49,107 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 206 flow [2024-06-27 17:24:49,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2024-06-27 17:24:49,108 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2024-06-27 17:24:49,108 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 206 flow [2024-06-27 17:24:49,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:49,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:49,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:49,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:24:49,109 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:49,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1203534104, now seen corresponding path program 3 times [2024-06-27 17:24:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:49,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280233801] [2024-06-27 17:24:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:49,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280233801] [2024-06-27 17:24:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280233801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:24:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:24:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:24:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064683087] [2024-06-27 17:24:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:24:49,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:24:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:24:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:24:49,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-06-27 17:24:49,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:49,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:49,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-06-27 17:24:49,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:49,692 INFO L124 PetriNetUnfolderBase]: 1939/3709 cut-off events. [2024-06-27 17:24:49,692 INFO L125 PetriNetUnfolderBase]: For 1146/1170 co-relation queries the response was YES. [2024-06-27 17:24:49,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8619 conditions, 3709 events. 1939/3709 cut-off events. For 1146/1170 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26771 event pairs, 615 based on Foata normal form. 11/3508 useless extension candidates. Maximal degree in co-relation 8599. Up to 1512 conditions per place. [2024-06-27 17:24:49,705 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 43 selfloop transitions, 2 changer transitions 15/86 dead transitions. [2024-06-27 17:24:49,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 433 flow [2024-06-27 17:24:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:24:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:24:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-27 17:24:49,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6007751937984496 [2024-06-27 17:24:49,706 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 206 flow. Second operand 6 states and 155 transitions. [2024-06-27 17:24:49,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 433 flow [2024-06-27 17:24:49,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 416 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 17:24:49,711 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 210 flow [2024-06-27 17:24:49,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-06-27 17:24:49,711 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2024-06-27 17:24:49,712 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 210 flow [2024-06-27 17:24:49,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:24:49,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:49,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:49,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:24:49,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:24:49,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash -101476554, now seen corresponding path program 4 times [2024-06-27 17:24:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549913760] [2024-06-27 17:24:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:24:49,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:24:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:24:49,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:24:49,826 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:24:49,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-06-27 17:24:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 17:24:49,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-06-27 17:24:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-27 17:24:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-27 17:24:49,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 17:24:49,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:24:49,830 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:49,834 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:24:49,835 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:24:49,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:24:49 BasicIcfg [2024-06-27 17:24:49,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:24:49,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:24:49,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:24:49,920 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:24:49,920 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:24:43" (3/4) ... [2024-06-27 17:24:49,920 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:24:49,988 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:24:49,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:24:49,989 INFO L158 Benchmark]: Toolchain (without parser) took 8101.82ms. Allocated memory was 161.5MB in the beginning and 459.3MB in the end (delta: 297.8MB). Free memory was 85.9MB in the beginning and 319.3MB in the end (delta: -233.4MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-06-27 17:24:49,989 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory was 113.4MB in the beginning and 113.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:24:49,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.57ms. Allocated memory is still 161.5MB. Free memory was 85.7MB in the beginning and 60.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-27 17:24:49,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.90ms. Allocated memory is still 161.5MB. Free memory was 60.8MB in the beginning and 58.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:24:49,990 INFO L158 Benchmark]: Boogie Preprocessor took 165.45ms. Allocated memory was 161.5MB in the beginning and 222.3MB in the end (delta: 60.8MB). Free memory was 58.3MB in the beginning and 191.9MB in the end (delta: -133.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-06-27 17:24:49,990 INFO L158 Benchmark]: RCFGBuilder took 608.90ms. Allocated memory is still 222.3MB. Free memory was 191.9MB in the beginning and 144.7MB in the end (delta: 47.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-06-27 17:24:49,990 INFO L158 Benchmark]: TraceAbstraction took 6673.89ms. Allocated memory was 222.3MB in the beginning and 459.3MB in the end (delta: 237.0MB). Free memory was 143.7MB in the beginning and 334.0MB in the end (delta: -190.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-06-27 17:24:49,990 INFO L158 Benchmark]: Witness Printer took 69.10ms. Allocated memory is still 459.3MB. Free memory was 334.0MB in the beginning and 319.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-27 17:24:49,992 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.14ms. Allocated memory is still 161.5MB. Free memory was 113.4MB in the beginning and 113.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.57ms. Allocated memory is still 161.5MB. Free memory was 85.7MB in the beginning and 60.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.90ms. Allocated memory is still 161.5MB. Free memory was 60.8MB in the beginning and 58.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.45ms. Allocated memory was 161.5MB in the beginning and 222.3MB in the end (delta: 60.8MB). Free memory was 58.3MB in the beginning and 191.9MB in the end (delta: -133.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * RCFGBuilder took 608.90ms. Allocated memory is still 222.3MB. Free memory was 191.9MB in the beginning and 144.7MB in the end (delta: 47.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6673.89ms. Allocated memory was 222.3MB in the beginning and 459.3MB in the end (delta: 237.0MB). Free memory was 143.7MB in the beginning and 334.0MB in the end (delta: -190.3MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 69.10ms. Allocated memory is still 459.3MB. Free memory was 334.0MB in the beginning and 319.3MB 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: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t38=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L768] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t38=-2, t39=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38=-2, t39=-1, t40=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 858]: 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: 856]: 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, 72 locations, 6 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: 6.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 536 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1362 IncrementalHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 50 mSDtfsCounter, 1362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 1619 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! [2024-06-27 17:24:50,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE