./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:19:39,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:19:39,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:19:39,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:19:39,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:19:39,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:19:39,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:19:39,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:19:39,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:19:39,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:19:39,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:19:39,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:19:39,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:19:39,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:19:39,709 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:19:39,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:19:39,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:19:39,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:19:39,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:19:39,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:19:39,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:19:39,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:19:39,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:19:39,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:19:39,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:19:39,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:19:39,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:19:39,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:19:39,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:19:39,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:19:39,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:19:39,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:19:39,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:19:39,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:19:39,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:19:39,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:19:39,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:19:39,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:19:39,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:19:39,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:19:39,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:19:39,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:19:39,721 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-10-24 12:19:40,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:19:40,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:19:40,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:19:40,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:19:40,030 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:19:40,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-24 12:19:41,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:19:41,802 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:19:41,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-24 12:19:41,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3b702bd/e3865fca3d9e4423ba4ffb0212c3a481/FLAG9e5fd0a0d [2024-10-24 12:19:42,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3b702bd/e3865fca3d9e4423ba4ffb0212c3a481 [2024-10-24 12:19:42,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:19:42,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:19:42,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:19:42,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:19:42,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:19:42,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee41a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42, skipping insertion in model container [2024-10-24 12:19:42,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:19:42,392 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-10-24 12:19:42,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:19:42,676 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:19:42,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-10-24 12:19:42,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:19:42,792 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:19:42,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42 WrapperNode [2024-10-24 12:19:42,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:19:42,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:19:42,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:19:42,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:19:42,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,872 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-10-24 12:19:42,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:19:42,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:19:42,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:19:42,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:19:42,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,932 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 12:19:42,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:19:42,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:19:42,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:19:42,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:19:42,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (1/1) ... [2024-10-24 12:19:42,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:19:42,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:19:43,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:19:43,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:19:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 12:19:43,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:19:43,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-24 12:19:43,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-24 12:19:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-24 12:19:43,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-24 12:19:43,110 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-24 12:19:43,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-24 12:19:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:19:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 12:19:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:19:43,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:19:43,114 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:19:43,288 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:19:43,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:19:43,718 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:19:43,719 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:19:43,979 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:19:43,980 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 12:19:43,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:43 BoogieIcfgContainer [2024-10-24 12:19:43,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:19:43,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:19:43,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:19:43,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:19:43,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:19:42" (1/3) ... [2024-10-24 12:19:43,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8aed9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:19:43, skipping insertion in model container [2024-10-24 12:19:43,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:42" (2/3) ... [2024-10-24 12:19:43,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8aed9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:19:43, skipping insertion in model container [2024-10-24 12:19:43,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:43" (3/3) ... [2024-10-24 12:19:43,994 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-10-24 12:19:44,011 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:19:44,013 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 12:19:44,013 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:19:44,074 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 12:19:44,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-10-24 12:19:44,147 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-10-24 12:19:44,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:19:44,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-10-24 12:19:44,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-10-24 12:19:44,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-10-24 12:19:44,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:19:44,183 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f3243a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:19:44,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 12:19:44,192 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:19:44,193 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-24 12:19:44,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 12:19:44,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:44,194 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:44,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:44,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash -515892989, now seen corresponding path program 1 times [2024-10-24 12:19:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806314591] [2024-10-24 12:19:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:44,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:44,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806314591] [2024-10-24 12:19:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806314591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:44,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:44,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 12:19:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257145708] [2024-10-24 12:19:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:44,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:19:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:44,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:19:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:19:44,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-10-24 12:19:44,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:44,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:44,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-10-24 12:19:44,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:45,473 INFO L124 PetriNetUnfolderBase]: 920/1670 cut-off events. [2024-10-24 12:19:45,474 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-24 12:19:45,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1670 events. 920/1670 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10861 event pairs, 188 based on Foata normal form. 60/1699 useless extension candidates. Maximal degree in co-relation 3079. Up to 1048 conditions per place. [2024-10-24 12:19:45,492 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-10-24 12:19:45,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 171 flow [2024-10-24 12:19:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:19:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:19:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-10-24 12:19:45,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2024-10-24 12:19:45,508 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 90 transitions. [2024-10-24 12:19:45,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 171 flow [2024-10-24 12:19:45,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 12:19:45,515 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-10-24 12:19:45,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-10-24 12:19:45,523 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-10-24 12:19:45,523 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-10-24 12:19:45,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:45,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:45,524 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:45,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:19:45,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:45,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash 718352395, now seen corresponding path program 1 times [2024-10-24 12:19:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:45,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658666338] [2024-10-24 12:19:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658666338] [2024-10-24 12:19:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658666338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:46,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:46,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:19:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601078087] [2024-10-24 12:19:46,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:46,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:19:46,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:46,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:19:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:19:46,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-24 12:19:46,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 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-10-24 12:19:46,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:46,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-24 12:19:46,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:47,773 INFO L124 PetriNetUnfolderBase]: 2805/4495 cut-off events. [2024-10-24 12:19:47,773 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-10-24 12:19:47,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8857 conditions, 4495 events. 2805/4495 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29288 event pairs, 834 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 8847. Up to 2284 conditions per place. [2024-10-24 12:19:47,799 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 39 selfloop transitions, 11 changer transitions 80/141 dead transitions. [2024-10-24 12:19:47,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 141 transitions, 568 flow [2024-10-24 12:19:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:19:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 12:19:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 301 transitions. [2024-10-24 12:19:47,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6117886178861789 [2024-10-24 12:19:47,805 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 12 states and 301 transitions. [2024-10-24 12:19:47,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 141 transitions, 568 flow [2024-10-24 12:19:47,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 141 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:19:47,809 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 186 flow [2024-10-24 12:19:47,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=186, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-10-24 12:19:47,811 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2024-10-24 12:19:47,811 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 186 flow [2024-10-24 12:19:47,811 INFO L472 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-10-24 12:19:47,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:47,812 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:47,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:19:47,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:47,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash -33432628, now seen corresponding path program 1 times [2024-10-24 12:19:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000626401] [2024-10-24 12:19:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:48,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:48,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000626401] [2024-10-24 12:19:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000626401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:48,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:48,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:19:48,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783098947] [2024-10-24 12:19:48,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:48,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:19:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:19:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:19:48,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-24 12:19:48,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:48,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:48,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-24 12:19:48,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:49,456 INFO L124 PetriNetUnfolderBase]: 1908/3086 cut-off events. [2024-10-24 12:19:49,456 INFO L125 PetriNetUnfolderBase]: For 6045/6045 co-relation queries the response was YES. [2024-10-24 12:19:49,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11043 conditions, 3086 events. 1908/3086 cut-off events. For 6045/6045 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19260 event pairs, 395 based on Foata normal form. 105/3174 useless extension candidates. Maximal degree in co-relation 11024. Up to 1458 conditions per place. [2024-10-24 12:19:49,486 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 46 selfloop transitions, 10 changer transitions 58/125 dead transitions. [2024-10-24 12:19:49,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 125 transitions, 830 flow [2024-10-24 12:19:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:19:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:19:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2024-10-24 12:19:49,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5829268292682926 [2024-10-24 12:19:49,489 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 186 flow. Second operand 10 states and 239 transitions. [2024-10-24 12:19:49,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 125 transitions, 830 flow [2024-10-24 12:19:49,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 125 transitions, 760 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-10-24 12:19:49,526 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 277 flow [2024-10-24 12:19:49,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2024-10-24 12:19:49,528 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2024-10-24 12:19:49,528 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 277 flow [2024-10-24 12:19:49,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:49,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:49,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:49,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:19:49,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:49,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1041094976, now seen corresponding path program 1 times [2024-10-24 12:19:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718250195] [2024-10-24 12:19:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718250195] [2024-10-24 12:19:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718250195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:19:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10818447] [2024-10-24 12:19:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:19:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:19:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:19:50,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:19:50,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:50,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:50,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:19:50,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:51,126 INFO L124 PetriNetUnfolderBase]: 1561/2667 cut-off events. [2024-10-24 12:19:51,126 INFO L125 PetriNetUnfolderBase]: For 6406/6478 co-relation queries the response was YES. [2024-10-24 12:19:51,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2667 events. 1561/2667 cut-off events. For 6406/6478 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16869 event pairs, 181 based on Foata normal form. 115/2755 useless extension candidates. Maximal degree in co-relation 9605. Up to 1644 conditions per place. [2024-10-24 12:19:51,158 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 48 selfloop transitions, 8 changer transitions 31/105 dead transitions. [2024-10-24 12:19:51,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 757 flow [2024-10-24 12:19:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:19:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 12:19:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-10-24 12:19:51,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2024-10-24 12:19:51,161 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 277 flow. Second operand 8 states and 194 transitions. [2024-10-24 12:19:51,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 757 flow [2024-10-24 12:19:51,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 717 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-10-24 12:19:51,185 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 346 flow [2024-10-24 12:19:51,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-10-24 12:19:51,187 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2024-10-24 12:19:51,187 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 346 flow [2024-10-24 12:19:51,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:51,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:51,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:51,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:19:51,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:51,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 547590798, now seen corresponding path program 2 times [2024-10-24 12:19:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:51,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69170285] [2024-10-24 12:19:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:52,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69170285] [2024-10-24 12:19:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69170285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:19:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145787826] [2024-10-24 12:19:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:52,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:19:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:19:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:19:52,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:19:52,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 346 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:52,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:52,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:19:52,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:53,582 INFO L124 PetriNetUnfolderBase]: 2084/3498 cut-off events. [2024-10-24 12:19:53,582 INFO L125 PetriNetUnfolderBase]: For 9735/9874 co-relation queries the response was YES. [2024-10-24 12:19:53,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14359 conditions, 3498 events. 2084/3498 cut-off events. For 9735/9874 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22584 event pairs, 202 based on Foata normal form. 217/3683 useless extension candidates. Maximal degree in co-relation 14329. Up to 1819 conditions per place. [2024-10-24 12:19:53,638 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 39 changer transitions 42/169 dead transitions. [2024-10-24 12:19:53,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 169 transitions, 1430 flow [2024-10-24 12:19:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 12:19:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-24 12:19:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 320 transitions. [2024-10-24 12:19:53,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5574912891986062 [2024-10-24 12:19:53,640 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 346 flow. Second operand 14 states and 320 transitions. [2024-10-24 12:19:53,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 169 transitions, 1430 flow [2024-10-24 12:19:53,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 169 transitions, 1366 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-10-24 12:19:53,682 INFO L231 Difference]: Finished difference. Result has 77 places, 96 transitions, 822 flow [2024-10-24 12:19:53,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=822, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2024-10-24 12:19:53,683 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2024-10-24 12:19:53,684 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 822 flow [2024-10-24 12:19:53,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:53,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:53,684 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:53,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:19:53,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:53,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 279130414, now seen corresponding path program 1 times [2024-10-24 12:19:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821176392] [2024-10-24 12:19:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821176392] [2024-10-24 12:19:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821176392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:54,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:54,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:19:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151545186] [2024-10-24 12:19:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:54,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:19:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:19:54,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:19:54,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-24 12:19:54,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:54,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:54,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-24 12:19:54,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:55,088 INFO L124 PetriNetUnfolderBase]: 3106/5292 cut-off events. [2024-10-24 12:19:55,088 INFO L125 PetriNetUnfolderBase]: For 16919/16940 co-relation queries the response was YES. [2024-10-24 12:19:55,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22455 conditions, 5292 events. 3106/5292 cut-off events. For 16919/16940 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 37513 event pairs, 831 based on Foata normal form. 82/5320 useless extension candidates. Maximal degree in co-relation 22425. Up to 2116 conditions per place. [2024-10-24 12:19:55,140 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 75 selfloop transitions, 7 changer transitions 86/181 dead transitions. [2024-10-24 12:19:55,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 181 transitions, 1911 flow [2024-10-24 12:19:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:19:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 12:19:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-10-24 12:19:55,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578397212543554 [2024-10-24 12:19:55,142 INFO L175 Difference]: Start difference. First operand has 77 places, 96 transitions, 822 flow. Second operand 7 states and 166 transitions. [2024-10-24 12:19:55,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 181 transitions, 1911 flow [2024-10-24 12:19:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 181 transitions, 1623 flow, removed 144 selfloop flow, removed 1 redundant places. [2024-10-24 12:19:55,180 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 584 flow [2024-10-24 12:19:55,181 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2024-10-24 12:19:55,182 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-10-24 12:19:55,182 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 584 flow [2024-10-24 12:19:55,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:55,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:55,182 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:55,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:19:55,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:55,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash -629371760, now seen corresponding path program 1 times [2024-10-24 12:19:55,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:55,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906425560] [2024-10-24 12:19:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906425560] [2024-10-24 12:19:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906425560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:56,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:19:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674324964] [2024-10-24 12:19:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:19:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:56,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:19:56,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:19:56,026 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:19:56,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 584 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:56,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:56,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:19:56,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:57,256 INFO L124 PetriNetUnfolderBase]: 2664/4609 cut-off events. [2024-10-24 12:19:57,257 INFO L125 PetriNetUnfolderBase]: For 18509/18715 co-relation queries the response was YES. [2024-10-24 12:19:57,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20139 conditions, 4609 events. 2664/4609 cut-off events. For 18509/18715 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 32231 event pairs, 478 based on Foata normal form. 192/4724 useless extension candidates. Maximal degree in co-relation 20104. Up to 2410 conditions per place. [2024-10-24 12:19:57,300 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 51 selfloop transitions, 26 changer transitions 40/135 dead transitions. [2024-10-24 12:19:57,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 135 transitions, 1292 flow [2024-10-24 12:19:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:19:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-24 12:19:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-10-24 12:19:57,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5582655826558266 [2024-10-24 12:19:57,303 INFO L175 Difference]: Start difference. First operand has 85 places, 75 transitions, 584 flow. Second operand 9 states and 206 transitions. [2024-10-24 12:19:57,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 135 transitions, 1292 flow [2024-10-24 12:19:57,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 1263 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-10-24 12:19:57,364 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 778 flow [2024-10-24 12:19:57,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=778, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-10-24 12:19:57,365 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2024-10-24 12:19:57,365 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 778 flow [2024-10-24 12:19:57,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:57,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:57,366 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:57,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:19:57,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:57,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1633970883, now seen corresponding path program 1 times [2024-10-24 12:19:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261372890] [2024-10-24 12:19:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261372890] [2024-10-24 12:19:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261372890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:19:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440559831] [2024-10-24 12:19:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:57,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:19:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:57,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:19:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:19:57,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-24 12:19:57,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:57,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:57,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-24 12:19:57,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:19:58,929 INFO L124 PetriNetUnfolderBase]: 4950/7671 cut-off events. [2024-10-24 12:19:58,929 INFO L125 PetriNetUnfolderBase]: For 69370/70214 co-relation queries the response was YES. [2024-10-24 12:19:58,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38320 conditions, 7671 events. 4950/7671 cut-off events. For 69370/70214 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 48872 event pairs, 507 based on Foata normal form. 894/8407 useless extension candidates. Maximal degree in co-relation 38285. Up to 3740 conditions per place. [2024-10-24 12:19:58,989 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 115 selfloop transitions, 5 changer transitions 33/172 dead transitions. [2024-10-24 12:19:58,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 172 transitions, 2154 flow [2024-10-24 12:19:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:19:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:19:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-24 12:19:58,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2024-10-24 12:19:58,991 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 778 flow. Second operand 4 states and 109 transitions. [2024-10-24 12:19:58,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 172 transitions, 2154 flow [2024-10-24 12:19:59,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 172 transitions, 2000 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-10-24 12:19:59,092 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 744 flow [2024-10-24 12:19:59,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=744, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-10-24 12:19:59,094 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-10-24 12:19:59,097 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 744 flow [2024-10-24 12:19:59,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:59,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:19:59,098 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:19:59,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:19:59,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:19:59,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:19:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash 759580609, now seen corresponding path program 1 times [2024-10-24 12:19:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:19:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664965323] [2024-10-24 12:19:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:19:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:19:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:19:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:19:59,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:19:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664965323] [2024-10-24 12:19:59,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664965323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:19:59,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:19:59,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:19:59,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641984709] [2024-10-24 12:19:59,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:19:59,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:19:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:19:59,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:19:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:19:59,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-24 12:19:59,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 744 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:19:59,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:19:59,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-24 12:19:59,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:00,249 INFO L124 PetriNetUnfolderBase]: 3690/5835 cut-off events. [2024-10-24 12:20:00,250 INFO L125 PetriNetUnfolderBase]: For 39402/40043 co-relation queries the response was YES. [2024-10-24 12:20:00,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27754 conditions, 5835 events. 3690/5835 cut-off events. For 39402/40043 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 35997 event pairs, 345 based on Foata normal form. 722/6431 useless extension candidates. Maximal degree in co-relation 27721. Up to 2286 conditions per place. [2024-10-24 12:20:00,289 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 108 selfloop transitions, 8 changer transitions 26/161 dead transitions. [2024-10-24 12:20:00,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 161 transitions, 1819 flow [2024-10-24 12:20:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:20:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:20:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-10-24 12:20:00,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6780487804878049 [2024-10-24 12:20:00,291 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 744 flow. Second operand 5 states and 139 transitions. [2024-10-24 12:20:00,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 161 transitions, 1819 flow [2024-10-24 12:20:00,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 161 transitions, 1796 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-10-24 12:20:00,329 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 729 flow [2024-10-24 12:20:00,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=729, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2024-10-24 12:20:00,330 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2024-10-24 12:20:00,331 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 729 flow [2024-10-24 12:20:00,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:00,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:00,331 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:00,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:20:00,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:00,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -397922807, now seen corresponding path program 1 times [2024-10-24 12:20:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:00,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131692602] [2024-10-24 12:20:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:00,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:00,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131692602] [2024-10-24 12:20:00,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131692602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:00,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:00,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:20:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119464071] [2024-10-24 12:20:00,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:00,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:20:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:20:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:20:00,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-24 12:20:00,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 729 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:00,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:00,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-24 12:20:00,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:01,816 INFO L124 PetriNetUnfolderBase]: 3108/4905 cut-off events. [2024-10-24 12:20:01,816 INFO L125 PetriNetUnfolderBase]: For 37582/38070 co-relation queries the response was YES. [2024-10-24 12:20:01,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24738 conditions, 4905 events. 3108/4905 cut-off events. For 37582/38070 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30086 event pairs, 342 based on Foata normal form. 509/5315 useless extension candidates. Maximal degree in co-relation 24703. Up to 2045 conditions per place. [2024-10-24 12:20:01,849 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 85 selfloop transitions, 11 changer transitions 33/147 dead transitions. [2024-10-24 12:20:01,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 147 transitions, 1594 flow [2024-10-24 12:20:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:20:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 12:20:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-24 12:20:01,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2024-10-24 12:20:01,851 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 729 flow. Second operand 6 states and 149 transitions. [2024-10-24 12:20:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 147 transitions, 1594 flow [2024-10-24 12:20:01,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 1541 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-10-24 12:20:01,896 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 692 flow [2024-10-24 12:20:01,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-10-24 12:20:01,897 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2024-10-24 12:20:01,897 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 692 flow [2024-10-24 12:20:01,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:01,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:01,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:01,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:20:01,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:01,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1582005147, now seen corresponding path program 1 times [2024-10-24 12:20:01,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:01,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265971452] [2024-10-24 12:20:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:01,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265971452] [2024-10-24 12:20:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265971452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:03,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:03,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:20:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811788441] [2024-10-24 12:20:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:03,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:20:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:20:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:20:03,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:03,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 692 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:03,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:03,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:03,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:03,732 INFO L124 PetriNetUnfolderBase]: 1811/3435 cut-off events. [2024-10-24 12:20:03,733 INFO L125 PetriNetUnfolderBase]: For 15006/15325 co-relation queries the response was YES. [2024-10-24 12:20:03,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14474 conditions, 3435 events. 1811/3435 cut-off events. For 15006/15325 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 25119 event pairs, 533 based on Foata normal form. 125/3136 useless extension candidates. Maximal degree in co-relation 14438. Up to 1543 conditions per place. [2024-10-24 12:20:03,757 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 24 changer transitions 16/128 dead transitions. [2024-10-24 12:20:03,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 1236 flow [2024-10-24 12:20:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:20:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 12:20:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions. [2024-10-24 12:20:03,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5188470066518847 [2024-10-24 12:20:03,759 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 692 flow. Second operand 11 states and 234 transitions. [2024-10-24 12:20:03,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 1236 flow [2024-10-24 12:20:03,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 1132 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-10-24 12:20:03,813 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 840 flow [2024-10-24 12:20:03,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=840, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2024-10-24 12:20:03,814 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2024-10-24 12:20:03,815 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 840 flow [2024-10-24 12:20:03,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:03,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:03,816 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:03,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:20:03,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 534882887, now seen corresponding path program 2 times [2024-10-24 12:20:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806537902] [2024-10-24 12:20:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806537902] [2024-10-24 12:20:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806537902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:04,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:04,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:20:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421270989] [2024-10-24 12:20:04,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:04,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:20:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:04,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:20:04,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:20:04,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:04,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 840 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:04,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:04,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:04,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:05,702 INFO L124 PetriNetUnfolderBase]: 2279/4429 cut-off events. [2024-10-24 12:20:05,702 INFO L125 PetriNetUnfolderBase]: For 10192/10489 co-relation queries the response was YES. [2024-10-24 12:20:05,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16087 conditions, 4429 events. 2279/4429 cut-off events. For 10192/10489 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 34810 event pairs, 469 based on Foata normal form. 117/4080 useless extension candidates. Maximal degree in co-relation 16051. Up to 1783 conditions per place. [2024-10-24 12:20:05,734 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 51 selfloop transitions, 26 changer transitions 33/136 dead transitions. [2024-10-24 12:20:05,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 1318 flow [2024-10-24 12:20:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-10-24 12:20:05,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2024-10-24 12:20:05,736 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 840 flow. Second operand 10 states and 226 transitions. [2024-10-24 12:20:05,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 1318 flow [2024-10-24 12:20:05,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 1279 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-10-24 12:20:05,755 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 917 flow [2024-10-24 12:20:05,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=917, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2024-10-24 12:20:05,758 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2024-10-24 12:20:05,758 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 917 flow [2024-10-24 12:20:05,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:05,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:05,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:05,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:20:05,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:05,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 165588499, now seen corresponding path program 3 times [2024-10-24 12:20:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662550871] [2024-10-24 12:20:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:08,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662550871] [2024-10-24 12:20:08,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662550871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:08,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:08,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:08,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949378221] [2024-10-24 12:20:08,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:08,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:08,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 917 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:08,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:08,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:08,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:09,089 INFO L124 PetriNetUnfolderBase]: 1937/3779 cut-off events. [2024-10-24 12:20:09,089 INFO L125 PetriNetUnfolderBase]: For 13270/13564 co-relation queries the response was YES. [2024-10-24 12:20:09,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15267 conditions, 3779 events. 1937/3779 cut-off events. For 13270/13564 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 28480 event pairs, 311 based on Foata normal form. 134/3552 useless extension candidates. Maximal degree in co-relation 15228. Up to 1394 conditions per place. [2024-10-24 12:20:09,122 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 55 changer transitions 23/166 dead transitions. [2024-10-24 12:20:09,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 166 transitions, 1805 flow [2024-10-24 12:20:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 12:20:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-24 12:20:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 297 transitions. [2024-10-24 12:20:09,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5174216027874564 [2024-10-24 12:20:09,125 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 917 flow. Second operand 14 states and 297 transitions. [2024-10-24 12:20:09,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 166 transitions, 1805 flow [2024-10-24 12:20:09,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 1641 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-10-24 12:20:09,167 INFO L231 Difference]: Finished difference. Result has 100 places, 116 transitions, 1232 flow [2024-10-24 12:20:09,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1232, PETRI_PLACES=100, PETRI_TRANSITIONS=116} [2024-10-24 12:20:09,168 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2024-10-24 12:20:09,168 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 116 transitions, 1232 flow [2024-10-24 12:20:09,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:09,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:09,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:09,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:20:09,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:09,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1770314009, now seen corresponding path program 4 times [2024-10-24 12:20:09,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056078060] [2024-10-24 12:20:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:10,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056078060] [2024-10-24 12:20:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056078060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:10,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:10,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:20:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697639677] [2024-10-24 12:20:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:10,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:20:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:20:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:20:10,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:10,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 116 transitions, 1232 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:10,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:10,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:10,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:11,241 INFO L124 PetriNetUnfolderBase]: 1818/3647 cut-off events. [2024-10-24 12:20:11,241 INFO L125 PetriNetUnfolderBase]: For 12205/12450 co-relation queries the response was YES. [2024-10-24 12:20:11,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 3647 events. 1818/3647 cut-off events. For 12205/12450 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 27855 event pairs, 318 based on Foata normal form. 114/3421 useless extension candidates. Maximal degree in co-relation 14416. Up to 1903 conditions per place. [2024-10-24 12:20:11,265 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 65 selfloop transitions, 28 changer transitions 22/141 dead transitions. [2024-10-24 12:20:11,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 141 transitions, 1595 flow [2024-10-24 12:20:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:20:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 12:20:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-10-24 12:20:11,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5213414634146342 [2024-10-24 12:20:11,267 INFO L175 Difference]: Start difference. First operand has 100 places, 116 transitions, 1232 flow. Second operand 8 states and 171 transitions. [2024-10-24 12:20:11,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 141 transitions, 1595 flow [2024-10-24 12:20:11,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 141 transitions, 1486 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-10-24 12:20:11,295 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 1161 flow [2024-10-24 12:20:11,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1161, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2024-10-24 12:20:11,296 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2024-10-24 12:20:11,297 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 1161 flow [2024-10-24 12:20:11,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:11,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:11,297 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:11,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 12:20:11,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:11,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash -611692111, now seen corresponding path program 5 times [2024-10-24 12:20:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471566784] [2024-10-24 12:20:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471566784] [2024-10-24 12:20:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471566784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:12,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:12,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127169504] [2024-10-24 12:20:12,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:12,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:12,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:12,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:12,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:12,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:12,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 1161 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:12,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:12,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:12,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:13,161 INFO L124 PetriNetUnfolderBase]: 2209/4406 cut-off events. [2024-10-24 12:20:13,162 INFO L125 PetriNetUnfolderBase]: For 15429/15677 co-relation queries the response was YES. [2024-10-24 12:20:13,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16941 conditions, 4406 events. 2209/4406 cut-off events. For 15429/15677 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 35308 event pairs, 746 based on Foata normal form. 140/4042 useless extension candidates. Maximal degree in co-relation 16905. Up to 2272 conditions per place. [2024-10-24 12:20:13,191 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 71 selfloop transitions, 25 changer transitions 26/148 dead transitions. [2024-10-24 12:20:13,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 148 transitions, 1649 flow [2024-10-24 12:20:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-10-24 12:20:13,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-10-24 12:20:13,193 INFO L175 Difference]: Start difference. First operand has 99 places, 111 transitions, 1161 flow. Second operand 10 states and 214 transitions. [2024-10-24 12:20:13,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 148 transitions, 1649 flow [2024-10-24 12:20:13,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 148 transitions, 1613 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-10-24 12:20:13,219 INFO L231 Difference]: Finished difference. Result has 102 places, 113 transitions, 1236 flow [2024-10-24 12:20:13,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1236, PETRI_PLACES=102, PETRI_TRANSITIONS=113} [2024-10-24 12:20:13,219 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places. [2024-10-24 12:20:13,220 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 113 transitions, 1236 flow [2024-10-24 12:20:13,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:13,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:13,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:13,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 12:20:13,220 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash -967362017, now seen corresponding path program 6 times [2024-10-24 12:20:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808650911] [2024-10-24 12:20:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:14,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808650911] [2024-10-24 12:20:14,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808650911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:14,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:14,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:20:14,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142794412] [2024-10-24 12:20:14,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:14,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:20:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:14,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:20:14,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:20:14,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:14,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 113 transitions, 1236 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:14,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:14,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:14,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:15,033 INFO L124 PetriNetUnfolderBase]: 2152/4254 cut-off events. [2024-10-24 12:20:15,034 INFO L125 PetriNetUnfolderBase]: For 14268/14505 co-relation queries the response was YES. [2024-10-24 12:20:15,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16214 conditions, 4254 events. 2152/4254 cut-off events. For 14268/14505 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 33851 event pairs, 656 based on Foata normal form. 119/3878 useless extension candidates. Maximal degree in co-relation 16176. Up to 2000 conditions per place. [2024-10-24 12:20:15,067 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 65 selfloop transitions, 36 changer transitions 16/143 dead transitions. [2024-10-24 12:20:15,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1626 flow [2024-10-24 12:20:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-10-24 12:20:15,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-10-24 12:20:15,068 INFO L175 Difference]: Start difference. First operand has 102 places, 113 transitions, 1236 flow. Second operand 10 states and 214 transitions. [2024-10-24 12:20:15,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1626 flow [2024-10-24 12:20:15,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 143 transitions, 1591 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-10-24 12:20:15,090 INFO L231 Difference]: Finished difference. Result has 105 places, 116 transitions, 1363 flow [2024-10-24 12:20:15,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1363, PETRI_PLACES=105, PETRI_TRANSITIONS=116} [2024-10-24 12:20:15,090 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-10-24 12:20:15,091 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 116 transitions, 1363 flow [2024-10-24 12:20:15,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:15,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:15,091 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:15,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 12:20:15,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:15,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1923076375, now seen corresponding path program 7 times [2024-10-24 12:20:15,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:15,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264966715] [2024-10-24 12:20:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264966715] [2024-10-24 12:20:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264966715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:20:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895750142] [2024-10-24 12:20:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:16,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:20:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:16,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:20:16,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:20:16,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:16,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 116 transitions, 1363 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:16,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:16,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:16,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:17,588 INFO L124 PetriNetUnfolderBase]: 2166/4339 cut-off events. [2024-10-24 12:20:17,588 INFO L125 PetriNetUnfolderBase]: For 17719/17977 co-relation queries the response was YES. [2024-10-24 12:20:17,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 4339 events. 2166/4339 cut-off events. For 17719/17977 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 34742 event pairs, 604 based on Foata normal form. 122/4005 useless extension candidates. Maximal degree in co-relation 17214. Up to 2022 conditions per place. [2024-10-24 12:20:17,608 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 66 selfloop transitions, 41 changer transitions 14/147 dead transitions. [2024-10-24 12:20:17,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 147 transitions, 1761 flow [2024-10-24 12:20:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:20:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 12:20:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions. [2024-10-24 12:20:17,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5144124168514412 [2024-10-24 12:20:17,610 INFO L175 Difference]: Start difference. First operand has 105 places, 116 transitions, 1363 flow. Second operand 11 states and 232 transitions. [2024-10-24 12:20:17,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 147 transitions, 1761 flow [2024-10-24 12:20:17,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 147 transitions, 1703 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-10-24 12:20:17,631 INFO L231 Difference]: Finished difference. Result has 110 places, 120 transitions, 1513 flow [2024-10-24 12:20:17,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1513, PETRI_PLACES=110, PETRI_TRANSITIONS=120} [2024-10-24 12:20:17,631 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 63 predicate places. [2024-10-24 12:20:17,632 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 120 transitions, 1513 flow [2024-10-24 12:20:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:17,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:17,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 12:20:17,632 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:17,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash -863727337, now seen corresponding path program 8 times [2024-10-24 12:20:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:17,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545490255] [2024-10-24 12:20:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545490255] [2024-10-24 12:20:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545490255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:20:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366476500] [2024-10-24 12:20:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:18,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:20:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:20:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:20:18,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:18,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 120 transitions, 1513 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:18,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:18,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:18,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:19,046 INFO L124 PetriNetUnfolderBase]: 2142/4400 cut-off events. [2024-10-24 12:20:19,046 INFO L125 PetriNetUnfolderBase]: For 22350/22566 co-relation queries the response was YES. [2024-10-24 12:20:19,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17967 conditions, 4400 events. 2142/4400 cut-off events. For 22350/22566 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 35978 event pairs, 785 based on Foata normal form. 101/4071 useless extension candidates. Maximal degree in co-relation 17926. Up to 2471 conditions per place. [2024-10-24 12:20:19,135 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 21 changer transitions 31/147 dead transitions. [2024-10-24 12:20:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 147 transitions, 1880 flow [2024-10-24 12:20:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2024-10-24 12:20:19,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5097560975609756 [2024-10-24 12:20:19,137 INFO L175 Difference]: Start difference. First operand has 110 places, 120 transitions, 1513 flow. Second operand 10 states and 209 transitions. [2024-10-24 12:20:19,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 147 transitions, 1880 flow [2024-10-24 12:20:19,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 1827 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-10-24 12:20:19,160 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 1427 flow [2024-10-24 12:20:19,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1427, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2024-10-24 12:20:19,160 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 68 predicate places. [2024-10-24 12:20:19,160 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 1427 flow [2024-10-24 12:20:19,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:19,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:19,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:19,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 12:20:19,161 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 987910765, now seen corresponding path program 9 times [2024-10-24 12:20:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801787879] [2024-10-24 12:20:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801787879] [2024-10-24 12:20:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801787879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:20:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414037235] [2024-10-24 12:20:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:20,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:20:20,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:20,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:20:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:20:20,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:20,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 1427 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:20,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:20,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:20,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:20,917 INFO L124 PetriNetUnfolderBase]: 2249/4505 cut-off events. [2024-10-24 12:20:20,917 INFO L125 PetriNetUnfolderBase]: For 22763/23088 co-relation queries the response was YES. [2024-10-24 12:20:20,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18386 conditions, 4505 events. 2249/4505 cut-off events. For 22763/23088 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 36852 event pairs, 576 based on Foata normal form. 156/4155 useless extension candidates. Maximal degree in co-relation 18342. Up to 2198 conditions per place. [2024-10-24 12:20:20,943 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 70 selfloop transitions, 27 changer transitions 22/145 dead transitions. [2024-10-24 12:20:20,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 145 transitions, 1860 flow [2024-10-24 12:20:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-10-24 12:20:20,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5292682926829269 [2024-10-24 12:20:20,945 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 1427 flow. Second operand 10 states and 217 transitions. [2024-10-24 12:20:20,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 145 transitions, 1860 flow [2024-10-24 12:20:20,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 1719 flow, removed 28 selfloop flow, removed 12 redundant places. [2024-10-24 12:20:20,986 INFO L231 Difference]: Finished difference. Result has 109 places, 108 transitions, 1349 flow [2024-10-24 12:20:20,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1349, PETRI_PLACES=109, PETRI_TRANSITIONS=108} [2024-10-24 12:20:20,986 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 62 predicate places. [2024-10-24 12:20:20,987 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 1349 flow [2024-10-24 12:20:20,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:20,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:20,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:20,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 12:20:20,988 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:20,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash -924664551, now seen corresponding path program 10 times [2024-10-24 12:20:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:20,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808388419] [2024-10-24 12:20:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:21,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:21,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808388419] [2024-10-24 12:20:21,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808388419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:21,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:21,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:21,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844812396] [2024-10-24 12:20:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:21,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:21,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:21,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:21,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:21,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 1349 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:21,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:21,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:21,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:22,637 INFO L124 PetriNetUnfolderBase]: 1974/4015 cut-off events. [2024-10-24 12:20:22,637 INFO L125 PetriNetUnfolderBase]: For 18376/18641 co-relation queries the response was YES. [2024-10-24 12:20:22,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15744 conditions, 4015 events. 1974/4015 cut-off events. For 18376/18641 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 32156 event pairs, 628 based on Foata normal form. 122/3686 useless extension candidates. Maximal degree in co-relation 15703. Up to 2166 conditions per place. [2024-10-24 12:20:22,658 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 68 selfloop transitions, 24 changer transitions 20/138 dead transitions. [2024-10-24 12:20:22,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 138 transitions, 1681 flow [2024-10-24 12:20:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:20:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 12:20:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 248 transitions. [2024-10-24 12:20:22,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-10-24 12:20:22,660 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 1349 flow. Second operand 12 states and 248 transitions. [2024-10-24 12:20:22,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 138 transitions, 1681 flow [2024-10-24 12:20:22,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 138 transitions, 1607 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-10-24 12:20:22,691 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 1275 flow [2024-10-24 12:20:22,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1275, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-10-24 12:20:22,692 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 65 predicate places. [2024-10-24 12:20:22,692 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 1275 flow [2024-10-24 12:20:22,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:22,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:22,693 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:22,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 12:20:22,693 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:22,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash 260393961, now seen corresponding path program 11 times [2024-10-24 12:20:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:22,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516527221] [2024-10-24 12:20:22,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:22,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:23,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516527221] [2024-10-24 12:20:23,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516527221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:23,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:23,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:20:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394541386] [2024-10-24 12:20:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:20:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:23,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:20:23,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:20:23,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:23,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 1275 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:23,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:23,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:23,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:24,975 INFO L124 PetriNetUnfolderBase]: 2245/4559 cut-off events. [2024-10-24 12:20:24,975 INFO L125 PetriNetUnfolderBase]: For 21141/21452 co-relation queries the response was YES. [2024-10-24 12:20:25,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17315 conditions, 4559 events. 2245/4559 cut-off events. For 21141/21452 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 37591 event pairs, 420 based on Foata normal form. 137/4225 useless extension candidates. Maximal degree in co-relation 17275. Up to 1952 conditions per place. [2024-10-24 12:20:25,013 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 65 selfloop transitions, 41 changer transitions 21/153 dead transitions. [2024-10-24 12:20:25,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 153 transitions, 1793 flow [2024-10-24 12:20:25,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 12:20:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-24 12:20:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 296 transitions. [2024-10-24 12:20:25,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5156794425087108 [2024-10-24 12:20:25,015 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 1275 flow. Second operand 14 states and 296 transitions. [2024-10-24 12:20:25,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 153 transitions, 1793 flow [2024-10-24 12:20:25,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 153 transitions, 1704 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-10-24 12:20:25,053 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 1418 flow [2024-10-24 12:20:25,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1418, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2024-10-24 12:20:25,054 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 68 predicate places. [2024-10-24 12:20:25,054 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 1418 flow [2024-10-24 12:20:25,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:25,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:25,055 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:25,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 12:20:25,055 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:25,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash -439317001, now seen corresponding path program 12 times [2024-10-24 12:20:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:25,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65749132] [2024-10-24 12:20:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65749132] [2024-10-24 12:20:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65749132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:25,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:20:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370042521] [2024-10-24 12:20:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:25,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:20:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:25,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:20:25,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:20:25,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:25,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 1418 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:25,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:25,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:25,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:26,528 INFO L124 PetriNetUnfolderBase]: 2100/4326 cut-off events. [2024-10-24 12:20:26,528 INFO L125 PetriNetUnfolderBase]: For 20978/21266 co-relation queries the response was YES. [2024-10-24 12:20:26,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17228 conditions, 4326 events. 2100/4326 cut-off events. For 20978/21266 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 35526 event pairs, 262 based on Foata normal form. 124/4086 useless extension candidates. Maximal degree in co-relation 17187. Up to 1595 conditions per place. [2024-10-24 12:20:26,553 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 62 selfloop transitions, 25 changer transitions 24/137 dead transitions. [2024-10-24 12:20:26,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 137 transitions, 1778 flow [2024-10-24 12:20:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:20:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 12:20:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-10-24 12:20:26,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2024-10-24 12:20:26,554 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 1418 flow. Second operand 8 states and 176 transitions. [2024-10-24 12:20:26,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 137 transitions, 1778 flow [2024-10-24 12:20:26,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 137 transitions, 1673 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-10-24 12:20:26,594 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 1311 flow [2024-10-24 12:20:26,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1311, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2024-10-24 12:20:26,595 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2024-10-24 12:20:26,595 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 1311 flow [2024-10-24 12:20:26,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:26,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:26,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 12:20:26,596 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:26,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash -191134633, now seen corresponding path program 13 times [2024-10-24 12:20:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831715745] [2024-10-24 12:20:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:27,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:27,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831715745] [2024-10-24 12:20:27,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831715745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:27,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:27,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:20:27,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688386263] [2024-10-24 12:20:27,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:27,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:20:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:27,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:20:27,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:20:27,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:27,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 1311 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:27,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:27,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:27,785 INFO L124 PetriNetUnfolderBase]: 1919/3979 cut-off events. [2024-10-24 12:20:27,785 INFO L125 PetriNetUnfolderBase]: For 19133/19400 co-relation queries the response was YES. [2024-10-24 12:20:27,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15792 conditions, 3979 events. 1919/3979 cut-off events. For 19133/19400 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 32369 event pairs, 372 based on Foata normal form. 117/3743 useless extension candidates. Maximal degree in co-relation 15750. Up to 1303 conditions per place. [2024-10-24 12:20:27,823 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 41 selfloop transitions, 27 changer transitions 36/130 dead transitions. [2024-10-24 12:20:27,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 130 transitions, 1641 flow [2024-10-24 12:20:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:20:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-24 12:20:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-10-24 12:20:27,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2024-10-24 12:20:27,825 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 1311 flow. Second operand 9 states and 192 transitions. [2024-10-24 12:20:27,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 130 transitions, 1641 flow [2024-10-24 12:20:27,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 130 transitions, 1497 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-10-24 12:20:27,857 INFO L231 Difference]: Finished difference. Result has 114 places, 84 transitions, 951 flow [2024-10-24 12:20:27,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=114, PETRI_TRANSITIONS=84} [2024-10-24 12:20:27,858 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2024-10-24 12:20:27,858 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 84 transitions, 951 flow [2024-10-24 12:20:27,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:27,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:27,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:27,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 12:20:27,858 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:27,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -858683681, now seen corresponding path program 14 times [2024-10-24 12:20:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233892342] [2024-10-24 12:20:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:28,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:28,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233892342] [2024-10-24 12:20:28,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233892342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:28,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:28,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:20:28,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458143823] [2024-10-24 12:20:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:28,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:20:28,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:20:28,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:20:28,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-10-24 12:20:28,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 84 transitions, 951 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 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-10-24 12:20:28,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:28,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-10-24 12:20:28,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:28,956 INFO L124 PetriNetUnfolderBase]: 1921/3831 cut-off events. [2024-10-24 12:20:28,957 INFO L125 PetriNetUnfolderBase]: For 13863/14076 co-relation queries the response was YES. [2024-10-24 12:20:28,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14373 conditions, 3831 events. 1921/3831 cut-off events. For 13863/14076 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 30684 event pairs, 785 based on Foata normal form. 61/3417 useless extension candidates. Maximal degree in co-relation 14332. Up to 1908 conditions per place. [2024-10-24 12:20:28,986 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 47 selfloop transitions, 20 changer transitions 44/129 dead transitions. [2024-10-24 12:20:28,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 129 transitions, 1439 flow [2024-10-24 12:20:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-10-24 12:20:28,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-10-24 12:20:28,988 INFO L175 Difference]: Start difference. First operand has 114 places, 84 transitions, 951 flow. Second operand 10 states and 205 transitions. [2024-10-24 12:20:28,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 129 transitions, 1439 flow [2024-10-24 12:20:29,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 1275 flow, removed 18 selfloop flow, removed 14 redundant places. [2024-10-24 12:20:29,016 INFO L231 Difference]: Finished difference. Result has 106 places, 79 transitions, 785 flow [2024-10-24 12:20:29,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=785, PETRI_PLACES=106, PETRI_TRANSITIONS=79} [2024-10-24 12:20:29,017 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2024-10-24 12:20:29,017 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 79 transitions, 785 flow [2024-10-24 12:20:29,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 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-10-24 12:20:29,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:29,017 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:29,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 12:20:29,017 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1528524445, now seen corresponding path program 15 times [2024-10-24 12:20:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210444403] [2024-10-24 12:20:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:30,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210444403] [2024-10-24 12:20:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210444403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:30,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115690335] [2024-10-24 12:20:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:30,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:30,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:30,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:30,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:30,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 79 transitions, 785 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:30,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:30,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:30,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:31,205 INFO L124 PetriNetUnfolderBase]: 839/1690 cut-off events. [2024-10-24 12:20:31,205 INFO L125 PetriNetUnfolderBase]: For 4365/4489 co-relation queries the response was YES. [2024-10-24 12:20:31,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 1690 events. 839/1690 cut-off events. For 4365/4489 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11194 event pairs, 298 based on Foata normal form. 37/1527 useless extension candidates. Maximal degree in co-relation 5933. Up to 626 conditions per place. [2024-10-24 12:20:31,214 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 50 selfloop transitions, 14 changer transitions 15/106 dead transitions. [2024-10-24 12:20:31,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 1039 flow [2024-10-24 12:20:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:20:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 12:20:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2024-10-24 12:20:31,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5055432372505543 [2024-10-24 12:20:31,216 INFO L175 Difference]: Start difference. First operand has 106 places, 79 transitions, 785 flow. Second operand 11 states and 228 transitions. [2024-10-24 12:20:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 1039 flow [2024-10-24 12:20:31,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 933 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-10-24 12:20:31,224 INFO L231 Difference]: Finished difference. Result has 105 places, 75 transitions, 675 flow [2024-10-24 12:20:31,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=675, PETRI_PLACES=105, PETRI_TRANSITIONS=75} [2024-10-24 12:20:31,225 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-10-24 12:20:31,225 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 75 transitions, 675 flow [2024-10-24 12:20:31,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:31,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:31,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 12:20:31,225 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:31,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1411096493, now seen corresponding path program 16 times [2024-10-24 12:20:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:31,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383010961] [2024-10-24 12:20:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:32,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383010961] [2024-10-24 12:20:32,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383010961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:32,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:32,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:32,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361984429] [2024-10-24 12:20:32,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:32,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:32,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:32,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:32,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 75 transitions, 675 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:32,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:32,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:32,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:32,824 INFO L124 PetriNetUnfolderBase]: 676/1367 cut-off events. [2024-10-24 12:20:32,824 INFO L125 PetriNetUnfolderBase]: For 2831/2929 co-relation queries the response was YES. [2024-10-24 12:20:32,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1367 events. 676/1367 cut-off events. For 2831/2929 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 8601 event pairs, 97 based on Foata normal form. 32/1273 useless extension candidates. Maximal degree in co-relation 4715. Up to 603 conditions per place. [2024-10-24 12:20:32,833 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 37 selfloop transitions, 14 changer transitions 34/106 dead transitions. [2024-10-24 12:20:32,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 923 flow [2024-10-24 12:20:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:20:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 12:20:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 261 transitions. [2024-10-24 12:20:32,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4896810506566604 [2024-10-24 12:20:32,834 INFO L175 Difference]: Start difference. First operand has 105 places, 75 transitions, 675 flow. Second operand 13 states and 261 transitions. [2024-10-24 12:20:32,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 106 transitions, 923 flow [2024-10-24 12:20:32,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 833 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-10-24 12:20:32,842 INFO L231 Difference]: Finished difference. Result has 105 places, 57 transitions, 422 flow [2024-10-24 12:20:32,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=422, PETRI_PLACES=105, PETRI_TRANSITIONS=57} [2024-10-24 12:20:32,842 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-10-24 12:20:32,842 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 57 transitions, 422 flow [2024-10-24 12:20:32,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:32,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:32,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:32,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 12:20:32,843 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash -870970933, now seen corresponding path program 17 times [2024-10-24 12:20:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574769071] [2024-10-24 12:20:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574769071] [2024-10-24 12:20:33,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574769071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:33,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:33,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181783557] [2024-10-24 12:20:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:33,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:33,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:33,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 57 transitions, 422 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:33,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:33,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:33,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:33,990 INFO L124 PetriNetUnfolderBase]: 555/1093 cut-off events. [2024-10-24 12:20:33,990 INFO L125 PetriNetUnfolderBase]: For 1611/1740 co-relation queries the response was YES. [2024-10-24 12:20:33,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1093 events. 555/1093 cut-off events. For 1611/1740 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6459 event pairs, 233 based on Foata normal form. 30/1002 useless extension candidates. Maximal degree in co-relation 3428. Up to 477 conditions per place. [2024-10-24 12:20:33,997 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 27 selfloop transitions, 8 changer transitions 25/80 dead transitions. [2024-10-24 12:20:33,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 80 transitions, 602 flow [2024-10-24 12:20:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-10-24 12:20:33,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4951219512195122 [2024-10-24 12:20:33,998 INFO L175 Difference]: Start difference. First operand has 105 places, 57 transitions, 422 flow. Second operand 10 states and 203 transitions. [2024-10-24 12:20:33,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 80 transitions, 602 flow [2024-10-24 12:20:34,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 483 flow, removed 16 selfloop flow, removed 22 redundant places. [2024-10-24 12:20:34,006 INFO L231 Difference]: Finished difference. Result has 85 places, 50 transitions, 270 flow [2024-10-24 12:20:34,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=85, PETRI_TRANSITIONS=50} [2024-10-24 12:20:34,007 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-10-24 12:20:34,007 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 50 transitions, 270 flow [2024-10-24 12:20:34,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:34,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:34,008 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:34,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 12:20:34,008 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:34,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1325008493, now seen corresponding path program 18 times [2024-10-24 12:20:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:34,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871058712] [2024-10-24 12:20:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871058712] [2024-10-24 12:20:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871058712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:35,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:35,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:20:35,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897235348] [2024-10-24 12:20:35,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:35,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 12:20:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 12:20:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:20:35,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:35,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 50 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:35,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:35,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:35,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:36,191 INFO L124 PetriNetUnfolderBase]: 502/1001 cut-off events. [2024-10-24 12:20:36,191 INFO L125 PetriNetUnfolderBase]: For 690/816 co-relation queries the response was YES. [2024-10-24 12:20:36,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1001 events. 502/1001 cut-off events. For 690/816 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5787 event pairs, 106 based on Foata normal form. 27/935 useless extension candidates. Maximal degree in co-relation 2756. Up to 406 conditions per place. [2024-10-24 12:20:36,197 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 27 selfloop transitions, 8 changer transitions 19/74 dead transitions. [2024-10-24 12:20:36,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 74 transitions, 454 flow [2024-10-24 12:20:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:20:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-24 12:20:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-10-24 12:20:36,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-10-24 12:20:36,199 INFO L175 Difference]: Start difference. First operand has 85 places, 50 transitions, 270 flow. Second operand 9 states and 186 transitions. [2024-10-24 12:20:36,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 74 transitions, 454 flow [2024-10-24 12:20:36,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 403 flow, removed 7 selfloop flow, removed 14 redundant places. [2024-10-24 12:20:36,201 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 226 flow [2024-10-24 12:20:36,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2024-10-24 12:20:36,202 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-10-24 12:20:36,202 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 226 flow [2024-10-24 12:20:36,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:36,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:36,202 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:36,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 12:20:36,202 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash -685457811, now seen corresponding path program 19 times [2024-10-24 12:20:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:36,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078802431] [2024-10-24 12:20:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:36,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:37,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:37,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078802431] [2024-10-24 12:20:37,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078802431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:37,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:37,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82010932] [2024-10-24 12:20:37,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:37,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:37,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:37,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:37,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 226 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:37,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:37,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:37,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:37,433 INFO L124 PetriNetUnfolderBase]: 451/918 cut-off events. [2024-10-24 12:20:37,434 INFO L125 PetriNetUnfolderBase]: For 477/561 co-relation queries the response was YES. [2024-10-24 12:20:37,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 918 events. 451/918 cut-off events. For 477/561 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5295 event pairs, 85 based on Foata normal form. 23/862 useless extension candidates. Maximal degree in co-relation 2369. Up to 383 conditions per place. [2024-10-24 12:20:37,438 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 25 selfloop transitions, 4 changer transitions 24/73 dead transitions. [2024-10-24 12:20:37,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 402 flow [2024-10-24 12:20:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:20:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 12:20:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-10-24 12:20:37,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4902439024390244 [2024-10-24 12:20:37,439 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 226 flow. Second operand 10 states and 201 transitions. [2024-10-24 12:20:37,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 402 flow [2024-10-24 12:20:37,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 73 transitions, 378 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-10-24 12:20:37,443 INFO L231 Difference]: Finished difference. Result has 76 places, 45 transitions, 211 flow [2024-10-24 12:20:37,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=211, PETRI_PLACES=76, PETRI_TRANSITIONS=45} [2024-10-24 12:20:37,443 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-10-24 12:20:37,444 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 45 transitions, 211 flow [2024-10-24 12:20:37,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:37,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:37,444 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:37,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 12:20:37,444 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:37,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash 130558385, now seen corresponding path program 20 times [2024-10-24 12:20:37,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:37,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309057373] [2024-10-24 12:20:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:37,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:20:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:20:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:20:38,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309057373] [2024-10-24 12:20:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309057373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:20:38,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:20:38,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:20:38,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033282841] [2024-10-24 12:20:38,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:20:38,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:20:38,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:20:38,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:20:38,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:20:38,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-24 12:20:38,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 45 transitions, 211 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:38,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:20:38,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-24 12:20:38,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:20:38,990 INFO L124 PetriNetUnfolderBase]: 373/780 cut-off events. [2024-10-24 12:20:38,991 INFO L125 PetriNetUnfolderBase]: For 447/507 co-relation queries the response was YES. [2024-10-24 12:20:38,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 780 events. 373/780 cut-off events. For 447/507 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4286 event pairs, 71 based on Foata normal form. 19/741 useless extension candidates. Maximal degree in co-relation 2009. Up to 290 conditions per place. [2024-10-24 12:20:38,995 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 26 selfloop transitions, 6 changer transitions 20/72 dead transitions. [2024-10-24 12:20:38,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 389 flow [2024-10-24 12:20:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:20:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 12:20:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-10-24 12:20:38,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4789356984478936 [2024-10-24 12:20:38,997 INFO L175 Difference]: Start difference. First operand has 76 places, 45 transitions, 211 flow. Second operand 11 states and 216 transitions. [2024-10-24 12:20:38,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 389 flow [2024-10-24 12:20:38,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 367 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-10-24 12:20:39,000 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 205 flow [2024-10-24 12:20:39,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=205, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2024-10-24 12:20:39,002 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2024-10-24 12:20:39,002 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 205 flow [2024-10-24 12:20:39,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:20:39,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:20:39,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:39,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 12:20:39,003 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 12:20:39,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:20:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1150557169, now seen corresponding path program 21 times [2024-10-24 12:20:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:20:39,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419190233] [2024-10-24 12:20:39,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:20:39,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:20:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:20:39,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 12:20:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 12:20:39,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 12:20:39,234 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 12:20:39,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-24 12:20:39,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-24 12:20:39,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-24 12:20:39,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-24 12:20:39,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-24 12:20:39,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-24 12:20:39,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 12:20:39,242 INFO L407 BasicCegarLoop]: Path program histogram: [21, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:20:39,345 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 12:20:39,347 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 12:20:39,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:20:39 BasicIcfg [2024-10-24 12:20:39,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 12:20:39,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 12:20:39,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 12:20:39,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 12:20:39,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:43" (3/4) ... [2024-10-24 12:20:39,355 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 12:20:39,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 12:20:39,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 12:20:39,463 INFO L158 Benchmark]: Toolchain (without parser) took 57343.12ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 110.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 260.8MB. Max. memory is 16.1GB. [2024-10-24 12:20:39,463 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 12:20:39,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.27ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 81.2MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 12:20:39,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.24ms. Allocated memory is still 167.8MB. Free memory was 81.2MB in the beginning and 78.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 12:20:39,464 INFO L158 Benchmark]: Boogie Preprocessor took 102.25ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 73.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 12:20:39,464 INFO L158 Benchmark]: RCFGBuilder took 1004.54ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 73.5MB in the beginning and 136.5MB in the end (delta: -63.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-10-24 12:20:39,464 INFO L158 Benchmark]: TraceAbstraction took 55367.39ms. Allocated memory was 234.9MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 135.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 202.9MB. Max. memory is 16.1GB. [2024-10-24 12:20:39,464 INFO L158 Benchmark]: Witness Printer took 109.25ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 12:20:39,466 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.18ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.27ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 81.2MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.24ms. Allocated memory is still 167.8MB. Free memory was 81.2MB in the beginning and 78.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.25ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 73.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1004.54ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 73.5MB in the beginning and 136.5MB in the end (delta: -63.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 55367.39ms. Allocated memory was 234.9MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 135.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 202.9MB. Max. memory is 16.1GB. * Witness Printer took 109.25ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, 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] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-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] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$r_buff0_thd3=1, 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] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=0, x$r_buff0_thd3=1, 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] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$r_buff0_thd3=1, 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=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, 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=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, 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=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, 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=2] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, 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=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L798] 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) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2] - UnprovableResult [Line: 19]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: 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, 68 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: 55.1s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1795 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1746 mSDsluCounter, 886 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6621 IncrementalHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 85 mSDtfsCounter, 6621 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1513occurred in iteration=17, InterpolantAutomatonStates: 289, 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.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 9426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 12:20:39,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE