./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:22:36,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:22:36,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:22:36,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:22:36,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:22:36,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:22:36,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:22:36,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:22:36,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:22:36,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:22:36,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:22:36,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:22:36,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:22:36,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:22:36,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:22:36,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:22:36,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:22:36,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:22:36,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:22:36,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:22:36,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:22:36,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:22:36,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:22:36,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:22:36,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:22:36,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:22:36,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:22:36,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:22:36,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:22:36,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:22:36,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:22:36,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:22:36,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:22:36,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:22:36,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:22:36,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:22:36,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:22:36,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:22:36,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:22:36,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:22:36,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:22:36,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:22:36,209 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2024-11-20 09:22:36,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:22:36,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:22:36,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:22:36,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:22:36,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:22:36,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2024-11-20 09:22:38,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:22:38,277 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:22:38,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2024-11-20 09:22:38,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc9af2f3/becdadc506274d29a479f87da7e6ad0c/FLAG5da2f777c [2024-11-20 09:22:38,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cc9af2f3/becdadc506274d29a479f87da7e6ad0c [2024-11-20 09:22:38,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:22:38,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:22:38,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:22:38,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:22:38,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:22:38,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:22:38" (1/1) ... [2024-11-20 09:22:38,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c115b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:38, skipping insertion in model container [2024-11-20 09:22:38,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:22:38" (1/1) ... [2024-11-20 09:22:38,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:22:38,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i[949,962] [2024-11-20 09:22:39,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:22:39,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:22:39,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i[949,962] [2024-11-20 09:22:39,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:22:39,267 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:22:39,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39 WrapperNode [2024-11-20 09:22:39,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:22:39,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:22:39,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:22:39,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:22:39,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,343 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2024-11-20 09:22:39,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:22:39,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:22:39,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:22:39,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:22:39,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,392 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-11-20 09:22:39,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:22:39,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:22:39,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:22:39,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:22:39,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (1/1) ... [2024-11-20 09:22:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:22:39,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:22:39,461 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-11-20 09:22:39,464 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-11-20 09:22:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:22:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:22:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 09:22:39,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 09:22:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 09:22:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 09:22:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 09:22:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 09:22:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-20 09:22:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-20 09:22:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:22:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:22:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:22:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:22:39,510 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:22:39,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:22:39,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:22:40,012 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:22:40,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:22:40,224 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:22:40,224 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 09:22:40,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:22:40 BoogieIcfgContainer [2024-11-20 09:22:40,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:22:40,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:22:40,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:22:40,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:22:40,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:22:38" (1/3) ... [2024-11-20 09:22:40,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601823c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:22:40, skipping insertion in model container [2024-11-20 09:22:40,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:22:39" (2/3) ... [2024-11-20 09:22:40,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601823c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:22:40, skipping insertion in model container [2024-11-20 09:22:40,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:22:40" (3/3) ... [2024-11-20 09:22:40,235 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2024-11-20 09:22:40,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:22:40,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 09:22:40,253 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:22:40,315 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 09:22:40,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-11-20 09:22:40,391 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-11-20 09:22:40,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:22:40,396 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 5. Compared 90 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-11-20 09:22:40,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-11-20 09:22:40,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-11-20 09:22:40,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:22:40,414 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@537b3421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:22:40,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 09:22:40,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:22:40,446 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-20 09:22:40,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:22:40,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:40,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 09:22:40,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:40,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1418683503, now seen corresponding path program 1 times [2024-11-20 09:22:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728457235] [2024-11-20 09:22:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:41,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728457235] [2024-11-20 09:22:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728457235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:41,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 09:22:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610138491] [2024-11-20 09:22:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:41,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:22:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:22:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:22:41,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-11-20 09:22:41,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11-20 09:22:41,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:41,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-11-20 09:22:41,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:41,903 INFO L124 PetriNetUnfolderBase]: 2160/3617 cut-off events. [2024-11-20 09:22:41,903 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-20 09:22:41,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6746 conditions, 3617 events. 2160/3617 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 24781 event pairs, 384 based on Foata normal form. 108/3623 useless extension candidates. Maximal degree in co-relation 6734. Up to 2416 conditions per place. [2024-11-20 09:22:41,932 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 35 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2024-11-20 09:22:41,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 214 flow [2024-11-20 09:22:41,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:22:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:22:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-20 09:22:41,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7755102040816326 [2024-11-20 09:22:41,946 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 114 transitions. [2024-11-20 09:22:41,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 214 flow [2024-11-20 09:22:41,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 09:22:41,953 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-11-20 09:22:41,955 INFO L260 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-11-20 09:22:41,960 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-20 09:22:41,961 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-11-20 09:22:41,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11-20 09:22:41,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:41,961 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:22:41,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:22:41,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1631195264, now seen corresponding path program 1 times [2024-11-20 09:22:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:41,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952651944] [2024-11-20 09:22:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:42,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952651944] [2024-11-20 09:22:42,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952651944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:42,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:22:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658075426] [2024-11-20 09:22:42,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:22:42,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:22:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:22:42,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:22:42,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-11-20 09:22:42,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:42,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:22:42,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:43,721 INFO L124 PetriNetUnfolderBase]: 7149/10759 cut-off events. [2024-11-20 09:22:43,722 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2024-11-20 09:22:43,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21283 conditions, 10759 events. 7149/10759 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 73199 event pairs, 869 based on Foata normal form. 320/10520 useless extension candidates. Maximal degree in co-relation 21273. Up to 5881 conditions per place. [2024-11-20 09:22:43,800 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 50 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2024-11-20 09:22:43,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 280 flow [2024-11-20 09:22:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:22:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:22:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-20 09:22:43,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6887755102040817 [2024-11-20 09:22:43,803 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 135 transitions. [2024-11-20 09:22:43,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 280 flow [2024-11-20 09:22:43,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:22:43,808 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-11-20 09:22:43,809 INFO L260 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-11-20 09:22:43,809 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-20 09:22:43,810 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-11-20 09:22:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-11-20 09:22:43,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:43,810 INFO L204 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-11-20 09:22:43,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:22:43,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1856639458, now seen corresponding path program 1 times [2024-11-20 09:22:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:43,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308669586] [2024-11-20 09:22:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308669586] [2024-11-20 09:22:44,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308669586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:44,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:44,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:22:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555001033] [2024-11-20 09:22:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:44,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:22:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:22:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:22:44,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:22:44,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-11-20 09:22:44,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:44,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:22:44,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:45,443 INFO L124 PetriNetUnfolderBase]: 5601/8483 cut-off events. [2024-11-20 09:22:45,443 INFO L125 PetriNetUnfolderBase]: For 2112/2112 co-relation queries the response was YES. [2024-11-20 09:22:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19325 conditions, 8483 events. 5601/8483 cut-off events. For 2112/2112 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 55135 event pairs, 369 based on Foata normal form. 296/8369 useless extension candidates. Maximal degree in co-relation 19313. Up to 3901 conditions per place. [2024-11-20 09:22:45,506 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 64 selfloop transitions, 10 changer transitions 1/90 dead transitions. [2024-11-20 09:22:45,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 401 flow [2024-11-20 09:22:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:22:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:22:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2024-11-20 09:22:45,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7020408163265306 [2024-11-20 09:22:45,508 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 172 transitions. [2024-11-20 09:22:45,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 401 flow [2024-11-20 09:22:45,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 09:22:45,514 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-11-20 09:22:45,514 INFO L260 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-11-20 09:22:45,515 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-11-20 09:22:45,515 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-11-20 09:22:45,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-11-20 09:22:45,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:45,516 INFO L204 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-11-20 09:22:45,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:22:45,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:45,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 340789310, now seen corresponding path program 1 times [2024-11-20 09:22:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240627878] [2024-11-20 09:22:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:45,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:45,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240627878] [2024-11-20 09:22:45,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240627878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:45,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:45,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:22:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944895412] [2024-11-20 09:22:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:45,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:22:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:22:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:22:45,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:22:45,902 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.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-11-20 09:22:45,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:45,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:22:45,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:46,673 INFO L124 PetriNetUnfolderBase]: 3613/5447 cut-off events. [2024-11-20 09:22:46,674 INFO L125 PetriNetUnfolderBase]: For 4185/4185 co-relation queries the response was YES. [2024-11-20 09:22:46,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 5447 events. 3613/5447 cut-off events. For 4185/4185 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 31506 event pairs, 221 based on Foata normal form. 208/5400 useless extension candidates. Maximal degree in co-relation 13957. Up to 1501 conditions per place. [2024-11-20 09:22:46,720 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 76 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2024-11-20 09:22:46,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 528 flow [2024-11-20 09:22:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:22:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:22:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-11-20 09:22:46,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7040816326530612 [2024-11-20 09:22:46,723 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 207 transitions. [2024-11-20 09:22:46,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 528 flow [2024-11-20 09:22:46,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 498 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 09:22:46,743 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-11-20 09:22:46,744 INFO L260 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-11-20 09:22:46,832 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-11-20 09:22:46,832 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-11-20 09:22:46,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-11-20 09:22:46,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:46,832 INFO L204 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-11-20 09:22:46,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:22:46,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1527638391, now seen corresponding path program 1 times [2024-11-20 09:22:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795078074] [2024-11-20 09:22:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:47,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:47,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795078074] [2024-11-20 09:22:47,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795078074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:47,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:47,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:22:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989118011] [2024-11-20 09:22:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:47,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:22:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:22:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:22:47,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-20 09:22:47,220 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.0) internal successors, (154), 7 states have internal predecessors, (154), 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-11-20 09:22:47,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:47,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-20 09:22:47,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:47,804 INFO L124 PetriNetUnfolderBase]: 2425/3563 cut-off events. [2024-11-20 09:22:47,804 INFO L125 PetriNetUnfolderBase]: For 4477/4477 co-relation queries the response was YES. [2024-11-20 09:22:47,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10020 conditions, 3563 events. 2425/3563 cut-off events. For 4477/4477 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18372 event pairs, 173 based on Foata normal form. 88/3475 useless extension candidates. Maximal degree in co-relation 10005. Up to 1088 conditions per place. [2024-11-20 09:22:47,827 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 68 selfloop transitions, 18 changer transitions 1/102 dead transitions. [2024-11-20 09:22:47,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 522 flow [2024-11-20 09:22:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:22:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:22:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-11-20 09:22:47,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6472303206997084 [2024-11-20 09:22:47,830 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 222 transitions. [2024-11-20 09:22:47,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 522 flow [2024-11-20 09:22:47,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 476 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-20 09:22:47,859 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-11-20 09:22:47,859 INFO L260 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-11-20 09:22:47,860 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-11-20 09:22:47,860 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-11-20 09:22:47,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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-11-20 09:22:47,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:47,861 INFO L204 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-11-20 09:22:47,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:22:47,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 168869096, now seen corresponding path program 1 times [2024-11-20 09:22:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756460999] [2024-11-20 09:22:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756460999] [2024-11-20 09:22:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756460999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:22:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174013250] [2024-11-20 09:22:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:22:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:22:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:22:48,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-11-20 09:22:48,728 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-11-20 09:22:48,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:48,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-11-20 09:22:48,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:49,909 INFO L124 PetriNetUnfolderBase]: 4945/7749 cut-off events. [2024-11-20 09:22:49,909 INFO L125 PetriNetUnfolderBase]: For 3318/3564 co-relation queries the response was YES. [2024-11-20 09:22:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17934 conditions, 7749 events. 4945/7749 cut-off events. For 3318/3564 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 48952 event pairs, 1086 based on Foata normal form. 16/7489 useless extension candidates. Maximal degree in co-relation 17918. Up to 3708 conditions per place. [2024-11-20 09:22:49,961 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 41 selfloop transitions, 5 changer transitions 44/116 dead transitions. [2024-11-20 09:22:49,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 576 flow [2024-11-20 09:22:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:22:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:22:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-11-20 09:22:49,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5994897959183674 [2024-11-20 09:22:49,964 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 8 states and 235 transitions. [2024-11-20 09:22:49,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 576 flow [2024-11-20 09:22:50,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 470 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-20 09:22:50,023 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 193 flow [2024-11-20 09:22:50,023 INFO L260 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-20 09:22:50,024 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2024-11-20 09:22:50,024 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 193 flow [2024-11-20 09:22:50,025 INFO L472 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-11-20 09:22:50,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:50,025 INFO L204 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-11-20 09:22:50,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:22:50,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:50,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1637427732, now seen corresponding path program 2 times [2024-11-20 09:22:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197946984] [2024-11-20 09:22:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:52,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197946984] [2024-11-20 09:22:52,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197946984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:52,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:22:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992700095] [2024-11-20 09:22:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:52,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:22:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:52,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:22:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:22:52,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-11-20 09:22:52,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 193 flow. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 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-11-20 09:22:52,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:52,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-11-20 09:22:52,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:53,251 INFO L124 PetriNetUnfolderBase]: 5216/8307 cut-off events. [2024-11-20 09:22:53,251 INFO L125 PetriNetUnfolderBase]: For 2477/2492 co-relation queries the response was YES. [2024-11-20 09:22:53,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19255 conditions, 8307 events. 5216/8307 cut-off events. For 2477/2492 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 54595 event pairs, 1342 based on Foata normal form. 20/8011 useless extension candidates. Maximal degree in co-relation 19238. Up to 3703 conditions per place. [2024-11-20 09:22:53,313 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 64 selfloop transitions, 11 changer transitions 12/113 dead transitions. [2024-11-20 09:22:53,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 113 transitions, 533 flow [2024-11-20 09:22:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:22:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:22:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 229 transitions. [2024-11-20 09:22:53,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5841836734693877 [2024-11-20 09:22:53,317 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 193 flow. Second operand 8 states and 229 transitions. [2024-11-20 09:22:53,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 113 transitions, 533 flow [2024-11-20 09:22:53,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 113 transitions, 523 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-20 09:22:53,323 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 268 flow [2024-11-20 09:22:53,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2024-11-20 09:22:53,324 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2024-11-20 09:22:53,324 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 268 flow [2024-11-20 09:22:53,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 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-11-20 09:22:53,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:53,325 INFO L204 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-11-20 09:22:53,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:22:53,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:53,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash 363242078, now seen corresponding path program 3 times [2024-11-20 09:22:53,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:53,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910167749] [2024-11-20 09:22:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:53,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910167749] [2024-11-20 09:22:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910167749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:53,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:22:53,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165453483] [2024-11-20 09:22:53,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:53,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:22:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:22:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:22:53,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-11-20 09:22:53,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 268 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-11-20 09:22:53,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:53,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-11-20 09:22:53,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:55,759 INFO L124 PetriNetUnfolderBase]: 8504/13292 cut-off events. [2024-11-20 09:22:55,759 INFO L125 PetriNetUnfolderBase]: For 10266/10342 co-relation queries the response was YES. [2024-11-20 09:22:55,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35658 conditions, 13292 events. 8504/13292 cut-off events. For 10266/10342 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 95459 event pairs, 1264 based on Foata normal form. 35/12490 useless extension candidates. Maximal degree in co-relation 35637. Up to 5803 conditions per place. [2024-11-20 09:22:55,878 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 71 selfloop transitions, 9 changer transitions 16/123 dead transitions. [2024-11-20 09:22:55,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 683 flow [2024-11-20 09:22:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:22:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:22:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-11-20 09:22:55,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.576530612244898 [2024-11-20 09:22:55,881 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 268 flow. Second operand 8 states and 226 transitions. [2024-11-20 09:22:55,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 683 flow [2024-11-20 09:22:55,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 676 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-20 09:22:55,888 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 308 flow [2024-11-20 09:22:55,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=308, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-11-20 09:22:55,892 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-11-20 09:22:55,893 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 308 flow [2024-11-20 09:22:55,893 INFO L472 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-11-20 09:22:55,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:55,895 INFO L204 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-11-20 09:22:55,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:22:55,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:55,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash -177363234, now seen corresponding path program 4 times [2024-11-20 09:22:55,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:55,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190133429] [2024-11-20 09:22:55,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:22:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:22:56,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:22:56,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190133429] [2024-11-20 09:22:56,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190133429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:22:56,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:22:56,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:22:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776128776] [2024-11-20 09:22:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:22:56,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:22:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:22:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:22:56,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:22:56,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-11-20 09:22:56,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-11-20 09:22:56,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:22:56,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-11-20 09:22:56,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:22:58,241 INFO L124 PetriNetUnfolderBase]: 10648/17654 cut-off events. [2024-11-20 09:22:58,241 INFO L125 PetriNetUnfolderBase]: For 14624/14794 co-relation queries the response was YES. [2024-11-20 09:22:58,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46610 conditions, 17654 events. 10648/17654 cut-off events. For 14624/14794 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 143070 event pairs, 2711 based on Foata normal form. 24/16250 useless extension candidates. Maximal degree in co-relation 46586. Up to 6294 conditions per place. [2024-11-20 09:22:58,351 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 36 selfloop transitions, 1 changer transitions 45/112 dead transitions. [2024-11-20 09:22:58,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 674 flow [2024-11-20 09:22:58,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:22:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:22:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-11-20 09:22:58,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2024-11-20 09:22:58,354 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 308 flow. Second operand 6 states and 183 transitions. [2024-11-20 09:22:58,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 674 flow [2024-11-20 09:22:58,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 659 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-20 09:22:58,364 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 237 flow [2024-11-20 09:22:58,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=84, PETRI_TRANSITIONS=58} [2024-11-20 09:22:58,365 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2024-11-20 09:22:58,365 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 237 flow [2024-11-20 09:22:58,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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-11-20 09:22:58,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:22:58,365 INFO L204 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-11-20 09:22:58,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:22:58,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:22:58,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:22:58,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1310770608, now seen corresponding path program 5 times [2024-11-20 09:22:58,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:22:58,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429005686] [2024-11-20 09:22:58,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:22:58,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:22:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:23:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:23:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:23:01,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429005686] [2024-11-20 09:23:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429005686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:23:01,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:23:01,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:23:01,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124582778] [2024-11-20 09:23:01,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:23:01,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:23:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:23:01,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:23:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:23:01,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-11-20 09:23:01,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 58 transitions, 237 flow. Second operand has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 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-11-20 09:23:01,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:23:01,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-11-20 09:23:01,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:23:02,812 INFO L124 PetriNetUnfolderBase]: 4768/8146 cut-off events. [2024-11-20 09:23:02,812 INFO L125 PetriNetUnfolderBase]: For 4961/5019 co-relation queries the response was YES. [2024-11-20 09:23:02,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21028 conditions, 8146 events. 4768/8146 cut-off events. For 4961/5019 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 57647 event pairs, 1234 based on Foata normal form. 21/7816 useless extension candidates. Maximal degree in co-relation 21002. Up to 2461 conditions per place. [2024-11-20 09:23:02,856 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 49 selfloop transitions, 8 changer transitions 48/131 dead transitions. [2024-11-20 09:23:02,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 131 transitions, 727 flow [2024-11-20 09:23:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:23:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 09:23:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 277 transitions. [2024-11-20 09:23:02,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5653061224489796 [2024-11-20 09:23:02,858 INFO L175 Difference]: Start difference. First operand has 84 places, 58 transitions, 237 flow. Second operand 10 states and 277 transitions. [2024-11-20 09:23:02,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 131 transitions, 727 flow [2024-11-20 09:23:02,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 131 transitions, 708 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-20 09:23:02,865 INFO L231 Difference]: Finished difference. Result has 84 places, 59 transitions, 256 flow [2024-11-20 09:23:02,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=84, PETRI_TRANSITIONS=59} [2024-11-20 09:23:02,868 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2024-11-20 09:23:02,868 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 59 transitions, 256 flow [2024-11-20 09:23:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 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-11-20 09:23:02,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:23:02,871 INFO L204 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-11-20 09:23:02,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:23:02,872 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:23:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:23:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1563086036, now seen corresponding path program 6 times [2024-11-20 09:23:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:23:02,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190910831] [2024-11-20 09:23:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:23:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:23:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:23:02,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:23:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:23:03,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:23:03,074 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:23:03,075 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-20 09:23:03,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-20 09:23:03,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-20 09:23:03,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 09:23:03,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 09:23:03,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 09:23:03,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-20 09:23:03,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:23:03,078 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-20 09:23:03,185 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 09:23:03,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:23:03,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:23:03 BasicIcfg [2024-11-20 09:23:03,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:23:03,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:23:03,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:23:03,197 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:23:03,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:22:40" (3/4) ... [2024-11-20 09:23:03,199 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 09:23:03,323 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 09:23:03,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:23:03,323 INFO L158 Benchmark]: Toolchain (without parser) took 24727.89ms. Allocated memory was 132.1MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 62.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 404.0MB. Max. memory is 16.1GB. [2024-11-20 09:23:03,323 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 132.1MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:23:03,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.59ms. Allocated memory was 132.1MB in the beginning and 182.5MB in the end (delta: 50.3MB). Free memory was 62.0MB in the beginning and 134.8MB in the end (delta: -72.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-20 09:23:03,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.63ms. Allocated memory is still 182.5MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:23:03,324 INFO L158 Benchmark]: Boogie Preprocessor took 81.27ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 128.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:23:03,324 INFO L158 Benchmark]: RCFGBuilder took 799.37ms. Allocated memory is still 182.5MB. Free memory was 128.5MB in the beginning and 70.8MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-20 09:23:03,325 INFO L158 Benchmark]: TraceAbstraction took 22969.16ms. Allocated memory was 182.5MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 69.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 339.2MB. Max. memory is 16.1GB. [2024-11-20 09:23:03,325 INFO L158 Benchmark]: Witness Printer took 125.76ms. Allocated memory is still 2.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 09:23:03,328 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.77ms. Allocated memory is still 132.1MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.59ms. Allocated memory was 132.1MB in the beginning and 182.5MB in the end (delta: 50.3MB). Free memory was 62.0MB in the beginning and 134.8MB in the end (delta: -72.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.63ms. Allocated memory is still 182.5MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.27ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 128.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 799.37ms. Allocated memory is still 182.5MB. Free memory was 128.5MB in the beginning and 70.8MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22969.16ms. Allocated memory was 182.5MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 69.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 339.2MB. Max. memory is 16.1GB. * Witness Printer took 125.76ms. Allocated memory is still 2.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, t490=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, t490=0, t491=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L888] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 22.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 835 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 429 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1735 IncrementalHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 45 mSDtfsCounter, 1735 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=8, InterpolantAutomatonStates: 65, 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, 1.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 2246 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-11-20 09:23:03,354 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