/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 20:44:13,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 20:44:13,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 20:44:13,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 20:44:13,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 20:44:13,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 20:44:13,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 20:44:13,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 20:44:13,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 20:44:13,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 20:44:13,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 20:44:13,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 20:44:13,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 20:44:13,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 20:44:13,426 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 20:44:13,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 20:44:13,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 20:44:13,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 20:44:13,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 20:44:13,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 20:44:13,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 20:44:13,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 20:44:13,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 20:44:13,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 20:44:13,429 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 20:44:13,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 20:44:13,429 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 20:44:13,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 20:44:13,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 20:44:13,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 20:44:13,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:44:13,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 20:44:13,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 20:44:13,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 20:44:13,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 20:44:13,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 20:44:13,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 20:44:13,432 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 20:44:13,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 20:44:13,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 20:44:13,432 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 20:44:13,433 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.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 20:44:13,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 20:44:13,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 20:44:13,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 20:44:13,645 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 20:44:13,645 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 20:44:13,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c [2023-08-03 20:44:14,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 20:44:15,020 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 20:44:15,021 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c [2023-08-03 20:44:15,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef231b58/17b3582dc6bc4ce5a85746c1769aac5d/FLAGe242b19cf [2023-08-03 20:44:15,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef231b58/17b3582dc6bc4ce5a85746c1769aac5d [2023-08-03 20:44:15,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 20:44:15,050 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 20:44:15,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 20:44:15,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 20:44:15,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 20:44:15,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a80133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15, skipping insertion in model container [2023-08-03 20:44:15,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,082 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 20:44:15,213 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c[2309,2322] [2023-08-03 20:44:15,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:44:15,221 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 20:44:15,239 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c[2309,2322] [2023-08-03 20:44:15,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 20:44:15,246 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:44:15,246 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 20:44:15,252 INFO L206 MainTranslator]: Completed translation [2023-08-03 20:44:15,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15 WrapperNode [2023-08-03 20:44:15,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 20:44:15,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 20:44:15,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 20:44:15,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 20:44:15,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,291 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-08-03 20:44:15,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 20:44:15,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 20:44:15,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 20:44:15,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 20:44:15,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 20:44:15,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 20:44:15,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 20:44:15,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 20:44:15,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (1/1) ... [2023-08-03 20:44:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 20:44:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:15,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 20:44:15,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 20:44:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 20:44:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 20:44:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 20:44:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 20:44:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 20:44:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 20:44:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 20:44:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 20:44:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 20:44:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 20:44:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 20:44:15,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 20:44:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 20:44:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 20:44:15,388 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 20:44:15,462 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 20:44:15,464 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 20:44:15,710 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 20:44:15,736 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 20:44:15,736 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-03 20:44:15,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:44:15 BoogieIcfgContainer [2023-08-03 20:44:15,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 20:44:15,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 20:44:15,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 20:44:15,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 20:44:15,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 08:44:15" (1/3) ... [2023-08-03 20:44:15,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2453f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:44:15, skipping insertion in model container [2023-08-03 20:44:15,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 08:44:15" (2/3) ... [2023-08-03 20:44:15,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2453f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 08:44:15, skipping insertion in model container [2023-08-03 20:44:15,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 08:44:15" (3/3) ... [2023-08-03 20:44:15,745 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c [2023-08-03 20:44:15,752 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 20:44:15,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 20:44:15,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 20:44:15,759 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 20:44:15,806 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 20:44:15,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 109 transitions, 240 flow [2023-08-03 20:44:15,904 INFO L124 PetriNetUnfolderBase]: 33/246 cut-off events. [2023-08-03 20:44:15,904 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 20:44:15,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 246 events. 33/246 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 795 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-03 20:44:15,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 109 transitions, 240 flow [2023-08-03 20:44:15,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 109 transitions, 240 flow [2023-08-03 20:44:15,919 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:44:15,930 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 109 transitions, 240 flow [2023-08-03 20:44:15,932 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 109 transitions, 240 flow [2023-08-03 20:44:15,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 109 transitions, 240 flow [2023-08-03 20:44:16,009 INFO L124 PetriNetUnfolderBase]: 33/246 cut-off events. [2023-08-03 20:44:16,009 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 20:44:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 246 events. 33/246 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 795 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-03 20:44:16,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 2052 [2023-08-03 20:44:18,121 INFO L134 LiptonReduction]: Checked pairs total: 2605 [2023-08-03 20:44:18,122 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-03 20:44:18,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:44:18,158 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5cfecc14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:44:18,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 20:44:18,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:44:18,162 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 20:44:18,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 20:44:18,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:18,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 20:44:18,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:18,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash 412810011, now seen corresponding path program 1 times [2023-08-03 20:44:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291479618] [2023-08-03 20:44:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:44:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291479618] [2023-08-03 20:44:18,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291479618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:18,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:44:18,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 20:44:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852276856] [2023-08-03 20:44:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:18,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:44:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:18,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:44:18,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:44:18,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-08-03 20:44:18,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) [2023-08-03 20:44:18,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:18,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-08-03 20:44:18,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:18,522 INFO L124 PetriNetUnfolderBase]: 260/419 cut-off events. [2023-08-03 20:44:18,522 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 20:44:18,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 419 events. 260/419 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1585 event pairs, 119 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 692. Up to 390 conditions per place. [2023-08-03 20:44:18,527 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 24 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-03 20:44:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 138 flow [2023-08-03 20:44:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:44:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:44:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-08-03 20:44:18,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4892205638474295 [2023-08-03 20:44:18,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-08-03 20:44:18,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-08-03 20:44:18,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:18,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-08-03 20:44:18,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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) [2023-08-03 20:44:18,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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) [2023-08-03 20:44:18,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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) [2023-08-03 20:44:18,554 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 82 flow. Second operand 3 states and 295 transitions. [2023-08-03 20:44:18,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 138 flow [2023-08-03 20:44:18,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:44:18,559 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 88 flow [2023-08-03 20:44:18,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2023-08-03 20:44:18,564 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-03 20:44:18,564 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 88 flow [2023-08-03 20:44:18,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) [2023-08-03 20:44:18,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:18,565 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 20:44:18,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 20:44:18,566 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:18,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -58774126, now seen corresponding path program 1 times [2023-08-03 20:44:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063486206] [2023-08-03 20:44:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:44:18,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 20:44:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 20:44:18,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 20:44:18,615 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 20:44:18,616 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 20:44:18,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 20:44:18,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 20:44:18,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 20:44:18,619 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 20:44:18,621 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 20:44:18,621 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 20:44:18,641 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 20:44:18,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 132 transitions, 312 flow [2023-08-03 20:44:18,723 INFO L124 PetriNetUnfolderBase]: 134/809 cut-off events. [2023-08-03 20:44:18,724 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 20:44:18,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 809 events. 134/809 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4044 event pairs, 2 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-03 20:44:18,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 132 transitions, 312 flow [2023-08-03 20:44:18,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 132 transitions, 312 flow [2023-08-03 20:44:18,733 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 20:44:18,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 132 transitions, 312 flow [2023-08-03 20:44:18,733 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 132 transitions, 312 flow [2023-08-03 20:44:18,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 132 transitions, 312 flow [2023-08-03 20:44:18,809 INFO L124 PetriNetUnfolderBase]: 134/809 cut-off events. [2023-08-03 20:44:18,810 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 20:44:18,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 809 events. 134/809 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4044 event pairs, 2 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-03 20:44:18,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 5028 [2023-08-03 20:44:20,955 INFO L134 LiptonReduction]: Checked pairs total: 7595 [2023-08-03 20:44:20,955 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-03 20:44:20,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 20:44:20,958 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5cfecc14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 20:44:20,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 20:44:20,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 20:44:20,960 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 20:44:20,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 20:44:20,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:20,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 20:44:20,961 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:20,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash 655917539, now seen corresponding path program 1 times [2023-08-03 20:44:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:20,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849162445] [2023-08-03 20:44:20,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:44:21,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:21,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849162445] [2023-08-03 20:44:21,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849162445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:21,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:44:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 20:44:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310653326] [2023-08-03 20:44:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:21,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:44:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:44:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 20:44:21,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 236 [2023-08-03 20:44:21,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2023-08-03 20:44:21,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:21,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 236 [2023-08-03 20:44:21,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:21,794 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-03 20:44:21,794 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-03 20:44:21,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47431 event pairs, 3472 based on Foata normal form. 0/6248 useless extension candidates. Maximal degree in co-relation 6836. Up to 10600 conditions per place. [2023-08-03 20:44:21,875 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-03 20:44:21,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-03 20:44:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:44:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:44:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-03 20:44:21,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915254237288136 [2023-08-03 20:44:21,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-03 20:44:21,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-03 20:44:21,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:21,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-03 20:44:21,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-08-03 20:44:21,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:21,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:21,883 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 348 transitions. [2023-08-03 20:44:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-03 20:44:21,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 20:44:21,887 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 146 flow [2023-08-03 20:44:21,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-03 20:44:21,887 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-03 20:44:21,888 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 146 flow [2023-08-03 20:44:21,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2023-08-03 20:44:21,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:21,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:21,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 20:44:21,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:21,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1269672682, now seen corresponding path program 1 times [2023-08-03 20:44:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214976852] [2023-08-03 20:44:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:44:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214976852] [2023-08-03 20:44:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214976852] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648649177] [2023-08-03 20:44:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:21,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:21,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:21,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:21,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 20:44:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:22,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:44:22,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:44:22,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:44:22,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648649177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:22,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:44:22,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 20:44:22,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994838996] [2023-08-03 20:44:22,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:22,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:44:22,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:22,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:44:22,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:44:22,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 236 [2023-08-03 20:44:22,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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) [2023-08-03 20:44:22,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:22,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 236 [2023-08-03 20:44:22,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:22,912 INFO L124 PetriNetUnfolderBase]: 8488/11053 cut-off events. [2023-08-03 20:44:22,912 INFO L125 PetriNetUnfolderBase]: For 895/895 co-relation queries the response was YES. [2023-08-03 20:44:22,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22377 conditions, 11053 events. 8488/11053 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49962 event pairs, 3438 based on Foata normal form. 0/6301 useless extension candidates. Maximal degree in co-relation 13501. Up to 10389 conditions per place. [2023-08-03 20:44:22,994 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 40 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-03 20:44:22,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 246 flow [2023-08-03 20:44:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:44:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:44:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-03 20:44:22,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957627118644068 [2023-08-03 20:44:22,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-03 20:44:22,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-03 20:44:22,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:22,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-03 20:44:22,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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) [2023-08-03 20:44:23,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:23,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:23,003 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 146 flow. Second operand 3 states and 351 transitions. [2023-08-03 20:44:23,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 246 flow [2023-08-03 20:44:23,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:44:23,006 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 156 flow [2023-08-03 20:44:23,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-03 20:44:23,007 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-03 20:44:23,007 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 156 flow [2023-08-03 20:44:23,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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) [2023-08-03 20:44:23,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:23,008 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 20:44:23,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 20:44:23,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:23,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:23,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1410418684, now seen corresponding path program 1 times [2023-08-03 20:44:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124419098] [2023-08-03 20:44:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:44:23,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124419098] [2023-08-03 20:44:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124419098] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628338535] [2023-08-03 20:44:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:23,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:23,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 20:44:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:23,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:44:23,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 20:44:23,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:44:23,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628338535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:23,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:44:23,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 20:44:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299961426] [2023-08-03 20:44:23,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:23,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:44:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:23,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:44:23,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:44:23,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-03 20:44:23,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 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) [2023-08-03 20:44:23,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:23,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-03 20:44:23,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:24,175 INFO L124 PetriNetUnfolderBase]: 8480/11030 cut-off events. [2023-08-03 20:44:24,175 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2023-08-03 20:44:24,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22615 conditions, 11030 events. 8480/11030 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 49206 event pairs, 2430 based on Foata normal form. 9/6435 useless extension candidates. Maximal degree in co-relation 6924. Up to 10511 conditions per place. [2023-08-03 20:44:24,236 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-03 20:44:24,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 257 flow [2023-08-03 20:44:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:44:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:44:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-03 20:44:24,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46864406779661016 [2023-08-03 20:44:24,238 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-03 20:44:24,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-03 20:44:24,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:24,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-03 20:44:24,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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) [2023-08-03 20:44:24,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-03 20:44:24,243 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-03 20:44:24,243 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 156 flow. Second operand 5 states and 553 transitions. [2023-08-03 20:44:24,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 257 flow [2023-08-03 20:44:24,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:44:24,249 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 165 flow [2023-08-03 20:44:24,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-03 20:44:24,251 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-03 20:44:24,251 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 165 flow [2023-08-03 20:44:24,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 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) [2023-08-03 20:44:24,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:24,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:24,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:24,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:24,456 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:24,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1970386421, now seen corresponding path program 1 times [2023-08-03 20:44:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083084529] [2023-08-03 20:44:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 20:44:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083084529] [2023-08-03 20:44:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083084529] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401932757] [2023-08-03 20:44:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:24,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:24,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:24,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:24,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 20:44:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:24,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:44:24,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 20:44:24,594 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:44:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401932757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:24,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:44:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 20:44:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060592651] [2023-08-03 20:44:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:24,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:44:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:44:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:44:24,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 236 [2023-08-03 20:44:24,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2023-08-03 20:44:24,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:24,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 236 [2023-08-03 20:44:24,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:25,209 INFO L124 PetriNetUnfolderBase]: 7233/9555 cut-off events. [2023-08-03 20:44:25,209 INFO L125 PetriNetUnfolderBase]: For 764/764 co-relation queries the response was YES. [2023-08-03 20:44:25,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19560 conditions, 9555 events. 7233/9555 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 43628 event pairs, 2468 based on Foata normal form. 0/5681 useless extension candidates. Maximal degree in co-relation 6706. Up to 6763 conditions per place. [2023-08-03 20:44:25,264 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 48 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 20:44:25,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 303 flow [2023-08-03 20:44:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:44:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:44:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-03 20:44:25,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042372881355932 [2023-08-03 20:44:25,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-03 20:44:25,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-03 20:44:25,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:25,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-03 20:44:25,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-08-03 20:44:25,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:25,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:25,270 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 165 flow. Second operand 3 states and 357 transitions. [2023-08-03 20:44:25,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 303 flow [2023-08-03 20:44:25,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 296 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:44:25,272 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 170 flow [2023-08-03 20:44:25,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-03 20:44:25,275 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-03 20:44:25,275 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 170 flow [2023-08-03 20:44:25,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2023-08-03 20:44:25,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:25,276 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:25,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:25,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:25,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:25,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1486425453, now seen corresponding path program 1 times [2023-08-03 20:44:25,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:25,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512239387] [2023-08-03 20:44:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:44:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:25,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512239387] [2023-08-03 20:44:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512239387] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:25,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214934136] [2023-08-03 20:44:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:25,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:25,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:25,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 20:44:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:25,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:44:25,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:44:25,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:44:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214934136] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:25,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 20:44:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597520610] [2023-08-03 20:44:25,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:25,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:44:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:44:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:44:25,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-03 20:44:25,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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) [2023-08-03 20:44:25,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:25,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-03 20:44:25,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:26,279 INFO L124 PetriNetUnfolderBase]: 6552/8619 cut-off events. [2023-08-03 20:44:26,280 INFO L125 PetriNetUnfolderBase]: For 1300/1300 co-relation queries the response was YES. [2023-08-03 20:44:26,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18203 conditions, 8619 events. 6552/8619 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 38285 event pairs, 1930 based on Foata normal form. 3/5259 useless extension candidates. Maximal degree in co-relation 5227. Up to 8209 conditions per place. [2023-08-03 20:44:26,337 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 40 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-08-03 20:44:26,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 264 flow [2023-08-03 20:44:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-08-03 20:44:26,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766949152542373 [2023-08-03 20:44:26,339 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-08-03 20:44:26,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-08-03 20:44:26,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:26,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-08-03 20:44:26,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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) [2023-08-03 20:44:26,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:26,343 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:26,343 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 170 flow. Second operand 4 states and 450 transitions. [2023-08-03 20:44:26,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 264 flow [2023-08-03 20:44:26,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:44:26,349 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 166 flow [2023-08-03 20:44:26,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-03 20:44:26,351 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-03 20:44:26,351 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 166 flow [2023-08-03 20:44:26,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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) [2023-08-03 20:44:26,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:26,351 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:26,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:26,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:26,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:26,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2145807451, now seen corresponding path program 1 times [2023-08-03 20:44:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:26,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728952217] [2023-08-03 20:44:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:44:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728952217] [2023-08-03 20:44:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728952217] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347770496] [2023-08-03 20:44:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:26,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:26,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:26,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:26,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 20:44:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:26,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 20:44:26,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 20:44:26,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:44:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347770496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:44:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 20:44:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750732689] [2023-08-03 20:44:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:26,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:44:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:44:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:44:26,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-03 20:44:26,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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) [2023-08-03 20:44:26,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:26,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-03 20:44:26,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:27,248 INFO L124 PetriNetUnfolderBase]: 6120/8058 cut-off events. [2023-08-03 20:44:27,248 INFO L125 PetriNetUnfolderBase]: For 926/926 co-relation queries the response was YES. [2023-08-03 20:44:27,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16949 conditions, 8058 events. 6120/8058 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 35777 event pairs, 400 based on Foata normal form. 81/4992 useless extension candidates. Maximal degree in co-relation 7285. Up to 6966 conditions per place. [2023-08-03 20:44:27,289 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 52 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-03 20:44:27,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 316 flow [2023-08-03 20:44:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 20:44:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 20:44:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2023-08-03 20:44:27,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788135593220339 [2023-08-03 20:44:27,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2023-08-03 20:44:27,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2023-08-03 20:44:27,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:27,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2023-08-03 20:44:27,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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) [2023-08-03 20:44:27,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-03 20:44:27,295 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-03 20:44:27,295 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 166 flow. Second operand 5 states and 565 transitions. [2023-08-03 20:44:27,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 316 flow [2023-08-03 20:44:27,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 304 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 20:44:27,301 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 171 flow [2023-08-03 20:44:27,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-03 20:44:27,301 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-03 20:44:27,302 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 171 flow [2023-08-03 20:44:27,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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) [2023-08-03 20:44:27,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:27,302 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:27,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-03 20:44:27,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:27,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:27,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1578082311, now seen corresponding path program 1 times [2023-08-03 20:44:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159807068] [2023-08-03 20:44:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 20:44:27,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:27,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159807068] [2023-08-03 20:44:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159807068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875692632] [2023-08-03 20:44:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:27,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:27,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:27,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:27,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 20:44:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:27,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 20:44:27,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:44:27,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 20:44:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875692632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:27,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 20:44:27,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 20:44:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006258265] [2023-08-03 20:44:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:27,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 20:44:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 20:44:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:44:27,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 236 [2023-08-03 20:44:27,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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) [2023-08-03 20:44:27,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:27,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 236 [2023-08-03 20:44:27,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:28,106 INFO L124 PetriNetUnfolderBase]: 5997/8008 cut-off events. [2023-08-03 20:44:28,106 INFO L125 PetriNetUnfolderBase]: For 1518/1518 co-relation queries the response was YES. [2023-08-03 20:44:28,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17005 conditions, 8008 events. 5997/8008 cut-off events. For 1518/1518 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 36538 event pairs, 2243 based on Foata normal form. 0/5017 useless extension candidates. Maximal degree in co-relation 7491. Up to 5805 conditions per place. [2023-08-03 20:44:28,143 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 20:44:28,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 309 flow [2023-08-03 20:44:28,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 20:44:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 20:44:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-03 20:44:28,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042372881355932 [2023-08-03 20:44:28,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-03 20:44:28,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-03 20:44:28,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:28,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-03 20:44:28,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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) [2023-08-03 20:44:28,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:28,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-03 20:44:28,148 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 171 flow. Second operand 3 states and 357 transitions. [2023-08-03 20:44:28,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 309 flow [2023-08-03 20:44:28,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 302 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:44:28,152 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 176 flow [2023-08-03 20:44:28,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-03 20:44:28,152 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-03 20:44:28,153 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 176 flow [2023-08-03 20:44:28,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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) [2023-08-03 20:44:28,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:28,153 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:28,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:28,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:28,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:28,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash -774819184, now seen corresponding path program 1 times [2023-08-03 20:44:28,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:28,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006626343] [2023-08-03 20:44:28,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:44:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006626343] [2023-08-03 20:44:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006626343] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066559026] [2023-08-03 20:44:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:28,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:28,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:28,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:28,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 20:44:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:28,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:44:28,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:44:28,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 20:44:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066559026] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:28,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:44:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262031060] [2023-08-03 20:44:28,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:28,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:44:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:44:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:44:28,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-03 20:44:28,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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) [2023-08-03 20:44:28,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:28,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-03 20:44:28,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:28,956 INFO L124 PetriNetUnfolderBase]: 5682/7585 cut-off events. [2023-08-03 20:44:28,956 INFO L125 PetriNetUnfolderBase]: For 1230/1230 co-relation queries the response was YES. [2023-08-03 20:44:28,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16360 conditions, 7585 events. 5682/7585 cut-off events. For 1230/1230 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34715 event pairs, 1645 based on Foata normal form. 27/4832 useless extension candidates. Maximal degree in co-relation 10425. Up to 6552 conditions per place. [2023-08-03 20:44:28,995 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 49 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-03 20:44:28,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 304 flow [2023-08-03 20:44:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2023-08-03 20:44:28,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851694915254237 [2023-08-03 20:44:28,997 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2023-08-03 20:44:28,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2023-08-03 20:44:28,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:28,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2023-08-03 20:44:28,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 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) [2023-08-03 20:44:29,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:29,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:29,001 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 176 flow. Second operand 4 states and 458 transitions. [2023-08-03 20:44:29,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 304 flow [2023-08-03 20:44:29,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 20:44:29,021 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 172 flow [2023-08-03 20:44:29,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-03 20:44:29,022 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-03 20:44:29,022 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 172 flow [2023-08-03 20:44:29,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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) [2023-08-03 20:44:29,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:29,022 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:29,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:29,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:29,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash -806097094, now seen corresponding path program 1 times [2023-08-03 20:44:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:29,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917417808] [2023-08-03 20:44:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:44:29,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917417808] [2023-08-03 20:44:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917417808] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467018425] [2023-08-03 20:44:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:29,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:29,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:29,288 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:29,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 20:44:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:29,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:44:29,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:44:29,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:44:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467018425] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:29,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 20:44:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315944654] [2023-08-03 20:44:29,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:29,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:44:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:29,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:44:29,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:44:29,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-03 20:44:29,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 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) [2023-08-03 20:44:29,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:29,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-03 20:44:29,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:29,757 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-03 20:44:29,757 INFO L125 PetriNetUnfolderBase]: For 1253/1253 co-relation queries the response was YES. [2023-08-03 20:44:29,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11920 conditions, 5529 events. 4136/5529 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22835 event pairs, 747 based on Foata normal form. 108/3585 useless extension candidates. Maximal degree in co-relation 10506. Up to 2080 conditions per place. [2023-08-03 20:44:29,780 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-03 20:44:29,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 342 flow [2023-08-03 20:44:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-03 20:44:29,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925847457627119 [2023-08-03 20:44:29,782 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-03 20:44:29,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-03 20:44:29,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:29,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-03 20:44:29,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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) [2023-08-03 20:44:29,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:29,785 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:29,785 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 172 flow. Second operand 4 states and 465 transitions. [2023-08-03 20:44:29,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 342 flow [2023-08-03 20:44:29,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 20:44:29,790 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 186 flow [2023-08-03 20:44:29,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-03 20:44:29,791 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-03 20:44:29,791 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 186 flow [2023-08-03 20:44:29,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 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) [2023-08-03 20:44:29,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:29,792 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:29,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:29,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 20:44:29,997 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:29,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1361252092, now seen corresponding path program 1 times [2023-08-03 20:44:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:29,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333343516] [2023-08-03 20:44:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:29,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:44:30,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:30,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333343516] [2023-08-03 20:44:30,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333343516] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:30,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834949272] [2023-08-03 20:44:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:30,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:30,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:30,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:30,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 20:44:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:30,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 20:44:30,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:44:30,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:44:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834949272] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:30,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:30,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 20:44:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686591543] [2023-08-03 20:44:30,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:30,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 20:44:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 20:44:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 20:44:30,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-03 20:44:30,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 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) [2023-08-03 20:44:30,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:30,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-03 20:44:30,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:30,579 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-03 20:44:30,579 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2023-08-03 20:44:30,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12568 conditions, 5502 events. 4120/5502 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22687 event pairs, 1861 based on Foata normal form. 13/3471 useless extension candidates. Maximal degree in co-relation 11152. Up to 4661 conditions per place. [2023-08-03 20:44:30,602 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-03 20:44:30,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 358 flow [2023-08-03 20:44:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-03 20:44:30,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925847457627119 [2023-08-03 20:44:30,604 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-03 20:44:30,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-03 20:44:30,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:30,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-03 20:44:30,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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) [2023-08-03 20:44:30,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:30,607 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:30,607 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 186 flow. Second operand 4 states and 465 transitions. [2023-08-03 20:44:30,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 358 flow [2023-08-03 20:44:30,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 20:44:30,619 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 190 flow [2023-08-03 20:44:30,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-03 20:44:30,620 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-03 20:44:30,620 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 190 flow [2023-08-03 20:44:30,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 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) [2023-08-03 20:44:30,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:30,621 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:30,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:30,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:30,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:30,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash -62313478, now seen corresponding path program 1 times [2023-08-03 20:44:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:30,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182967642] [2023-08-03 20:44:30,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:30,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 20:44:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:31,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182967642] [2023-08-03 20:44:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182967642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:31,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:44:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 20:44:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204318785] [2023-08-03 20:44:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:44:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:44:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 20:44:31,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 236 [2023-08-03 20:44:31,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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) [2023-08-03 20:44:31,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:31,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 236 [2023-08-03 20:44:31,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:31,495 INFO L124 PetriNetUnfolderBase]: 4584/6149 cut-off events. [2023-08-03 20:44:31,495 INFO L125 PetriNetUnfolderBase]: For 2270/2270 co-relation queries the response was YES. [2023-08-03 20:44:31,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14050 conditions, 6149 events. 4584/6149 cut-off events. For 2270/2270 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 26255 event pairs, 2000 based on Foata normal form. 0/4107 useless extension candidates. Maximal degree in co-relation 13859. Up to 4603 conditions per place. [2023-08-03 20:44:31,519 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 65 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-03 20:44:31,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 465 flow [2023-08-03 20:44:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-03 20:44:31,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809322033898305 [2023-08-03 20:44:31,521 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-03 20:44:31,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-03 20:44:31,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:31,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-03 20:44:31,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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) [2023-08-03 20:44:31,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:31,523 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:31,523 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 190 flow. Second operand 4 states and 454 transitions. [2023-08-03 20:44:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 465 flow [2023-08-03 20:44:31,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 452 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 20:44:31,541 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 196 flow [2023-08-03 20:44:31,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-08-03 20:44:31,542 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-08-03 20:44:31,542 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 196 flow [2023-08-03 20:44:31,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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) [2023-08-03 20:44:31,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:31,543 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:31,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 20:44:31,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:31,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash -206360618, now seen corresponding path program 1 times [2023-08-03 20:44:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659039681] [2023-08-03 20:44:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 20:44:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659039681] [2023-08-03 20:44:31,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659039681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 20:44:31,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 20:44:31,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 20:44:31,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951439164] [2023-08-03 20:44:31,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:31,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:44:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:44:31,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 20:44:31,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 236 [2023-08-03 20:44:31,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 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) [2023-08-03 20:44:31,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:31,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 236 [2023-08-03 20:44:31,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:32,126 INFO L124 PetriNetUnfolderBase]: 4328/5879 cut-off events. [2023-08-03 20:44:32,127 INFO L125 PetriNetUnfolderBase]: For 2466/2794 co-relation queries the response was YES. [2023-08-03 20:44:32,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14767 conditions, 5879 events. 4328/5879 cut-off events. For 2466/2794 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 25455 event pairs, 1538 based on Foata normal form. 328/4461 useless extension candidates. Maximal degree in co-relation 14574. Up to 4371 conditions per place. [2023-08-03 20:44:32,152 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 64 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-03 20:44:32,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 462 flow [2023-08-03 20:44:32,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-03 20:44:32,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788135593220339 [2023-08-03 20:44:32,154 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-03 20:44:32,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-03 20:44:32,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:32,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-03 20:44:32,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-08-03 20:44:32,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:32,157 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:32,157 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 196 flow. Second operand 4 states and 452 transitions. [2023-08-03 20:44:32,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 462 flow [2023-08-03 20:44:32,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 453 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:44:32,168 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 204 flow [2023-08-03 20:44:32,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-08-03 20:44:32,168 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-03 20:44:32,168 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 204 flow [2023-08-03 20:44:32,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 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) [2023-08-03 20:44:32,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:32,169 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:32,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 20:44:32,169 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:32,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -755235009, now seen corresponding path program 1 times [2023-08-03 20:44:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459742580] [2023-08-03 20:44:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:44:32,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459742580] [2023-08-03 20:44:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459742580] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406225872] [2023-08-03 20:44:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:32,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:32,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:32,335 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:32,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 20:44:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:32,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:44:32,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:44:32,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 20:44:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406225872] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:32,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:44:32,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-03 20:44:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961133195] [2023-08-03 20:44:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:32,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:44:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:44:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:44:32,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 236 [2023-08-03 20:44:32,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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) [2023-08-03 20:44:32,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:32,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 236 [2023-08-03 20:44:32,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:32,973 INFO L124 PetriNetUnfolderBase]: 4027/5532 cut-off events. [2023-08-03 20:44:32,973 INFO L125 PetriNetUnfolderBase]: For 2985/3634 co-relation queries the response was YES. [2023-08-03 20:44:32,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14738 conditions, 5532 events. 4027/5532 cut-off events. For 2985/3634 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 24323 event pairs, 1934 based on Foata normal form. 649/4737 useless extension candidates. Maximal degree in co-relation 14544. Up to 4167 conditions per place. [2023-08-03 20:44:33,007 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 63 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-03 20:44:33,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 451 flow [2023-08-03 20:44:33,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2023-08-03 20:44:33,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798728813559322 [2023-08-03 20:44:33,009 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2023-08-03 20:44:33,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2023-08-03 20:44:33,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:33,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2023-08-03 20:44:33,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 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) [2023-08-03 20:44:33,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:33,012 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:33,012 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 204 flow. Second operand 4 states and 453 transitions. [2023-08-03 20:44:33,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 451 flow [2023-08-03 20:44:33,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 442 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:44:33,024 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 212 flow [2023-08-03 20:44:33,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-03 20:44:33,024 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-03 20:44:33,024 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 212 flow [2023-08-03 20:44:33,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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) [2023-08-03 20:44:33,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:33,025 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:33,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:33,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-03 20:44:33,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:33,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:33,230 INFO L85 PathProgramCache]: Analyzing trace with hash -150295434, now seen corresponding path program 1 times [2023-08-03 20:44:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:33,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426208878] [2023-08-03 20:44:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:44:33,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:33,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426208878] [2023-08-03 20:44:33,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426208878] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:33,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49666370] [2023-08-03 20:44:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:33,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:33,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:33,345 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:33,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-03 20:44:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:33,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 20:44:33,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:44:33,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-03 20:44:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49666370] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 20:44:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-03 20:44:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710038118] [2023-08-03 20:44:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 20:44:33,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 20:44:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 20:44:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-03 20:44:33,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 236 [2023-08-03 20:44:33,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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) [2023-08-03 20:44:33,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:33,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 236 [2023-08-03 20:44:33,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:34,010 INFO L124 PetriNetUnfolderBase]: 3795/5282 cut-off events. [2023-08-03 20:44:34,011 INFO L125 PetriNetUnfolderBase]: For 3354/4307 co-relation queries the response was YES. [2023-08-03 20:44:34,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14893 conditions, 5282 events. 3795/5282 cut-off events. For 3354/4307 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 23273 event pairs, 2015 based on Foata normal form. 953/5041 useless extension candidates. Maximal degree in co-relation 14698. Up to 4092 conditions per place. [2023-08-03 20:44:34,034 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 62 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-03 20:44:34,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 72 transitions, 452 flow [2023-08-03 20:44:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 20:44:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 20:44:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-03 20:44:34,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777542372881356 [2023-08-03 20:44:34,036 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-03 20:44:34,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-03 20:44:34,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:34,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-03 20:44:34,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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) [2023-08-03 20:44:34,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:34,039 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-03 20:44:34,039 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 212 flow. Second operand 4 states and 451 transitions. [2023-08-03 20:44:34,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 72 transitions, 452 flow [2023-08-03 20:44:34,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 443 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 20:44:34,049 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 220 flow [2023-08-03 20:44:34,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2023-08-03 20:44:34,049 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-08-03 20:44:34,049 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 220 flow [2023-08-03 20:44:34,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 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) [2023-08-03 20:44:34,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:34,050 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:34,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-03 20:44:34,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-03 20:44:34,255 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:34,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -751802629, now seen corresponding path program 1 times [2023-08-03 20:44:34,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:34,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128063300] [2023-08-03 20:44:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:44:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128063300] [2023-08-03 20:44:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128063300] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648386331] [2023-08-03 20:44:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:34,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:34,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:34,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:34,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-03 20:44:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:34,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-03 20:44:34,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:44:35,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:44:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648386331] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:39,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 18 [2023-08-03 20:44:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155558865] [2023-08-03 20:44:39,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:39,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 20:44:39,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:39,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 20:44:39,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-08-03 20:44:40,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 236 [2023-08-03 20:44:40,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 220 flow. Second operand has 20 states, 20 states have (on average 94.3) internal successors, (1886), 20 states have internal predecessors, (1886), 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) [2023-08-03 20:44:40,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:40,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 236 [2023-08-03 20:44:40,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:44:45,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-03 20:44:54,521 INFO L124 PetriNetUnfolderBase]: 45676/62030 cut-off events. [2023-08-03 20:44:54,521 INFO L125 PetriNetUnfolderBase]: For 52403/55278 co-relation queries the response was YES. [2023-08-03 20:44:54,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186557 conditions, 62030 events. 45676/62030 cut-off events. For 52403/55278 co-relation queries the response was YES. Maximal size of possible extension queue 1465. Compared 366188 event pairs, 522 based on Foata normal form. 2878/51229 useless extension candidates. Maximal degree in co-relation 186103. Up to 11391 conditions per place. [2023-08-03 20:44:54,895 INFO L140 encePairwiseOnDemand]: 225/236 looper letters, 540 selfloop transitions, 154 changer transitions 25/724 dead transitions. [2023-08-03 20:44:54,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 724 transitions, 4751 flow [2023-08-03 20:44:54,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-03 20:44:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-03 20:44:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2935 transitions. [2023-08-03 20:44:54,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783246414602347 [2023-08-03 20:44:54,902 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2935 transitions. [2023-08-03 20:44:54,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2935 transitions. [2023-08-03 20:44:54,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:44:54,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2935 transitions. [2023-08-03 20:44:54,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 112.88461538461539) internal successors, (2935), 26 states have internal predecessors, (2935), 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) [2023-08-03 20:44:54,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 236.0) internal successors, (6372), 27 states have internal predecessors, (6372), 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) [2023-08-03 20:44:54,918 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 236.0) internal successors, (6372), 27 states have internal predecessors, (6372), 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) [2023-08-03 20:44:54,918 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 220 flow. Second operand 26 states and 2935 transitions. [2023-08-03 20:44:54,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 724 transitions, 4751 flow [2023-08-03 20:44:55,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 724 transitions, 4667 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-03 20:44:55,165 INFO L231 Difference]: Finished difference. Result has 102 places, 221 transitions, 1300 flow [2023-08-03 20:44:55,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1300, PETRI_PLACES=102, PETRI_TRANSITIONS=221} [2023-08-03 20:44:55,165 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2023-08-03 20:44:55,165 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 221 transitions, 1300 flow [2023-08-03 20:44:55,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 94.3) internal successors, (1886), 20 states have internal predecessors, (1886), 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) [2023-08-03 20:44:55,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:44:55,166 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:44:55,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-03 20:44:55,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-03 20:44:55,373 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:44:55,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:44:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2052524091, now seen corresponding path program 1 times [2023-08-03 20:44:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:44:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452608313] [2023-08-03 20:44:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:44:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-03 20:44:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:44:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452608313] [2023-08-03 20:44:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452608313] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:44:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347258562] [2023-08-03 20:44:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:44:55,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:44:55,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:44:55,506 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:44:55,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-03 20:44:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:44:55,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 20:44:55,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:44:55,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-03 20:44:55,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 20:44:55,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-03 20:44:55,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 20:44:55,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 20:44:55,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-03 20:44:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 20:44:55,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:44:56,332 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (<= .cse0 2147483647) (not (= (+ 4294967296 |c_ULTIMATE.start_main_#t~pre9#1|) .cse0))))) (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse1) (not (= |c_ULTIMATE.start_main_#t~pre9#1| .cse1)))))) is different from false [2023-08-03 20:44:56,357 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (<= .cse0 2147483647) (not (= (+ 4294967296 |c_#pthreadsForks|) .cse0))))) (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= |c_#pthreadsForks| .cse1)) (< 2147483647 .cse1))))) is different from false [2023-08-03 20:44:56,746 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:44:56,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 53 [2023-08-03 20:44:56,760 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:44:56,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2023-08-03 20:44:56,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-08-03 20:44:56,798 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-08-03 20:44:56,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 1 [2023-08-03 20:44:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 8 not checked. [2023-08-03 20:44:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347258562] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:44:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:44:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12, 10] total 23 [2023-08-03 20:44:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511805653] [2023-08-03 20:44:56,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:44:56,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 20:44:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:44:56,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 20:44:56,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=388, Unknown=18, NotChecked=82, Total=552 [2023-08-03 20:44:56,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 236 [2023-08-03 20:44:56,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 221 transitions, 1300 flow. Second operand has 24 states, 24 states have (on average 60.416666666666664) internal successors, (1450), 24 states have internal predecessors, (1450), 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) [2023-08-03 20:44:56,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:44:56,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 236 [2023-08-03 20:44:56,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:45:16,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L41-4-->L41-4: Formula: (and (< (mod v_thread1Thread1of2ForFork0_~i~0_26 4294967296) (mod v_~M~0_82 4294967296)) (= (+ v_thread1Thread1of2ForFork0_~i~0_26 1) v_thread1Thread1of2ForFork0_~i~0_25) (= v_~counter~0_81 (+ v_~counter~0_82 v_~C~0_55))) InVars {~counter~0=v_~counter~0_82, ~M~0=v_~M~0_82, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_26, ~C~0=v_~C~0_55} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_17|, ~M~0=v_~M~0_82, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_25, ~C~0=v_~C~0_55} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][487], [Black: 1088#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 161#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 32#L74-8true, Black: 1094#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 47#L41-4true, 1587#(< (mod thread2Thread2of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 649#true, Black: 652#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 339#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1773#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0)), Black: 1984#(and (<= (* 2 ~C~0) ~counter~0) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1676#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1680#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1982#(and (<= ~counter~0 ~C~0) (or (< 0 (mod ~C~0 2147483648)) (= ~counter~0 (* 2 ~C~0))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1677#(or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1994#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1754#(or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0)))), Black: 472#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L54-1true, 1674#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1673#(= ~counter~0 0), Black: 1980#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1675#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1986#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0) (or (<= 0 ~counter~0) (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)))), 2382#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) (+ (* (div thread2Thread1of2ForFork1_~i~1 4294967296) 4294967296) ~M~0))), Black: 1324#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 162#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 36#L54-1true, 234#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 4#$Ultimate##0true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 852#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 340#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 20:45:16,826 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-03 20:45:16,826 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-03 20:45:16,826 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-03 20:45:16,826 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-03 20:45:17,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([649] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread2of2ForFork0_~i~0_24 1) v_thread1Thread2of2ForFork0_~i~0_23) (< (mod v_thread1Thread2of2ForFork0_~i~0_24 4294967296) (mod v_~M~0_86 4294967296)) (= (+ v_~counter~0_86 v_~C~0_61) v_~counter~0_85)) InVars {~counter~0=v_~counter~0_86, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_24, ~M~0=v_~M~0_86, ~C~0=v_~C~0_61} OutVars{~counter~0=v_~counter~0_85, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_23, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_17|, ~M~0=v_~M~0_86, ~C~0=v_~C~0_61} AuxVars[] AssignedVars[~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][485], [Black: 161#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 32#L74-8true, Black: 1094#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 47#L41-4true, Black: 649#true, 1587#(< (mod thread2Thread2of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 652#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 339#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1773#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0)), Black: 1984#(and (<= (* 2 ~C~0) ~counter~0) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1676#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1680#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1982#(and (<= ~counter~0 ~C~0) (or (< 0 (mod ~C~0 2147483648)) (= ~counter~0 (* 2 ~C~0))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1677#(or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1994#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1754#(or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0)))), 46#L54-1true, Black: 472#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1673#(= ~counter~0 0), 1674#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1980#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1675#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1986#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0) (or (<= 0 ~counter~0) (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)))), 2382#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) (+ (* (div thread2Thread1of2ForFork1_~i~1 4294967296) 4294967296) ~M~0))), Black: 1324#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 162#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1088#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 53#L41-4true, 234#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 36#L54-1true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 852#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 340#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 20:45:17,123 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,123 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,123 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,123 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L54-1-->L54-1: Formula: (and (let ((.cse0 (mod v_~counter~0_58 4294967296))) (or (and (= |v_thread2Thread2of2ForFork1_#t~post2_8| |v_thread2Thread2of2ForFork1_#t~post2_7|) (= v_~counter~0_58 v_~counter~0_57) (= v_thread2Thread2of2ForFork1_~i~1_16 v_thread2Thread2of2ForFork1_~i~1_15) (<= .cse0 0)) (and (= v_thread2Thread2of2ForFork1_~i~1_15 (+ v_thread2Thread2of2ForFork1_~i~1_16 1)) (< 0 .cse0) (= v_~counter~0_58 (+ v_~counter~0_57 v_~C~0_39))))) (< (mod v_thread2Thread2of2ForFork1_~i~1_16 4294967296) (mod v_~M~0_50 4294967296))) InVars {~counter~0=v_~counter~0_58, ~M~0=v_~M~0_50, ~C~0=v_~C~0_39, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_16, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_8|} OutVars{~counter~0=v_~counter~0_57, ~M~0=v_~M~0_50, ~C~0=v_~C~0_39, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_15, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread2of2ForFork1_~i~1, thread2Thread2of2ForFork1_#t~post2][483], [Black: 161#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 32#L74-8true, Black: 1587#(< (mod thread2Thread2of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 1094#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 47#L41-4true, Black: 649#true, Black: 652#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 339#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1773#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0)), 2378#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= ~counter~0 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) (+ (* (div thread2Thread1of2ForFork1_~i~1 4294967296) 4294967296) ~M~0))), Black: 1984#(and (<= (* 2 ~C~0) ~counter~0) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 1702#(and (= thread1Thread1of2ForFork0_~i~0 0) (= ~counter~0 0)), Black: 1676#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1680#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1982#(and (<= ~counter~0 ~C~0) (or (< 0 (mod ~C~0 2147483648)) (= ~counter~0 (* 2 ~C~0))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1677#(or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1994#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1754#(or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0)))), 46#L54-1true, Black: 472#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1673#(= ~counter~0 0), Black: 1980#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1674#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1675#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1986#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0) (or (<= 0 ~counter~0) (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)))), Black: 1324#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 162#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1088#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 234#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 36#L54-1true, 4#$Ultimate##0true, thread1Thread1of2ForFork0InUse, thread2Thread1of2ForFork1InUse, Black: 852#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 340#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 20:45:17,177 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2023-08-03 20:45:17,177 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-03 20:45:17,177 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-03 20:45:17,177 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-03 20:45:17,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L54-1-->L54-1: Formula: (and (let ((.cse0 (mod v_~counter~0_58 4294967296))) (or (and (= |v_thread2Thread2of2ForFork1_#t~post2_8| |v_thread2Thread2of2ForFork1_#t~post2_7|) (= v_~counter~0_58 v_~counter~0_57) (= v_thread2Thread2of2ForFork1_~i~1_16 v_thread2Thread2of2ForFork1_~i~1_15) (<= .cse0 0)) (and (= v_thread2Thread2of2ForFork1_~i~1_15 (+ v_thread2Thread2of2ForFork1_~i~1_16 1)) (< 0 .cse0) (= v_~counter~0_58 (+ v_~counter~0_57 v_~C~0_39))))) (< (mod v_thread2Thread2of2ForFork1_~i~1_16 4294967296) (mod v_~M~0_50 4294967296))) InVars {~counter~0=v_~counter~0_58, ~M~0=v_~M~0_50, ~C~0=v_~C~0_39, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_16, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_8|} OutVars{~counter~0=v_~counter~0_57, ~M~0=v_~M~0_50, ~C~0=v_~C~0_39, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_15, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_7|} AuxVars[] AssignedVars[~counter~0, thread2Thread2of2ForFork1_~i~1, thread2Thread2of2ForFork1_#t~post2][572], [Black: 161#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1587#(< (mod thread2Thread2of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 1094#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 2384#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ 2 |ULTIMATE.start_main_#t~mem12#1|)) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= ~counter~0 0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) (+ (* (div thread2Thread1of2ForFork1_~i~1 4294967296) 4294967296) ~M~0))), 47#L41-4true, Black: 649#true, Black: 652#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 339#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1773#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0)), Black: 1984#(and (<= (* 2 ~C~0) ~counter~0) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 1702#(and (= thread1Thread1of2ForFork0_~i~0 0) (= ~counter~0 0)), Black: 1676#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1680#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1982#(and (<= ~counter~0 ~C~0) (or (< 0 (mod ~C~0 2147483648)) (= ~counter~0 (* 2 ~C~0))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1677#(or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1994#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1754#(or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0)))), Black: 472#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L54-1true, Black: 1673#(= ~counter~0 0), Black: 1980#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1674#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1675#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1986#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0) (or (<= 0 ~counter~0) (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)))), Black: 1324#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 162#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1088#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 36#L54-1true, 234#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 4#$Ultimate##0true, thread1Thread1of2ForFork0InUse, 112#L74-3true, thread2Thread1of2ForFork1InUse, Black: 852#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 340#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 20:45:17,212 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,212 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,212 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,212 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L41-4-->L41-4: Formula: (and (< (mod v_thread1Thread1of2ForFork0_~i~0_26 4294967296) (mod v_~M~0_82 4294967296)) (= (+ v_thread1Thread1of2ForFork0_~i~0_26 1) v_thread1Thread1of2ForFork0_~i~0_25) (= v_~counter~0_81 (+ v_~counter~0_82 v_~C~0_55))) InVars {~counter~0=v_~counter~0_82, ~M~0=v_~M~0_82, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_26, ~C~0=v_~C~0_55} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_17|, ~M~0=v_~M~0_82, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_25, ~C~0=v_~C~0_55} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][575], [Black: 1088#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 161#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1094#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 47#L41-4true, 1587#(< (mod thread2Thread2of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 649#true, Black: 652#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 339#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1773#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0)), Black: 1984#(and (<= (* 2 ~C~0) ~counter~0) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1676#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 2386#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ 2 |ULTIMATE.start_main_#t~mem12#1|)) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) (+ (* (div thread2Thread1of2ForFork1_~i~1 4294967296) 4294967296) ~M~0))), Black: 1680#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1982#(and (<= ~counter~0 ~C~0) (or (< 0 (mod ~C~0 2147483648)) (= ~counter~0 (* 2 ~C~0))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1677#(or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1994#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1754#(or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0)))), Black: 472#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 46#L54-1true, Black: 1673#(= ~counter~0 0), 1674#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1980#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1675#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1986#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0) (or (<= 0 ~counter~0) (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)))), Black: 1324#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 162#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 36#L54-1true, 234#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 4#$Ultimate##0true, thread1Thread1of2ForFork0InUse, 112#L74-3true, thread2Thread1of2ForFork1InUse, Black: 852#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 340#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 20:45:17,212 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,212 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,212 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,212 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-03 20:45:17,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([649] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread2of2ForFork0_~i~0_24 1) v_thread1Thread2of2ForFork0_~i~0_23) (< (mod v_thread1Thread2of2ForFork0_~i~0_24 4294967296) (mod v_~M~0_86 4294967296)) (= (+ v_~counter~0_86 v_~C~0_61) v_~counter~0_85)) InVars {~counter~0=v_~counter~0_86, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_24, ~M~0=v_~M~0_86, ~C~0=v_~C~0_61} OutVars{~counter~0=v_~counter~0_85, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_23, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_17|, ~M~0=v_~M~0_86, ~C~0=v_~C~0_61} AuxVars[] AssignedVars[~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][574], [Black: 161#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1094#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 47#L41-4true, 1587#(< (mod thread2Thread2of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 649#true, Black: 652#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 339#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1773#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0)), Black: 1984#(and (<= (* 2 ~C~0) ~counter~0) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 2386#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ 2 |ULTIMATE.start_main_#t~mem12#1|)) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) (+ (* (div thread2Thread1of2ForFork1_~i~1 4294967296) 4294967296) ~M~0))), Black: 1676#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1680#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1982#(and (<= ~counter~0 ~C~0) (or (< 0 (mod ~C~0 2147483648)) (= ~counter~0 (* 2 ~C~0))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1677#(or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1994#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (= thread2Thread2of2ForFork1_~i~1 0) (and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 1754#(or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0)))), 46#L54-1true, Black: 472#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1674#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1673#(= ~counter~0 0), Black: 1980#(and (or (and (<= (+ thread2Thread1of2ForFork1_~i~1 (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= 0 thread2Thread1of2ForFork1_~i~1)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))) (or (and (< 0 (mod ~C~0 2147483648)) (= ~counter~0 ~C~0)) (and (<= (mod ~C~0 2147483648) 0) (= ~counter~0 (* 2 ~C~0))))), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1675#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1986#(and (= (mod ~counter~0 2) 0) (<= (mod (* 2147483647 (div (* ~counter~0 (- 1)) 2)) 2147483648) 0) (or (<= 0 ~counter~0) (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)))), Black: 1324#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 162#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 1088#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 53#L41-4true, 234#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 36#L54-1true, thread1Thread1of2ForFork0InUse, 112#L74-3true, thread2Thread1of2ForFork1InUse, Black: 852#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 340#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 20:45:17,690 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-03 20:45:17,690 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:45:17,690 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:45:17,690 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 20:45:23,169 INFO L124 PetriNetUnfolderBase]: 53167/71658 cut-off events. [2023-08-03 20:45:23,169 INFO L125 PetriNetUnfolderBase]: For 189019/200396 co-relation queries the response was YES. [2023-08-03 20:45:23,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273302 conditions, 71658 events. 53167/71658 cut-off events. For 189019/200396 co-relation queries the response was YES. Maximal size of possible extension queue 1581. Compared 412538 event pairs, 6023 based on Foata normal form. 14037/84968 useless extension candidates. Maximal degree in co-relation 270970. Up to 40125 conditions per place. [2023-08-03 20:45:23,843 INFO L140 encePairwiseOnDemand]: 219/236 looper letters, 998 selfloop transitions, 131 changer transitions 0/1141 dead transitions. [2023-08-03 20:45:23,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 1141 transitions, 8892 flow [2023-08-03 20:45:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-03 20:45:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-03 20:45:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2249 transitions. [2023-08-03 20:45:23,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2722760290556901 [2023-08-03 20:45:23,849 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2249 transitions. [2023-08-03 20:45:23,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2249 transitions. [2023-08-03 20:45:23,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:45:23,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2249 transitions. [2023-08-03 20:45:23,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 64.25714285714285) internal successors, (2249), 35 states have internal predecessors, (2249), 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) [2023-08-03 20:45:23,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 236.0) internal successors, (8496), 36 states have internal predecessors, (8496), 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) [2023-08-03 20:45:23,865 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 236.0) internal successors, (8496), 36 states have internal predecessors, (8496), 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) [2023-08-03 20:45:23,865 INFO L175 Difference]: Start difference. First operand has 102 places, 221 transitions, 1300 flow. Second operand 35 states and 2249 transitions. [2023-08-03 20:45:23,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 1141 transitions, 8892 flow [2023-08-03 20:45:25,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 1141 transitions, 8852 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-03 20:45:25,717 INFO L231 Difference]: Finished difference. Result has 153 places, 341 transitions, 2487 flow [2023-08-03 20:45:25,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2487, PETRI_PLACES=153, PETRI_TRANSITIONS=341} [2023-08-03 20:45:25,718 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 112 predicate places. [2023-08-03 20:45:25,718 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 341 transitions, 2487 flow [2023-08-03 20:45:25,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 60.416666666666664) internal successors, (1450), 24 states have internal predecessors, (1450), 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) [2023-08-03 20:45:25,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:45:25,719 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:45:25,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-03 20:45:25,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-03 20:45:25,924 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:45:25,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:45:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2006994935, now seen corresponding path program 2 times [2023-08-03 20:45:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:45:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116853405] [2023-08-03 20:45:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:45:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:45:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:45:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 20:45:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:45:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116853405] [2023-08-03 20:45:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116853405] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:45:26,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298538772] [2023-08-03 20:45:26,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 20:45:26,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:45:26,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:45:26,362 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:45:26,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-03 20:45:26,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 20:45:26,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:45:26,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-03 20:45:26,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:45:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 20:45:27,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:45:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 20:45:28,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298538772] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:45:28,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:45:28,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2023-08-03 20:45:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825223664] [2023-08-03 20:45:28,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:45:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 20:45:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:45:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 20:45:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-08-03 20:45:28,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 236 [2023-08-03 20:45:28,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 341 transitions, 2487 flow. Second operand has 20 states, 20 states have (on average 93.5) internal successors, (1870), 20 states have internal predecessors, (1870), 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) [2023-08-03 20:45:28,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:45:28,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 236 [2023-08-03 20:45:28,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 20:46:13,868 INFO L124 PetriNetUnfolderBase]: 204356/284622 cut-off events. [2023-08-03 20:46:13,868 INFO L125 PetriNetUnfolderBase]: For 2267178/2287265 co-relation queries the response was YES. [2023-08-03 20:46:16,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379777 conditions, 284622 events. 204356/284622 cut-off events. For 2267178/2287265 co-relation queries the response was YES. Maximal size of possible extension queue 6017. Compared 2105499 event pairs, 20606 based on Foata normal form. 22217/305015 useless extension candidates. Maximal degree in co-relation 1361096. Up to 49611 conditions per place. [2023-08-03 20:46:18,143 INFO L140 encePairwiseOnDemand]: 224/236 looper letters, 1979 selfloop transitions, 1311 changer transitions 114/3416 dead transitions. [2023-08-03 20:46:18,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 3416 transitions, 31195 flow [2023-08-03 20:46:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-08-03 20:46:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2023-08-03 20:46:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 8318 transitions. [2023-08-03 20:46:18,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4637600356824264 [2023-08-03 20:46:18,154 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 8318 transitions. [2023-08-03 20:46:18,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 8318 transitions. [2023-08-03 20:46:18,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 20:46:18,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 8318 transitions. [2023-08-03 20:46:18,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 109.44736842105263) internal successors, (8318), 76 states have internal predecessors, (8318), 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) [2023-08-03 20:46:18,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 236.0) internal successors, (18172), 77 states have internal predecessors, (18172), 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) [2023-08-03 20:46:18,192 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 236.0) internal successors, (18172), 77 states have internal predecessors, (18172), 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) [2023-08-03 20:46:18,192 INFO L175 Difference]: Start difference. First operand has 153 places, 341 transitions, 2487 flow. Second operand 76 states and 8318 transitions. [2023-08-03 20:46:18,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 3416 transitions, 31195 flow [2023-08-03 20:47:10,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 3416 transitions, 29333 flow, removed 699 selfloop flow, removed 11 redundant places. [2023-08-03 20:47:11,008 INFO L231 Difference]: Finished difference. Result has 286 places, 1604 transitions, 16040 flow [2023-08-03 20:47:11,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=16040, PETRI_PLACES=286, PETRI_TRANSITIONS=1604} [2023-08-03 20:47:11,009 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places. [2023-08-03 20:47:11,009 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 1604 transitions, 16040 flow [2023-08-03 20:47:11,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 93.5) internal successors, (1870), 20 states have internal predecessors, (1870), 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) [2023-08-03 20:47:11,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 20:47:11,010 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 20:47:11,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-03 20:47:11,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:47:11,213 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 20:47:11,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 20:47:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash 776659643, now seen corresponding path program 3 times [2023-08-03 20:47:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 20:47:11,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135770816] [2023-08-03 20:47:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 20:47:11,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 20:47:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 20:47:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 20:47:11,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 20:47:11,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135770816] [2023-08-03 20:47:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135770816] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 20:47:11,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912010177] [2023-08-03 20:47:11,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 20:47:11,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 20:47:11,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 20:47:11,469 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 20:47:11,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-03 20:47:11,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 20:47:11,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 20:47:11,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-03 20:47:11,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 20:47:11,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-03 20:47:11,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-03 20:47:11,643 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-03 20:47:11,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-03 20:47:11,752 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 20:47:11,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 20:47:11,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-03 20:47:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 20:47:11,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 20:47:12,088 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (<= .cse0 2147483647) (not (= (+ 4294967296 c_thread1Thread2of2ForFork0_thidvar0) .cse0))))) (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse1) (not (= .cse1 c_thread1Thread2of2ForFork0_thidvar0)))))) is different from false [2023-08-03 20:47:12,643 INFO L322 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2023-08-03 20:47:12,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2023-08-03 20:47:12,653 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 20:47:12,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 62 [2023-08-03 20:47:12,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-08-03 20:47:12,701 INFO L322 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-08-03 20:47:12,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 1 [2023-08-03 20:47:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-08-03 20:47:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912010177] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 20:47:12,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 20:47:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 24 [2023-08-03 20:47:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435255386] [2023-08-03 20:47:12,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 20:47:12,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-03 20:47:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 20:47:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-03 20:47:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=477, Unknown=1, NotChecked=44, Total=600 [2023-08-03 20:47:12,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 236 [2023-08-03 20:47:12,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1604 transitions, 16040 flow. Second operand has 25 states, 25 states have (on average 63.64) internal successors, (1591), 25 states have internal predecessors, (1591), 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) [2023-08-03 20:47:12,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 20:47:12,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 236 [2023-08-03 20:47:12,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand