./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.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/mix029_power.opt_pso.opt_rmo.opt.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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:26:43,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:26:43,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:26:43,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:26:43,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:26:43,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:26:43,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:26:43,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:26:43,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:26:43,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:26:43,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:26:43,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:26:43,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:26:43,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:26:43,198 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:26:43,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:26:43,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:26:43,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:26:43,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:26:43,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:26:43,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:26:43,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:26:43,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:26:43,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:26:43,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:26:43,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:26:43,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:26:43,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:26:43,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:26:43,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:26:43,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:26:43,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:26:43,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:26:43,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:26:43,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:26:43,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:26:43,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:26:43,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:26:43,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:26:43,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:26:43,204 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:26:43,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:26:43,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:26:43,205 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2024-06-27 17:26:43,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:26:43,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:26:43,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:26:43,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:26:43,446 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:26:43,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-06-27 17:26:44,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:26:44,624 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:26:44,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-06-27 17:26:44,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b008085/b390e54f1a5c44e58c051bfbd53888aa/FLAG1d600472c [2024-06-27 17:26:44,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b008085/b390e54f1a5c44e58c051bfbd53888aa [2024-06-27 17:26:44,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:26:44,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:26:44,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:26:44,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:26:44,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:26:44,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:26:44" (1/1) ... [2024-06-27 17:26:44,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2d927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:44, skipping insertion in model container [2024-06-27 17:26:44,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:26:44" (1/1) ... [2024-06-27 17:26:44,740 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:26:44,862 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-06-27 17:26:45,033 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:26:45,053 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:26:45,062 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-06-27 17:26:45,096 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:26:45,131 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:26:45,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45 WrapperNode [2024-06-27 17:26:45,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:26:45,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:26:45,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:26:45,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:26:45,138 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:26:45" (1/1) ... [2024-06-27 17:26:45,166 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:26:45" (1/1) ... [2024-06-27 17:26:45,200 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-06-27 17:26:45,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:26:45,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:26:45,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:26:45,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:26:45,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,242 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:26:45,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:26:45,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:26:45,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:26:45,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:26:45,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (1/1) ... [2024-06-27 17:26:45,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:26:45,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:26:45,321 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:26:45,401 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:26:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:26:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:26:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:26:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:26:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:26:45,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:26:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:26:45,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:26:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 17:26:45,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 17:26:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:26:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:26:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:26:45,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:26:45,458 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:26:45,569 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:26:45,571 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:26:45,849 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:26:45,850 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:26:45,997 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:26:45,997 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:26:45,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:26:45 BoogieIcfgContainer [2024-06-27 17:26:45,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:26:45,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:26:46,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:26:46,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:26:46,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:26:44" (1/3) ... [2024-06-27 17:26:46,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf597d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:26:46, skipping insertion in model container [2024-06-27 17:26:46,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:45" (2/3) ... [2024-06-27 17:26:46,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf597d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:26:46, skipping insertion in model container [2024-06-27 17:26:46,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:26:45" (3/3) ... [2024-06-27 17:26:46,007 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2024-06-27 17:26:46,014 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:26:46,038 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:26:46,038 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:26:46,038 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:26:46,089 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:26:46,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-06-27 17:26:46,147 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-06-27 17:26:46,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:26:46,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-06-27 17:26:46,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-06-27 17:26:46,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-06-27 17:26:46,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:26:46,175 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;@35b75d11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:26:46,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 17:26:46,184 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:26:46,184 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-06-27 17:26:46,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:26:46,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:46,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:46,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:46,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:46,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1445825349, now seen corresponding path program 1 times [2024-06-27 17:26:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646876741] [2024-06-27 17:26:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:46,582 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:26:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646876741] [2024-06-27 17:26:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646876741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:26:46,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506815589] [2024-06-27 17:26:46,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:46,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:26:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:46,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:26:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:26:46,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 49 [2024-06-27 17:26:46,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:26:46,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:46,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 49 [2024-06-27 17:26:46,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:47,005 INFO L124 PetriNetUnfolderBase]: 1339/2305 cut-off events. [2024-06-27 17:26:47,006 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-06-27 17:26:47,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 2305 events. 1339/2305 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16365 event pairs, 244 based on Foata normal form. 72/2310 useless extension candidates. Maximal degree in co-relation 4273. Up to 1510 conditions per place. [2024-06-27 17:26:47,030 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 31 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-06-27 17:26:47,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 197 flow [2024-06-27 17:26:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:26:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:26:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-27 17:26:47,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-06-27 17:26:47,044 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 113 transitions. [2024-06-27 17:26:47,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 197 flow [2024-06-27 17:26:47,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:26:47,052 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-06-27 17:26:47,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-27 17:26:47,057 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-06-27 17:26:47,057 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-06-27 17:26:47,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:26:47,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:47,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:47,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:26:47,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:47,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1232115996, now seen corresponding path program 1 times [2024-06-27 17:26:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933208011] [2024-06-27 17:26:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:47,340 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:26:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933208011] [2024-06-27 17:26:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933208011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:47,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:26:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945354370] [2024-06-27 17:26:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:47,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:26:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:26:47,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:26:47,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-06-27 17:26:47,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:26:47,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:47,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-06-27 17:26:47,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:48,042 INFO L124 PetriNetUnfolderBase]: 5293/8023 cut-off events. [2024-06-27 17:26:48,043 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2024-06-27 17:26:48,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15871 conditions, 8023 events. 5293/8023 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 54793 event pairs, 663 based on Foata normal form. 240/7986 useless extension candidates. Maximal degree in co-relation 15861. Up to 4461 conditions per place. [2024-06-27 17:26:48,085 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 47 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-06-27 17:26:48,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 270 flow [2024-06-27 17:26:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:26:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:26:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-06-27 17:26:48,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2024-06-27 17:26:48,088 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 136 transitions. [2024-06-27 17:26:48,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 270 flow [2024-06-27 17:26:48,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:26:48,090 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-06-27 17:26:48,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-27 17:26:48,091 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-06-27 17:26:48,091 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-06-27 17:26:48,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:26:48,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:48,091 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:26:48,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:26:48,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:48,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -275063556, now seen corresponding path program 1 times [2024-06-27 17:26:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815971033] [2024-06-27 17:26:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:48,240 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:26:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:48,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815971033] [2024-06-27 17:26:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815971033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:48,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:26:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128970963] [2024-06-27 17:26:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:48,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:26:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:26:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:26:48,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-06-27 17:26:48,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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:26:48,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:48,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-06-27 17:26:48,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:48,853 INFO L124 PetriNetUnfolderBase]: 4321/6591 cut-off events. [2024-06-27 17:26:48,853 INFO L125 PetriNetUnfolderBase]: For 1730/1730 co-relation queries the response was YES. [2024-06-27 17:26:48,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15141 conditions, 6591 events. 4321/6591 cut-off events. For 1730/1730 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 43188 event pairs, 249 based on Foata normal form. 228/6606 useless extension candidates. Maximal degree in co-relation 15129. Up to 3201 conditions per place. [2024-06-27 17:26:48,885 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 60 selfloop transitions, 10 changer transitions 1/87 dead transitions. [2024-06-27 17:26:48,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 387 flow [2024-06-27 17:26:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:26:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:26:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-06-27 17:26:48,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7061224489795919 [2024-06-27 17:26:48,887 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 173 transitions. [2024-06-27 17:26:48,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 387 flow [2024-06-27 17:26:48,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:26:48,890 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-06-27 17:26:48,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-06-27 17:26:48,891 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-06-27 17:26:48,891 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-06-27 17:26:48,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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:26:48,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:48,892 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] [2024-06-27 17:26:48,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:26:48,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:48,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash -962915426, now seen corresponding path program 1 times [2024-06-27 17:26:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701468158] [2024-06-27 17:26:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:49,065 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:26:49,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:49,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701468158] [2024-06-27 17:26:49,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701468158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:49,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:49,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:26:49,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536525917] [2024-06-27 17:26:49,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:49,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:26:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:26:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:26:49,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-06-27 17:26:49,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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:26:49,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:49,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-06-27 17:26:49,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:49,527 INFO L124 PetriNetUnfolderBase]: 2837/4315 cut-off events. [2024-06-27 17:26:49,528 INFO L125 PetriNetUnfolderBase]: For 3455/3455 co-relation queries the response was YES. [2024-06-27 17:26:49,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11213 conditions, 4315 events. 2837/4315 cut-off events. For 3455/3455 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 25192 event pairs, 115 based on Foata normal form. 172/4371 useless extension candidates. Maximal degree in co-relation 11199. Up to 1361 conditions per place. [2024-06-27 17:26:49,550 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2024-06-27 17:26:49,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 510 flow [2024-06-27 17:26:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:26:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:26:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-06-27 17:26:49,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2024-06-27 17:26:49,552 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 208 transitions. [2024-06-27 17:26:49,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 510 flow [2024-06-27 17:26:49,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 17:26:49,561 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-06-27 17:26:49,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-06-27 17:26:49,562 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-06-27 17:26:49,562 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-06-27 17:26:49,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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:26:49,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:49,563 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] [2024-06-27 17:26:49,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:26:49,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:49,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash 751927760, now seen corresponding path program 1 times [2024-06-27 17:26:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45630061] [2024-06-27 17:26:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:49,813 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:26:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:49,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45630061] [2024-06-27 17:26:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45630061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:26:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513338536] [2024-06-27 17:26:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:49,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:26:49,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:26:49,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:26:49,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-06-27 17:26:49,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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:26:49,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:49,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-06-27 17:26:49,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:50,207 INFO L124 PetriNetUnfolderBase]: 1825/2699 cut-off events. [2024-06-27 17:26:50,208 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2024-06-27 17:26:50,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7830 conditions, 2699 events. 1825/2699 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13779 event pairs, 77 based on Foata normal form. 80/2727 useless extension candidates. Maximal degree in co-relation 7815. Up to 828 conditions per place. [2024-06-27 17:26:50,221 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 64 selfloop transitions, 18 changer transitions 1/99 dead transitions. [2024-06-27 17:26:50,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 508 flow [2024-06-27 17:26:50,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:26:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:26:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-06-27 17:26:50,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-06-27 17:26:50,223 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-06-27 17:26:50,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 508 flow [2024-06-27 17:26:50,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 17:26:50,239 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-06-27 17:26:50,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-06-27 17:26:50,242 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-06-27 17:26:50,242 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-06-27 17:26:50,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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:26:50,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:50,242 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, 1, 1, 1, 1] [2024-06-27 17:26:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:26:50,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:50,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1233856089, now seen corresponding path program 1 times [2024-06-27 17:26:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762242088] [2024-06-27 17:26:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:51,153 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:26:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762242088] [2024-06-27 17:26:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762242088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 17:26:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453334211] [2024-06-27 17:26:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:51,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:26:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:51,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:26:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:26:51,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-06-27 17:26:51,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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:26:51,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:51,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-06-27 17:26:51,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:51,896 INFO L124 PetriNetUnfolderBase]: 4734/7416 cut-off events. [2024-06-27 17:26:51,896 INFO L125 PetriNetUnfolderBase]: For 3234/3350 co-relation queries the response was YES. [2024-06-27 17:26:51,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17423 conditions, 7416 events. 4734/7416 cut-off events. For 3234/3350 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 47852 event pairs, 973 based on Foata normal form. 16/7189 useless extension candidates. Maximal degree in co-relation 17407. Up to 3377 conditions per place. [2024-06-27 17:26:51,923 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 44 selfloop transitions, 16 changer transitions 42/128 dead transitions. [2024-06-27 17:26:51,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 624 flow [2024-06-27 17:26:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:26:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:26:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2024-06-27 17:26:51,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6301020408163265 [2024-06-27 17:26:51,925 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 8 states and 247 transitions. [2024-06-27 17:26:51,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 624 flow [2024-06-27 17:26:51,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 518 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-27 17:26:51,972 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 268 flow [2024-06-27 17:26:51,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-06-27 17:26:51,973 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2024-06-27 17:26:51,973 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 268 flow [2024-06-27 17:26:51,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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:26:51,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:51,974 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, 1, 1, 1, 1] [2024-06-27 17:26:51,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:26:51,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:51,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1645066991, now seen corresponding path program 2 times [2024-06-27 17:26:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400831399] [2024-06-27 17:26:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:52,716 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:26:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400831399] [2024-06-27 17:26:52,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400831399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:52,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:26:52,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951820721] [2024-06-27 17:26:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:52,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:26:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:26:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:26:52,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-06-27 17:26:52,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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:26:52,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:52,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-06-27 17:26:52,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:53,388 INFO L124 PetriNetUnfolderBase]: 4293/7008 cut-off events. [2024-06-27 17:26:53,388 INFO L125 PetriNetUnfolderBase]: For 3285/3393 co-relation queries the response was YES. [2024-06-27 17:26:53,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18632 conditions, 7008 events. 4293/7008 cut-off events. For 3285/3393 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 47691 event pairs, 1088 based on Foata normal form. 31/6737 useless extension candidates. Maximal degree in co-relation 18615. Up to 2828 conditions per place. [2024-06-27 17:26:53,425 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 39 selfloop transitions, 9 changer transitions 28/104 dead transitions. [2024-06-27 17:26:53,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 548 flow [2024-06-27 17:26:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:26:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:26:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-06-27 17:26:53,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.608843537414966 [2024-06-27 17:26:53,427 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 268 flow. Second operand 6 states and 179 transitions. [2024-06-27 17:26:53,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 548 flow [2024-06-27 17:26:53,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 538 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 17:26:53,435 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 282 flow [2024-06-27 17:26:53,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-06-27 17:26:53,436 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2024-06-27 17:26:53,436 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 282 flow [2024-06-27 17:26:53,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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:26:53,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:53,436 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, 1, 1, 1, 1] [2024-06-27 17:26:53,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:26:53,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:53,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -712462687, now seen corresponding path program 3 times [2024-06-27 17:26:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120567044] [2024-06-27 17:26:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:54,033 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:26:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120567044] [2024-06-27 17:26:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120567044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:54,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 17:26:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589230718] [2024-06-27 17:26:54,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:54,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:26:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:54,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:26:54,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:26:54,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-06-27 17:26:54,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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:26:54,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:54,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-06-27 17:26:54,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:55,031 INFO L124 PetriNetUnfolderBase]: 6356/10873 cut-off events. [2024-06-27 17:26:55,031 INFO L125 PetriNetUnfolderBase]: For 8291/8504 co-relation queries the response was YES. [2024-06-27 17:26:55,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27720 conditions, 10873 events. 6356/10873 cut-off events. For 8291/8504 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 83848 event pairs, 1327 based on Foata normal form. 100/10240 useless extension candidates. Maximal degree in co-relation 27700. Up to 3804 conditions per place. [2024-06-27 17:26:55,070 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 33 selfloop transitions, 6 changer transitions 64/129 dead transitions. [2024-06-27 17:26:55,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 745 flow [2024-06-27 17:26:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:26:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:26:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2024-06-27 17:26:55,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2024-06-27 17:26:55,072 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 282 flow. Second operand 8 states and 238 transitions. [2024-06-27 17:26:55,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 745 flow [2024-06-27 17:26:55,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 722 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 17:26:55,078 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 233 flow [2024-06-27 17:26:55,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2024-06-27 17:26:55,080 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2024-06-27 17:26:55,081 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 233 flow [2024-06-27 17:26:55,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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:26:55,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:55,081 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, 1, 1, 1, 1] [2024-06-27 17:26:55,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:26:55,081 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:55,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash 951909237, now seen corresponding path program 4 times [2024-06-27 17:26:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675843828] [2024-06-27 17:26:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:56,171 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:26:56,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675843828] [2024-06-27 17:26:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675843828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:56,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:56,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 17:26:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233619104] [2024-06-27 17:26:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:56,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:26:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:26:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:26:56,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-06-27 17:26:56,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 56 transitions, 233 flow. Second operand has 10 states, 10 states have (on average 20.4) internal successors, (204), 10 states have internal predecessors, (204), 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:26:56,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:56,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-06-27 17:26:56,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:56,756 INFO L124 PetriNetUnfolderBase]: 3045/5230 cut-off events. [2024-06-27 17:26:56,756 INFO L125 PetriNetUnfolderBase]: For 1916/1932 co-relation queries the response was YES. [2024-06-27 17:26:56,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12623 conditions, 5230 events. 3045/5230 cut-off events. For 1916/1932 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34513 event pairs, 704 based on Foata normal form. 16/4965 useless extension candidates. Maximal degree in co-relation 12600. Up to 1443 conditions per place. [2024-06-27 17:26:56,778 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 58 selfloop transitions, 11 changer transitions 25/120 dead transitions. [2024-06-27 17:26:56,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 120 transitions, 655 flow [2024-06-27 17:26:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:26:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:26:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions. [2024-06-27 17:26:56,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2024-06-27 17:26:56,780 INFO L175 Difference]: Start difference. First operand has 78 places, 56 transitions, 233 flow. Second operand 10 states and 274 transitions. [2024-06-27 17:26:56,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 120 transitions, 655 flow [2024-06-27 17:26:56,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 120 transitions, 620 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 17:26:56,786 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 295 flow [2024-06-27 17:26:56,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2024-06-27 17:26:56,787 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2024-06-27 17:26:56,788 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 295 flow [2024-06-27 17:26:56,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.4) internal successors, (204), 10 states have internal predecessors, (204), 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:26:56,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:56,788 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, 1, 1, 1, 1] [2024-06-27 17:26:56,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:26:56,789 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:56,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -359667849, now seen corresponding path program 5 times [2024-06-27 17:26:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103841277] [2024-06-27 17:26:56,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:57,442 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:26:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103841277] [2024-06-27 17:26:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103841277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:57,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:57,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 17:26:57,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448139743] [2024-06-27 17:26:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:57,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:26:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:57,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:26:57,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:26:57,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2024-06-27 17:26:57,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 295 flow. Second operand has 10 states, 10 states have (on average 24.9) internal successors, (249), 10 states have internal predecessors, (249), 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:26:57,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:57,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2024-06-27 17:26:57,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:58,272 INFO L124 PetriNetUnfolderBase]: 3273/5692 cut-off events. [2024-06-27 17:26:58,288 INFO L125 PetriNetUnfolderBase]: For 2298/2474 co-relation queries the response was YES. [2024-06-27 17:26:58,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13662 conditions, 5692 events. 3273/5692 cut-off events. For 2298/2474 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 39722 event pairs, 1286 based on Foata normal form. 45/5199 useless extension candidates. Maximal degree in co-relation 13640. Up to 2217 conditions per place. [2024-06-27 17:26:58,329 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 29 selfloop transitions, 5 changer transitions 19/84 dead transitions. [2024-06-27 17:26:58,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 457 flow [2024-06-27 17:26:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:26:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:26:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-06-27 17:26:58,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6258503401360545 [2024-06-27 17:26:58,345 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 295 flow. Second operand 6 states and 184 transitions. [2024-06-27 17:26:58,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 457 flow [2024-06-27 17:26:58,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 448 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 17:26:58,350 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 280 flow [2024-06-27 17:26:58,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2024-06-27 17:26:58,350 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2024-06-27 17:26:58,350 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 280 flow [2024-06-27 17:26:58,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.9) internal successors, (249), 10 states have internal predecessors, (249), 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:26:58,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:58,351 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, 1, 1, 1, 1] [2024-06-27 17:26:58,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:26:58,351 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:58,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash -613417325, now seen corresponding path program 6 times [2024-06-27 17:26:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327271531] [2024-06-27 17:26:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:58,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:26:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:58,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:26:58,439 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:26:58,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 17:26:58,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 17:26:58,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-06-27 17:26:58,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-06-27 17:26:58,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 17:26:58,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 17:26:58,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 17:26:58,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:26:58,442 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-06-27 17:26:58,447 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:26:58,447 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:26:58,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:26:58 BasicIcfg [2024-06-27 17:26:58,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:26:58,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:26:58,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:26:58,540 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:26:58,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:26:45" (3/4) ... [2024-06-27 17:26:58,540 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:26:58,621 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:26:58,621 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:26:58,621 INFO L158 Benchmark]: Toolchain (without parser) took 13968.51ms. Allocated memory was 153.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 82.1MB in the beginning and 761.7MB in the end (delta: -679.6MB). Peak memory consumption was 352.0MB. Max. memory is 16.1GB. [2024-06-27 17:26:58,622 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:26:58,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.32ms. Allocated memory is still 153.1MB. Free memory was 81.9MB in the beginning and 101.4MB in the end (delta: -19.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-06-27 17:26:58,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.30ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 98.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:58,622 INFO L158 Benchmark]: Boogie Preprocessor took 53.26ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 95.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:58,622 INFO L158 Benchmark]: RCFGBuilder took 736.43ms. Allocated memory is still 153.1MB. Free memory was 95.8MB in the beginning and 46.9MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-27 17:26:58,623 INFO L158 Benchmark]: TraceAbstraction took 12539.82ms. Allocated memory was 153.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 46.2MB in the beginning and 779.5MB in the end (delta: -733.3MB). Peak memory consumption was 298.8MB. Max. memory is 16.1GB. [2024-06-27 17:26:58,623 INFO L158 Benchmark]: Witness Printer took 81.79ms. Allocated memory is still 1.2GB. Free memory was 779.5MB in the beginning and 761.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-27 17:26:58,626 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.15ms. Allocated memory is still 109.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.32ms. Allocated memory is still 153.1MB. Free memory was 81.9MB in the beginning and 101.4MB in the end (delta: -19.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.30ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 98.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.26ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 95.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.43ms. Allocated memory is still 153.1MB. Free memory was 95.8MB in the beginning and 46.9MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12539.82ms. Allocated memory was 153.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 46.2MB in the beginning and 779.5MB in the end (delta: -733.3MB). Peak memory consumption was 298.8MB. Max. memory is 16.1GB. * Witness Printer took 81.79ms. Allocated memory is still 1.2GB. Free memory was 779.5MB in the beginning and 761.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, t775=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 367 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1559 IncrementalHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 40 mSDtfsCounter, 1559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=9, 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.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 2220 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:26:58,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE