./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/mix004.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/mix004.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:21:30,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:21:30,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:21:30,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:21:30,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:21:30,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:21:30,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:21:30,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:21:30,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:21:30,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:21:30,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:21:30,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:21:30,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:21:30,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:21:30,907 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:21:30,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:21:30,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:21:30,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:21:30,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:21:30,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:21:30,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:21:30,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:21:30,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:21:30,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:21:30,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:21:30,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:21:30,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:21:30,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:21:30,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:21:30,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:21:30,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:21:30,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:21:30,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:21:30,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:21:30,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:21:30,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:21:30,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:21:30,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:21:30,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:21:30,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:21:30,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:21:30,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:21:30,920 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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2024-10-14 14:21:31,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:21:31,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:21:31,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:21:31,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:21:31,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:21:31,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2024-10-14 14:21:32,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:21:32,869 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:21:32,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2024-10-14 14:21:32,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce242c44/84f232ccf2d94d2a8f81e0e0ed5af233/FLAG3afc3744a [2024-10-14 14:21:32,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ce242c44/84f232ccf2d94d2a8f81e0e0ed5af233 [2024-10-14 14:21:32,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:21:32,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:21:32,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:21:32,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:21:32,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:21:32,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:21:32" (1/1) ... [2024-10-14 14:21:32,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc11f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:32, skipping insertion in model container [2024-10-14 14:21:32,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:21:32" (1/1) ... [2024-10-14 14:21:32,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:21:33,138 WARN L248 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/mix004.opt.i[944,957] [2024-10-14 14:21:33,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:21:33,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:21:33,415 WARN L248 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/mix004.opt.i[944,957] [2024-10-14 14:21:33,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:21:33,519 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:21:33,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33 WrapperNode [2024-10-14 14:21:33,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:21:33,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:21:33,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:21:33,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:21:33,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,599 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2024-10-14 14:21:33,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:21:33,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:21:33,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:21:33,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:21:33,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,646 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-10-14 14:21:33,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:21:33,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:21:33,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:21:33,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:21:33,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (1/1) ... [2024-10-14 14:21:33,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:21:33,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:21:33,745 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-10-14 14:21:33,769 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-10-14 14:21:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 14:21:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:21:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-14 14:21:33,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-14 14:21:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-14 14:21:33,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-14 14:21:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-14 14:21:33,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-14 14:21:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-14 14:21:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-14 14:21:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:21:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 14:21:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:21:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:21:33,822 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:21:33,958 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:21:33,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:21:34,296 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:21:34,296 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:21:34,531 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:21:34,532 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 14:21:34,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:34 BoogieIcfgContainer [2024-10-14 14:21:34,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:21:34,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:21:34,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:21:34,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:21:34,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:21:32" (1/3) ... [2024-10-14 14:21:34,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba8ce5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:21:34, skipping insertion in model container [2024-10-14 14:21:34,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:33" (2/3) ... [2024-10-14 14:21:34,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba8ce5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:21:34, skipping insertion in model container [2024-10-14 14:21:34,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:34" (3/3) ... [2024-10-14 14:21:34,545 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2024-10-14 14:21:34,566 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:21:34,566 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 14:21:34,566 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:21:34,634 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 14:21:34,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-10-14 14:21:34,719 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-10-14 14:21:34,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:21:34,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-10-14 14:21:34,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-10-14 14:21:34,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-10-14 14:21:34,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:21:34,746 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;@4c2a3a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:21:34,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 14:21:34,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:21:34,755 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-14 14:21:34,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:21:34,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:34,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:21:34,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:34,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1584569766, now seen corresponding path program 1 times [2024-10-14 14:21:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:34,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567865141] [2024-10-14 14:21:34,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567865141] [2024-10-14 14:21:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567865141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:35,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 14:21:35,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143440417] [2024-10-14 14:21:35,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:21:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:35,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:21:35,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:21:35,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-10-14 14:21:35,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-10-14 14:21:35,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:35,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-10-14 14:21:35,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:35,833 INFO L124 PetriNetUnfolderBase]: 879/1527 cut-off events. [2024-10-14 14:21:35,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:21:35,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1527 events. 879/1527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10683 event pairs, 159 based on Foata normal form. 60/1531 useless extension candidates. Maximal degree in co-relation 2835. Up to 1009 conditions per place. [2024-10-14 14:21:35,855 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-10-14 14:21:35,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 178 flow [2024-10-14 14:21:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:21:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:21:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-10-14 14:21:35,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.76 [2024-10-14 14:21:35,872 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 114 transitions. [2024-10-14 14:21:35,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 178 flow [2024-10-14 14:21:35,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 14:21:35,879 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-10-14 14:21:35,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-14 14:21:35,887 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-10-14 14:21:35,887 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-10-14 14:21:35,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-10-14 14:21:35,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:35,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:21:35,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:21:35,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:35,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1625964321, now seen corresponding path program 1 times [2024-10-14 14:21:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:35,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735161202] [2024-10-14 14:21:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:36,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:36,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735161202] [2024-10-14 14:21:36,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735161202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:21:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918659127] [2024-10-14 14:21:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:36,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:21:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:21:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:21:36,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:21:36,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-10-14 14:21:36,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:36,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:21:36,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:37,086 INFO L124 PetriNetUnfolderBase]: 4037/6466 cut-off events. [2024-10-14 14:21:37,087 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-10-14 14:21:37,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12426 conditions, 6466 events. 4037/6466 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 46089 event pairs, 603 based on Foata normal form. 216/6462 useless extension candidates. Maximal degree in co-relation 12416. Up to 3225 conditions per place. [2024-10-14 14:21:37,141 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 46 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-10-14 14:21:37,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 270 flow [2024-10-14 14:21:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:21:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:21:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-10-14 14:21:37,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.715 [2024-10-14 14:21:37,146 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 143 transitions. [2024-10-14 14:21:37,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 270 flow [2024-10-14 14:21:37,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:21:37,153 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-10-14 14:21:37,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, 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=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-10-14 14:21:37,154 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-10-14 14:21:37,154 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-10-14 14:21:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-10-14 14:21:37,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:37,155 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-10-14 14:21:37,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:21:37,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1162633639, now seen corresponding path program 1 times [2024-10-14 14:21:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653032285] [2024-10-14 14:21:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653032285] [2024-10-14 14:21:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653032285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:21:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418490905] [2024-10-14 14:21:37,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:37,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:21:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:37,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:21:37,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:21:37,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:21:37,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:21:37,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:37,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:21:37,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:38,335 INFO L124 PetriNetUnfolderBase]: 3433/5500 cut-off events. [2024-10-14 14:21:38,335 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2024-10-14 14:21:38,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12506 conditions, 5500 events. 3433/5500 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 37486 event pairs, 213 based on Foata normal form. 208/5532 useless extension candidates. Maximal degree in co-relation 12494. Up to 2433 conditions per place. [2024-10-14 14:21:38,380 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-10-14 14:21:38,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 387 flow [2024-10-14 14:21:38,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:21:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:21:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-10-14 14:21:38,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.728 [2024-10-14 14:21:38,384 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 182 transitions. [2024-10-14 14:21:38,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 387 flow [2024-10-14 14:21:38,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-14 14:21:38,392 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-10-14 14:21:38,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-10-14 14:21:38,394 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-10-14 14:21:38,394 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-10-14 14:21:38,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:21:38,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:38,395 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-10-14 14:21:38,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:21:38,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:38,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1323654171, now seen corresponding path program 1 times [2024-10-14 14:21:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:38,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062205964] [2024-10-14 14:21:38,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:38,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:38,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062205964] [2024-10-14 14:21:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062205964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:21:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707271450] [2024-10-14 14:21:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:21:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:21:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:21:38,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:21:38,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 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-10-14 14:21:38,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:38,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:21:38,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:39,353 INFO L124 PetriNetUnfolderBase]: 2355/3706 cut-off events. [2024-10-14 14:21:39,354 INFO L125 PetriNetUnfolderBase]: For 3022/3022 co-relation queries the response was YES. [2024-10-14 14:21:39,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9624 conditions, 3706 events. 2355/3706 cut-off events. For 3022/3022 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21955 event pairs, 81 based on Foata normal form. 164/3778 useless extension candidates. Maximal degree in co-relation 9610. Up to 1089 conditions per place. [2024-10-14 14:21:39,383 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 70 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2024-10-14 14:21:39,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 510 flow [2024-10-14 14:21:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:21:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:21:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-10-14 14:21:39,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.73 [2024-10-14 14:21:39,388 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 219 transitions. [2024-10-14 14:21:39,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 510 flow [2024-10-14 14:21:39,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-14 14:21:39,403 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-10-14 14:21:39,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-10-14 14:21:39,404 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-14 14:21:39,405 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-10-14 14:21:39,405 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-10-14 14:21:39,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:39,406 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] [2024-10-14 14:21:39,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:21:39,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:39,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1164537212, now seen corresponding path program 1 times [2024-10-14 14:21:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:39,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367029032] [2024-10-14 14:21:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:39,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:39,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367029032] [2024-10-14 14:21:39,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367029032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:39,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:39,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:21:39,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149479035] [2024-10-14 14:21:39,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:39,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:21:39,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:39,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:21:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:21:39,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-10-14 14:21:39,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-10-14 14:21:39,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:39,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-10-14 14:21:39,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:40,132 INFO L124 PetriNetUnfolderBase]: 1527/2282 cut-off events. [2024-10-14 14:21:40,133 INFO L125 PetriNetUnfolderBase]: For 3368/3368 co-relation queries the response was YES. [2024-10-14 14:21:40,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2282 events. 1527/2282 cut-off events. For 3368/3368 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11364 event pairs, 47 based on Foata normal form. 80/2334 useless extension candidates. Maximal degree in co-relation 6754. Up to 768 conditions per place. [2024-10-14 14:21:40,153 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-10-14 14:21:40,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 508 flow [2024-10-14 14:21:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:21:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 14:21:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2024-10-14 14:21:40,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-10-14 14:21:40,155 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 238 transitions. [2024-10-14 14:21:40,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 508 flow [2024-10-14 14:21:40,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-14 14:21:40,173 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-10-14 14:21:40,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-10-14 14:21:40,175 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-10-14 14:21:40,175 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-10-14 14:21:40,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-10-14 14:21:40,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:40,176 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, 1] [2024-10-14 14:21:40,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:21:40,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1766026394, now seen corresponding path program 1 times [2024-10-14 14:21:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242079862] [2024-10-14 14:21:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242079862] [2024-10-14 14:21:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242079862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:40,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:40,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:21:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054944873] [2024-10-14 14:21:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:40,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:21:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:40,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:21:40,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:21:40,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-10-14 14:21:40,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10-14 14:21:40,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:40,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-10-14 14:21:40,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:41,477 INFO L124 PetriNetUnfolderBase]: 3768/6308 cut-off events. [2024-10-14 14:21:41,478 INFO L125 PetriNetUnfolderBase]: For 3079/3271 co-relation queries the response was YES. [2024-10-14 14:21:41,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14661 conditions, 6308 events. 3768/6308 cut-off events. For 3079/3271 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 42856 event pairs, 323 based on Foata normal form. 16/6058 useless extension candidates. Maximal degree in co-relation 14645. Up to 2948 conditions per place. [2024-10-14 14:21:41,539 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 54 selfloop transitions, 12 changer transitions 12/106 dead transitions. [2024-10-14 14:21:41,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 526 flow [2024-10-14 14:21:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:21:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 14:21:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-10-14 14:21:41,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6257142857142857 [2024-10-14 14:21:41,541 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 7 states and 219 transitions. [2024-10-14 14:21:41,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 526 flow [2024-10-14 14:21:41,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 420 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-10-14 14:21:41,591 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 239 flow [2024-10-14 14:21:41,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-10-14 14:21:41,592 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-10-14 14:21:41,592 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 239 flow [2024-10-14 14:21:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10-14 14:21:41,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:41,592 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, 1] [2024-10-14 14:21:41,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:21:41,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:41,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -59109152, now seen corresponding path program 2 times [2024-10-14 14:21:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437365693] [2024-10-14 14:21:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437365693] [2024-10-14 14:21:41,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437365693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:41,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:41,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:21:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812583624] [2024-10-14 14:21:41,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:41,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:21:41,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:41,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:21:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:21:41,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-10-14 14:21:41,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-10-14 14:21:41,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:41,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-10-14 14:21:41,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:42,791 INFO L124 PetriNetUnfolderBase]: 4538/8025 cut-off events. [2024-10-14 14:21:42,791 INFO L125 PetriNetUnfolderBase]: For 1746/1864 co-relation queries the response was YES. [2024-10-14 14:21:42,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17692 conditions, 8025 events. 4538/8025 cut-off events. For 1746/1864 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 61607 event pairs, 1383 based on Foata normal form. 22/7369 useless extension candidates. Maximal degree in co-relation 17676. Up to 3130 conditions per place. [2024-10-14 14:21:42,847 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 52 selfloop transitions, 3 changer transitions 12/104 dead transitions. [2024-10-14 14:21:42,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 490 flow [2024-10-14 14:21:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:21:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:21:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2024-10-14 14:21:42,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6566666666666666 [2024-10-14 14:21:42,849 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 239 flow. Second operand 6 states and 197 transitions. [2024-10-14 14:21:42,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 490 flow [2024-10-14 14:21:42,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 484 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-14 14:21:42,855 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 266 flow [2024-10-14 14:21:42,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-10-14 14:21:42,856 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2024-10-14 14:21:42,856 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 266 flow [2024-10-14 14:21:42,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-10-14 14:21:42,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:42,856 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, 1] [2024-10-14 14:21:42,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:21:42,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:42,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash -509831754, now seen corresponding path program 3 times [2024-10-14 14:21:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728041345] [2024-10-14 14:21:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728041345] [2024-10-14 14:21:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728041345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:43,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:21:43,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941239031] [2024-10-14 14:21:43,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:43,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:21:43,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:43,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:21:43,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:21:43,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-10-14 14:21:43,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-10-14 14:21:43,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:43,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-10-14 14:21:43,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:44,502 INFO L124 PetriNetUnfolderBase]: 7804/14072 cut-off events. [2024-10-14 14:21:44,502 INFO L125 PetriNetUnfolderBase]: For 4544/4700 co-relation queries the response was YES. [2024-10-14 14:21:44,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31774 conditions, 14072 events. 7804/14072 cut-off events. For 4544/4700 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 119174 event pairs, 2306 based on Foata normal form. 48/13143 useless extension candidates. Maximal degree in co-relation 31755. Up to 4526 conditions per place. [2024-10-14 14:21:44,589 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 42 selfloop transitions, 3 changer transitions 28/111 dead transitions. [2024-10-14 14:21:44,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 111 transitions, 552 flow [2024-10-14 14:21:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:21:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:21:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-10-14 14:21:44,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.67 [2024-10-14 14:21:44,591 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 266 flow. Second operand 6 states and 201 transitions. [2024-10-14 14:21:44,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 111 transitions, 552 flow [2024-10-14 14:21:44,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 111 transitions, 545 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-14 14:21:44,603 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 281 flow [2024-10-14 14:21:44,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2024-10-14 14:21:44,604 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2024-10-14 14:21:44,604 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 281 flow [2024-10-14 14:21:44,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-10-14 14:21:44,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:44,604 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, 1] [2024-10-14 14:21:44,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:21:44,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:44,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2016524288, now seen corresponding path program 4 times [2024-10-14 14:21:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079931364] [2024-10-14 14:21:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079931364] [2024-10-14 14:21:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079931364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:21:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422841578] [2024-10-14 14:21:44,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:21:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:21:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:21:44,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-10-14 14:21:44,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-10-14 14:21:44,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:44,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-10-14 14:21:44,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:46,694 INFO L124 PetriNetUnfolderBase]: 10051/17582 cut-off events. [2024-10-14 14:21:46,695 INFO L125 PetriNetUnfolderBase]: For 6274/6482 co-relation queries the response was YES. [2024-10-14 14:21:46,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39562 conditions, 17582 events. 10051/17582 cut-off events. For 6274/6482 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 152007 event pairs, 3250 based on Foata normal form. 92/16125 useless extension candidates. Maximal degree in co-relation 39541. Up to 7432 conditions per place. [2024-10-14 14:21:46,812 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 1 changer transitions 39/101 dead transitions. [2024-10-14 14:21:46,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 101 transitions, 507 flow [2024-10-14 14:21:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:21:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:21:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-10-14 14:21:46,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2024-10-14 14:21:46,814 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 281 flow. Second operand 6 states and 196 transitions. [2024-10-14 14:21:46,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 101 transitions, 507 flow [2024-10-14 14:21:46,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 500 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-14 14:21:46,834 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 218 flow [2024-10-14 14:21:46,835 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=81, PETRI_TRANSITIONS=57} [2024-10-14 14:21:46,837 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2024-10-14 14:21:46,837 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 218 flow [2024-10-14 14:21:46,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-10-14 14:21:46,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:46,838 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, 1] [2024-10-14 14:21:46,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:21:46,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:46,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 270024558, now seen corresponding path program 5 times [2024-10-14 14:21:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:46,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760900426] [2024-10-14 14:21:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:21:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:21:49,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:21:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760900426] [2024-10-14 14:21:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760900426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:21:49,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:21:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:21:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144446255] [2024-10-14 14:21:49,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:21:49,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:21:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:21:49,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:21:49,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:21:49,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2024-10-14 14:21:49,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 218 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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-10-14 14:21:49,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:21:49,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2024-10-14 14:21:49,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:21:49,974 INFO L124 PetriNetUnfolderBase]: 3651/6704 cut-off events. [2024-10-14 14:21:49,974 INFO L125 PetriNetUnfolderBase]: For 1106/1208 co-relation queries the response was YES. [2024-10-14 14:21:49,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13901 conditions, 6704 events. 3651/6704 cut-off events. For 1106/1208 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 52376 event pairs, 852 based on Foata normal form. 16/6000 useless extension candidates. Maximal degree in co-relation 13878. Up to 2022 conditions per place. [2024-10-14 14:21:50,004 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 32 selfloop transitions, 6 changer transitions 16/89 dead transitions. [2024-10-14 14:21:50,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 402 flow [2024-10-14 14:21:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:21:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 14:21:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2024-10-14 14:21:50,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.61 [2024-10-14 14:21:50,007 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 218 flow. Second operand 10 states and 305 transitions. [2024-10-14 14:21:50,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 402 flow [2024-10-14 14:21:50,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 382 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-14 14:21:50,015 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 231 flow [2024-10-14 14:21:50,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=84, PETRI_TRANSITIONS=58} [2024-10-14 14:21:50,018 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2024-10-14 14:21:50,019 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 231 flow [2024-10-14 14:21:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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-10-14 14:21:50,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:21:50,022 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, 1] [2024-10-14 14:21:50,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 14:21:50,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:21:50,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:21:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1340982666, now seen corresponding path program 6 times [2024-10-14 14:21:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:21:50,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777421603] [2024-10-14 14:21:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:21:50,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:21:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:21:50,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:21:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:21:50,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:21:50,223 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:21:50,225 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-14 14:21:50,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-14 14:21:50,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-14 14:21:50,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-14 14:21:50,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-14 14:21:50,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-14 14:21:50,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-14 14:21:50,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:21:50,231 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-10-14 14:21:50,324 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 14:21:50,324 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:21:50,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:21:50 BasicIcfg [2024-10-14 14:21:50,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:21:50,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:21:50,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:21:50,333 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:21:50,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:34" (3/4) ... [2024-10-14 14:21:50,335 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 14:21:50,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 14:21:50,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:21:50,428 INFO L158 Benchmark]: Toolchain (without parser) took 17526.38ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 94.3MB in the beginning and 619.7MB in the end (delta: -525.4MB). Peak memory consumption was 628.5MB. Max. memory is 16.1GB. [2024-10-14 14:21:50,429 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 111.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:21:50,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.14ms. Allocated memory is still 151.0MB. Free memory was 94.3MB in the beginning and 67.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 14:21:50,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.05ms. Allocated memory is still 151.0MB. Free memory was 67.6MB in the beginning and 64.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:21:50,430 INFO L158 Benchmark]: Boogie Preprocessor took 107.59ms. Allocated memory is still 151.0MB. Free memory was 64.6MB in the beginning and 120.2MB in the end (delta: -55.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-10-14 14:21:50,430 INFO L158 Benchmark]: RCFGBuilder took 824.30ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 120.1MB in the beginning and 148.8MB in the end (delta: -28.7MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-10-14 14:21:50,430 INFO L158 Benchmark]: TraceAbstraction took 15796.66ms. Allocated memory was 234.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 147.7MB in the beginning and 639.6MB in the end (delta: -491.9MB). Peak memory consumption was 577.6MB. Max. memory is 16.1GB. [2024-10-14 14:21:50,430 INFO L158 Benchmark]: Witness Printer took 95.30ms. Allocated memory is still 1.3GB. Free memory was 639.6MB in the beginning and 619.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 14:21:50,432 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.17ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 111.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.14ms. Allocated memory is still 151.0MB. Free memory was 94.3MB in the beginning and 67.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.05ms. Allocated memory is still 151.0MB. Free memory was 67.6MB in the beginning and 64.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.59ms. Allocated memory is still 151.0MB. Free memory was 64.6MB in the beginning and 120.2MB in the end (delta: -55.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * RCFGBuilder took 824.30ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 120.1MB in the beginning and 148.8MB in the end (delta: -28.7MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15796.66ms. Allocated memory was 234.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 147.7MB in the beginning and 639.6MB in the end (delta: -491.9MB). Peak memory consumption was 577.6MB. Max. memory is 16.1GB. * Witness Printer took 95.30ms. Allocated memory is still 1.3GB. Free memory was 639.6MB in the beginning and 619.7MB in the end (delta: 19.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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-3, t94=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-3, t94=-2, t95=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-3, t94=-2, t95=-1, t96=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, t93=-3, t94=-2, t95=-1, t96=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, t93=-3, t94=-2, t95=-1, t96=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, t93=-3, t94=-2, t95=-1, t96=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 876]: 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: 878]: 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: 872]: 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: 874]: 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, 85 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: 15.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 623 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1486 IncrementalHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 16 mSDtfsCounter, 1486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1761 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-10-14 14:21:50,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE