./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:25:51,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:25:51,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:25:51,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:25:51,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:25:51,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:25:51,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:25:51,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:25:51,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:25:51,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:25:51,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:25:51,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:25:51,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:25:51,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:25:51,869 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:25:51,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:25:51,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:25:51,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:25:51,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:25:51,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:25:51,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:25:51,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:25:51,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:25:51,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:25:51,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:25:51,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:25:51,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:25:51,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:25:51,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:25:51,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:25:51,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:25:51,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:25:51,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:25:51,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:25:51,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:25:51,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:25:51,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:25:51,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:25:51,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:25:51,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:25:51,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:25:51,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:25:51,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:25:51,876 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2024-06-27 17:25:52,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:25:52,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:25:52,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:25:52,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:25:52,126 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:25:52,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2024-06-27 17:25:53,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:25:53,522 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:25:53,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2024-06-27 17:25:53,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d59a977/54f31b6c6d584fe6835cc2cdb292cf7a/FLAG95905c999 [2024-06-27 17:25:53,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d59a977/54f31b6c6d584fe6835cc2cdb292cf7a [2024-06-27 17:25:53,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:25:53,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:25:53,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:25:53,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:25:53,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:25:53,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:25:53" (1/1) ... [2024-06-27 17:25:53,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff6c582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:53, skipping insertion in model container [2024-06-27 17:25:53,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:25:53" (1/1) ... [2024-06-27 17:25:53,587 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:25:53,717 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2024-06-27 17:25:53,910 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:25:53,922 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:25:53,933 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2024-06-27 17:25:53,988 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:25:54,023 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:25:54,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54 WrapperNode [2024-06-27 17:25:54,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:25:54,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:25:54,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:25:54,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:25:54,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,087 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-06-27 17:25:54,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:25:54,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:25:54,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:25:54,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:25:54,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,134 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 17:25:54,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:25:54,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:25:54,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:25:54,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:25:54,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (1/1) ... [2024-06-27 17:25:54,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:25:54,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:25:54,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:25:54,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:25:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:25:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:25:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:25:54,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:25:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:25:54,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:25:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:25:54,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:25:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:25:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:25:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:25:54,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:25:54,241 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:25:54,354 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:25:54,356 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:25:54,675 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:25:54,676 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:25:54,818 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:25:54,819 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:25:54,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:25:54 BoogieIcfgContainer [2024-06-27 17:25:54,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:25:54,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:25:54,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:25:54,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:25:54,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:25:53" (1/3) ... [2024-06-27 17:25:54,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e51b84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:25:54, skipping insertion in model container [2024-06-27 17:25:54,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:25:54" (2/3) ... [2024-06-27 17:25:54,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e51b84c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:25:54, skipping insertion in model container [2024-06-27 17:25:54,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:25:54" (3/3) ... [2024-06-27 17:25:54,826 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2024-06-27 17:25:54,832 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:25:54,840 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:25:54,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:25:54,840 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:25:54,884 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:25:54,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-06-27 17:25:54,945 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-06-27 17:25:54,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:25:54,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-06-27 17:25:54,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-06-27 17:25:54,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-06-27 17:25:54,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:25:54,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@675ca306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:25:54,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 17:25:54,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:25:54,991 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-06-27 17:25:54,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:25:54,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:54,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 17:25:54,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:54,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2054177573, now seen corresponding path program 1 times [2024-06-27 17:25:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:55,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149252398] [2024-06-27 17:25:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:55,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149252398] [2024-06-27 17:25:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149252398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:25:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320607011] [2024-06-27 17:25:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:55,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:25:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:55,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:25:55,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:25:55,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-06-27 17:25:55,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:55,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:55,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-06-27 17:25:55,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:55,612 INFO L124 PetriNetUnfolderBase]: 528/986 cut-off events. [2024-06-27 17:25:55,612 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-06-27 17:25:55,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 986 events. 528/986 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5906 event pairs, 168 based on Foata normal form. 36/991 useless extension candidates. Maximal degree in co-relation 1823. Up to 652 conditions per place. [2024-06-27 17:25:55,623 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 27 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-06-27 17:25:55,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 168 flow [2024-06-27 17:25:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:25:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:25:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-06-27 17:25:55,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-06-27 17:25:55,637 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 91 transitions. [2024-06-27 17:25:55,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 168 flow [2024-06-27 17:25:55,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:25:55,643 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-06-27 17:25:55,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-06-27 17:25:55,648 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-06-27 17:25:55,648 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-06-27 17:25:55,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:55,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:55,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:55,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:25:55,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:55,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2009873417, now seen corresponding path program 1 times [2024-06-27 17:25:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862125622] [2024-06-27 17:25:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:56,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:56,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862125622] [2024-06-27 17:25:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862125622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:56,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:56,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:25:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387192918] [2024-06-27 17:25:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:56,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:25:56,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:25:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:25:56,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-06-27 17:25:56,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:56,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:56,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-06-27 17:25:56,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:56,867 INFO L124 PetriNetUnfolderBase]: 1636/2646 cut-off events. [2024-06-27 17:25:56,868 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2024-06-27 17:25:56,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5285 conditions, 2646 events. 1636/2646 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16285 event pairs, 257 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 5275. Up to 1352 conditions per place. [2024-06-27 17:25:56,876 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 29 selfloop transitions, 2 changer transitions 47/89 dead transitions. [2024-06-27 17:25:56,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 356 flow [2024-06-27 17:25:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:25:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:25:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 17:25:56,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 17:25:56,879 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 192 transitions. [2024-06-27 17:25:56,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 356 flow [2024-06-27 17:25:56,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:25:56,881 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2024-06-27 17:25:56,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2024-06-27 17:25:56,882 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-06-27 17:25:56,882 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2024-06-27 17:25:56,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:56,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:56,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:56,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:25:56,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:56,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash 801650005, now seen corresponding path program 1 times [2024-06-27 17:25:56,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684161103] [2024-06-27 17:25:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684161103] [2024-06-27 17:25:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684161103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:57,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:57,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:25:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734954508] [2024-06-27 17:25:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:57,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:25:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:25:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:25:57,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-06-27 17:25:57,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:57,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:57,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-06-27 17:25:57,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:57,355 INFO L124 PetriNetUnfolderBase]: 874/1537 cut-off events. [2024-06-27 17:25:57,355 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2024-06-27 17:25:57,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1537 events. 874/1537 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9322 event pairs, 473 based on Foata normal form. 48/1572 useless extension candidates. Maximal degree in co-relation 3237. Up to 1057 conditions per place. [2024-06-27 17:25:57,362 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 28 selfloop transitions, 3 changer transitions 27/71 dead transitions. [2024-06-27 17:25:57,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 294 flow [2024-06-27 17:25:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:25:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:25:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-27 17:25:57,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-27 17:25:57,366 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 7 states and 172 transitions. [2024-06-27 17:25:57,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 294 flow [2024-06-27 17:25:57,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 274 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 17:25:57,375 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 111 flow [2024-06-27 17:25:57,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2024-06-27 17:25:57,376 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2024-06-27 17:25:57,377 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 111 flow [2024-06-27 17:25:57,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:57,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:57,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:57,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:25:57,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:57,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1855882729, now seen corresponding path program 1 times [2024-06-27 17:25:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005356599] [2024-06-27 17:25:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005356599] [2024-06-27 17:25:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005356599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:57,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:57,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:25:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833268959] [2024-06-27 17:25:57,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:57,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:25:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:25:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:25:57,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-06-27 17:25:57,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:57,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:57,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-06-27 17:25:57,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:58,071 INFO L124 PetriNetUnfolderBase]: 845/1497 cut-off events. [2024-06-27 17:25:58,071 INFO L125 PetriNetUnfolderBase]: For 1080/1080 co-relation queries the response was YES. [2024-06-27 17:25:58,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3745 conditions, 1497 events. 845/1497 cut-off events. For 1080/1080 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9252 event pairs, 264 based on Foata normal form. 38/1525 useless extension candidates. Maximal degree in co-relation 3729. Up to 1042 conditions per place. [2024-06-27 17:25:58,080 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 34 selfloop transitions, 6 changer transitions 25/78 dead transitions. [2024-06-27 17:25:58,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 375 flow [2024-06-27 17:25:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:25:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:25:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-06-27 17:25:58,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.609375 [2024-06-27 17:25:58,081 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 111 flow. Second operand 8 states and 195 transitions. [2024-06-27 17:25:58,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 375 flow [2024-06-27 17:25:58,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 364 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 17:25:58,086 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 160 flow [2024-06-27 17:25:58,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2024-06-27 17:25:58,087 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-06-27 17:25:58,087 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 160 flow [2024-06-27 17:25:58,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:58,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:58,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:58,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:25:58,087 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:58,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 654441628, now seen corresponding path program 1 times [2024-06-27 17:25:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046327065] [2024-06-27 17:25:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:58,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:58,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046327065] [2024-06-27 17:25:58,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046327065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:58,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:58,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:25:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98516180] [2024-06-27 17:25:58,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:58,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:25:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:25:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:25:58,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-06-27 17:25:58,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:58,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:58,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-06-27 17:25:58,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:58,582 INFO L124 PetriNetUnfolderBase]: 857/1543 cut-off events. [2024-06-27 17:25:58,582 INFO L125 PetriNetUnfolderBase]: For 3189/3258 co-relation queries the response was YES. [2024-06-27 17:25:58,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4924 conditions, 1543 events. 857/1543 cut-off events. For 3189/3258 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9270 event pairs, 218 based on Foata normal form. 38/1559 useless extension candidates. Maximal degree in co-relation 4904. Up to 906 conditions per place. [2024-06-27 17:25:58,593 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 40 selfloop transitions, 8 changer transitions 25/86 dead transitions. [2024-06-27 17:25:58,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 510 flow [2024-06-27 17:25:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:25:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:25:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 17:25:58,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.621875 [2024-06-27 17:25:58,594 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 160 flow. Second operand 8 states and 199 transitions. [2024-06-27 17:25:58,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 510 flow [2024-06-27 17:25:58,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 484 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 17:25:58,602 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 199 flow [2024-06-27 17:25:58,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=199, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-06-27 17:25:58,603 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2024-06-27 17:25:58,603 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 199 flow [2024-06-27 17:25:58,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:58,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:58,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:58,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:25:58,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:58,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash 334882358, now seen corresponding path program 2 times [2024-06-27 17:25:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:58,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049252819] [2024-06-27 17:25:58,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049252819] [2024-06-27 17:25:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049252819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:58,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:58,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:25:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956689270] [2024-06-27 17:25:58,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:25:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:25:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:25:58,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-06-27 17:25:58,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:58,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:58,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-06-27 17:25:58,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:59,200 INFO L124 PetriNetUnfolderBase]: 800/1447 cut-off events. [2024-06-27 17:25:59,200 INFO L125 PetriNetUnfolderBase]: For 4223/4338 co-relation queries the response was YES. [2024-06-27 17:25:59,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 1447 events. 800/1447 cut-off events. For 4223/4338 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8770 event pairs, 120 based on Foata normal form. 41/1466 useless extension candidates. Maximal degree in co-relation 5037. Up to 879 conditions per place. [2024-06-27 17:25:59,210 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 37 selfloop transitions, 8 changer transitions 25/83 dead transitions. [2024-06-27 17:25:59,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 531 flow [2024-06-27 17:25:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:25:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:25:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 17:25:59,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6125 [2024-06-27 17:25:59,212 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 199 flow. Second operand 8 states and 196 transitions. [2024-06-27 17:25:59,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 531 flow [2024-06-27 17:25:59,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 491 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 17:25:59,221 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 206 flow [2024-06-27 17:25:59,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2024-06-27 17:25:59,222 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2024-06-27 17:25:59,222 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 206 flow [2024-06-27 17:25:59,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:59,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:59,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:59,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:25:59,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:59,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1704138548, now seen corresponding path program 1 times [2024-06-27 17:25:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:59,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464822145] [2024-06-27 17:25:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:59,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464822145] [2024-06-27 17:25:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464822145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:59,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:25:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786681453] [2024-06-27 17:25:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:59,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:25:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:25:59,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:25:59,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:25:59,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:59,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:59,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:25:59,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:25:59,731 INFO L124 PetriNetUnfolderBase]: 1543/2793 cut-off events. [2024-06-27 17:25:59,732 INFO L125 PetriNetUnfolderBase]: For 6667/6682 co-relation queries the response was YES. [2024-06-27 17:25:59,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9075 conditions, 2793 events. 1543/2793 cut-off events. For 6667/6682 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18654 event pairs, 232 based on Foata normal form. 48/2819 useless extension candidates. Maximal degree in co-relation 9050. Up to 1079 conditions per place. [2024-06-27 17:25:59,748 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 51 selfloop transitions, 2 changer transitions 16/83 dead transitions. [2024-06-27 17:25:59,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 558 flow [2024-06-27 17:25:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:25:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:25:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-06-27 17:25:59,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-06-27 17:25:59,749 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 206 flow. Second operand 6 states and 146 transitions. [2024-06-27 17:25:59,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 558 flow [2024-06-27 17:25:59,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 502 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 17:25:59,763 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 193 flow [2024-06-27 17:25:59,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-06-27 17:25:59,763 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2024-06-27 17:25:59,763 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 193 flow [2024-06-27 17:25:59,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:59,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:25:59,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:25:59,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:25:59,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:25:59,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:25:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2126030046, now seen corresponding path program 2 times [2024-06-27 17:25:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:25:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685798173] [2024-06-27 17:25:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:25:59,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:25:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:25:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:25:59,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:25:59,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685798173] [2024-06-27 17:25:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685798173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:25:59,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:25:59,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:25:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605144145] [2024-06-27 17:25:59,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:25:59,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:25:59,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:25:59,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:25:59,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:25:59,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:25:59,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:25:59,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:25:59,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:25:59,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:00,216 INFO L124 PetriNetUnfolderBase]: 2418/4010 cut-off events. [2024-06-27 17:26:00,216 INFO L125 PetriNetUnfolderBase]: For 6585/6770 co-relation queries the response was YES. [2024-06-27 17:26:00,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11936 conditions, 4010 events. 2418/4010 cut-off events. For 6585/6770 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 25378 event pairs, 331 based on Foata normal form. 197/4092 useless extension candidates. Maximal degree in co-relation 11913. Up to 2128 conditions per place. [2024-06-27 17:26:00,238 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 53 selfloop transitions, 5 changer transitions 2/74 dead transitions. [2024-06-27 17:26:00,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 447 flow [2024-06-27 17:26:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:26:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:26:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-06-27 17:26:00,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-06-27 17:26:00,240 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 193 flow. Second operand 4 states and 107 transitions. [2024-06-27 17:26:00,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 447 flow [2024-06-27 17:26:00,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 438 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 17:26:00,246 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 222 flow [2024-06-27 17:26:00,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-06-27 17:26:00,247 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2024-06-27 17:26:00,247 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 222 flow [2024-06-27 17:26:00,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:00,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:00,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:00,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:26:00,248 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:26:00,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1398733099, now seen corresponding path program 1 times [2024-06-27 17:26:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550357731] [2024-06-27 17:26:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:00,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:00,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:00,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550357731] [2024-06-27 17:26:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550357731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:26:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651110660] [2024-06-27 17:26:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:00,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:26:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:00,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:26:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:26:00,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:26:00,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 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-06-27 17:26:00,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:00,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:26:00,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:00,630 INFO L124 PetriNetUnfolderBase]: 1770/2974 cut-off events. [2024-06-27 17:26:00,631 INFO L125 PetriNetUnfolderBase]: For 4855/5033 co-relation queries the response was YES. [2024-06-27 17:26:00,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 2974 events. 1770/2974 cut-off events. For 4855/5033 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17660 event pairs, 194 based on Foata normal form. 166/3034 useless extension candidates. Maximal degree in co-relation 9366. Up to 925 conditions per place. [2024-06-27 17:26:00,643 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 60 selfloop transitions, 8 changer transitions 1/83 dead transitions. [2024-06-27 17:26:00,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 523 flow [2024-06-27 17:26:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:26:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:26:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-06-27 17:26:00,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-27 17:26:00,645 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 222 flow. Second operand 5 states and 136 transitions. [2024-06-27 17:26:00,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 523 flow [2024-06-27 17:26:00,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:26:00,648 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 268 flow [2024-06-27 17:26:00,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2024-06-27 17:26:00,648 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places. [2024-06-27 17:26:00,648 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 268 flow [2024-06-27 17:26:00,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 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-06-27 17:26:00,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:00,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:00,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:26:00,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:26:00,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash 553541030, now seen corresponding path program 1 times [2024-06-27 17:26:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:00,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860910764] [2024-06-27 17:26:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:00,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860910764] [2024-06-27 17:26:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860910764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:00,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:26:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736320722] [2024-06-27 17:26:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:00,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:26:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:26:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:26:00,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-06-27 17:26:00,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:00,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:00,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-06-27 17:26:00,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:01,023 INFO L124 PetriNetUnfolderBase]: 1382/2318 cut-off events. [2024-06-27 17:26:01,023 INFO L125 PetriNetUnfolderBase]: For 5960/6138 co-relation queries the response was YES. [2024-06-27 17:26:01,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8157 conditions, 2318 events. 1382/2318 cut-off events. For 5960/6138 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13228 event pairs, 176 based on Foata normal form. 92/2304 useless extension candidates. Maximal degree in co-relation 8131. Up to 824 conditions per place. [2024-06-27 17:26:01,031 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 50 selfloop transitions, 11 changer transitions 6/81 dead transitions. [2024-06-27 17:26:01,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 529 flow [2024-06-27 17:26:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:26:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:26:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-27 17:26:01,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2024-06-27 17:26:01,032 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 268 flow. Second operand 6 states and 149 transitions. [2024-06-27 17:26:01,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 529 flow [2024-06-27 17:26:01,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 488 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 17:26:01,036 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 271 flow [2024-06-27 17:26:01,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-06-27 17:26:01,037 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-06-27 17:26:01,037 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 271 flow [2024-06-27 17:26:01,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:01,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:01,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:01,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:26:01,038 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:26:01,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1068440310, now seen corresponding path program 1 times [2024-06-27 17:26:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606727850] [2024-06-27 17:26:01,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:01,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:01,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:01,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606727850] [2024-06-27 17:26:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606727850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:01,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 17:26:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269130961] [2024-06-27 17:26:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:01,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:26:01,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:01,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:26:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:26:01,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-06-27 17:26:01,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:01,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:01,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-06-27 17:26:01,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:01,838 INFO L124 PetriNetUnfolderBase]: 1984/3741 cut-off events. [2024-06-27 17:26:01,838 INFO L125 PetriNetUnfolderBase]: For 7558/8474 co-relation queries the response was YES. [2024-06-27 17:26:01,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11664 conditions, 3741 events. 1984/3741 cut-off events. For 7558/8474 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 27063 event pairs, 416 based on Foata normal form. 97/3516 useless extension candidates. Maximal degree in co-relation 11638. Up to 1560 conditions per place. [2024-06-27 17:26:01,854 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 32 selfloop transitions, 3 changer transitions 50/105 dead transitions. [2024-06-27 17:26:01,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 105 transitions, 654 flow [2024-06-27 17:26:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:26:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:26:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-27 17:26:01,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54375 [2024-06-27 17:26:01,856 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 271 flow. Second operand 8 states and 174 transitions. [2024-06-27 17:26:01,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 105 transitions, 654 flow [2024-06-27 17:26:01,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 602 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 17:26:01,880 INFO L231 Difference]: Finished difference. Result has 76 places, 45 transitions, 229 flow [2024-06-27 17:26:01,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=76, PETRI_TRANSITIONS=45} [2024-06-27 17:26:01,881 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2024-06-27 17:26:01,881 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 45 transitions, 229 flow [2024-06-27 17:26:01,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:01,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:01,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:01,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:26:01,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:26:01,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1831342156, now seen corresponding path program 2 times [2024-06-27 17:26:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205877176] [2024-06-27 17:26:01,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205877176] [2024-06-27 17:26:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205877176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:02,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 17:26:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794240146] [2024-06-27 17:26:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:02,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:26:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:02,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:26:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:26:02,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-06-27 17:26:02,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 45 transitions, 229 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:02,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:02,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-06-27 17:26:02,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:02,704 INFO L124 PetriNetUnfolderBase]: 837/1767 cut-off events. [2024-06-27 17:26:02,704 INFO L125 PetriNetUnfolderBase]: For 1904/2110 co-relation queries the response was YES. [2024-06-27 17:26:02,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4969 conditions, 1767 events. 837/1767 cut-off events. For 1904/2110 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12067 event pairs, 320 based on Foata normal form. 34/1631 useless extension candidates. Maximal degree in co-relation 4939. Up to 446 conditions per place. [2024-06-27 17:26:02,712 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 38 selfloop transitions, 8 changer transitions 13/81 dead transitions. [2024-06-27 17:26:02,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 481 flow [2024-06-27 17:26:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:26:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:26:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-27 17:26:02,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58125 [2024-06-27 17:26:02,714 INFO L175 Difference]: Start difference. First operand has 76 places, 45 transitions, 229 flow. Second operand 8 states and 186 transitions. [2024-06-27 17:26:02,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 481 flow [2024-06-27 17:26:02,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 81 transitions, 445 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-27 17:26:02,721 INFO L231 Difference]: Finished difference. Result has 73 places, 49 transitions, 270 flow [2024-06-27 17:26:02,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=270, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2024-06-27 17:26:02,722 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2024-06-27 17:26:02,722 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 270 flow [2024-06-27 17:26:02,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:02,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:02,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:02,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:26:02,723 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:26:02,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:02,723 INFO L85 PathProgramCache]: Analyzing trace with hash -816838424, now seen corresponding path program 3 times [2024-06-27 17:26:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:02,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425723830] [2024-06-27 17:26:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:02,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425723830] [2024-06-27 17:26:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425723830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:03,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:03,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 17:26:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968594720] [2024-06-27 17:26:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:03,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:26:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:03,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:26:03,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:26:03,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-06-27 17:26:03,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 49 transitions, 270 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:03,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:03,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-06-27 17:26:03,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:03,563 INFO L124 PetriNetUnfolderBase]: 1112/2287 cut-off events. [2024-06-27 17:26:03,563 INFO L125 PetriNetUnfolderBase]: For 2830/3223 co-relation queries the response was YES. [2024-06-27 17:26:03,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6581 conditions, 2287 events. 1112/2287 cut-off events. For 2830/3223 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 16165 event pairs, 336 based on Foata normal form. 57/2099 useless extension candidates. Maximal degree in co-relation 6553. Up to 769 conditions per place. [2024-06-27 17:26:03,572 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 27 selfloop transitions, 6 changer transitions 22/77 dead transitions. [2024-06-27 17:26:03,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 468 flow [2024-06-27 17:26:03,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:26:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:26:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-06-27 17:26:03,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.559375 [2024-06-27 17:26:03,573 INFO L175 Difference]: Start difference. First operand has 73 places, 49 transitions, 270 flow. Second operand 8 states and 179 transitions. [2024-06-27 17:26:03,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 468 flow [2024-06-27 17:26:03,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 455 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 17:26:03,583 INFO L231 Difference]: Finished difference. Result has 79 places, 46 transitions, 264 flow [2024-06-27 17:26:03,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=264, PETRI_PLACES=79, PETRI_TRANSITIONS=46} [2024-06-27 17:26:03,584 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2024-06-27 17:26:03,584 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 46 transitions, 264 flow [2024-06-27 17:26:03,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:26:03,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:03,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:03,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 17:26:03,585 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 17:26:03,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1721909864, now seen corresponding path program 4 times [2024-06-27 17:26:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913461918] [2024-06-27 17:26:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:03,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:26:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:03,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:26:03,668 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:26:03,669 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-06-27 17:26:03,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 17:26:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-06-27 17:26:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-27 17:26:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-27 17:26:03,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 17:26:03,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 17:26:03,671 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:03,676 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:26:03,676 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:26:03,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:26:03 BasicIcfg [2024-06-27 17:26:03,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:26:03,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:26:03,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:26:03,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:26:03,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:25:54" (3/4) ... [2024-06-27 17:26:03,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:26:03,811 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:26:03,811 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:26:03,811 INFO L158 Benchmark]: Toolchain (without parser) took 10258.74ms. Allocated memory was 213.9MB in the beginning and 641.7MB in the end (delta: 427.8MB). Free memory was 142.3MB in the beginning and 359.9MB in the end (delta: -217.6MB). Peak memory consumption was 210.7MB. Max. memory is 16.1GB. [2024-06-27 17:26:03,812 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:26:03,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.44ms. Allocated memory is still 213.9MB. Free memory was 142.0MB in the beginning and 178.2MB in the end (delta: -36.2MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-06-27 17:26:03,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.18ms. Allocated memory is still 213.9MB. Free memory was 178.2MB in the beginning and 175.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:03,812 INFO L158 Benchmark]: Boogie Preprocessor took 74.45ms. Allocated memory is still 213.9MB. Free memory was 175.3MB in the beginning and 171.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:26:03,813 INFO L158 Benchmark]: RCFGBuilder took 655.46ms. Allocated memory is still 213.9MB. Free memory was 171.9MB in the beginning and 124.9MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:03,813 INFO L158 Benchmark]: TraceAbstraction took 8911.48ms. Allocated memory was 213.9MB in the beginning and 641.7MB in the end (delta: 427.8MB). Free memory was 123.6MB in the beginning and 372.4MB in the end (delta: -248.8MB). Peak memory consumption was 177.7MB. Max. memory is 16.1GB. [2024-06-27 17:26:03,813 INFO L158 Benchmark]: Witness Printer took 78.79ms. Allocated memory is still 641.7MB. Free memory was 372.4MB in the beginning and 359.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:26:03,815 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.44ms. Allocated memory is still 213.9MB. Free memory was 142.0MB in the beginning and 178.2MB in the end (delta: -36.2MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.18ms. Allocated memory is still 213.9MB. Free memory was 178.2MB in the beginning and 175.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.45ms. Allocated memory is still 213.9MB. Free memory was 175.3MB in the beginning and 171.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 655.46ms. Allocated memory is still 213.9MB. Free memory was 171.9MB in the beginning and 124.9MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8911.48ms. Allocated memory was 213.9MB in the beginning and 641.7MB in the end (delta: 427.8MB). Free memory was 123.6MB in the beginning and 372.4MB in the end (delta: -248.8MB). Peak memory consumption was 177.7MB. Max. memory is 16.1GB. * Witness Printer took 78.79ms. Allocated memory is still 641.7MB. Free memory was 372.4MB in the beginning and 359.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-1, t516=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 620 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 204 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1852 IncrementalHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 39 mSDtfsCounter, 1852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=10, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 17:26:03,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE