/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 01:54:11,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 01:54:11,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 01:54:11,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 01:54:11,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 01:54:12,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 01:54:12,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 01:54:12,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 01:54:12,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 01:54:12,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 01:54:12,005 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 01:54:12,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 01:54:12,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 01:54:12,007 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 01:54:12,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 01:54:12,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 01:54:12,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 01:54:12,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 01:54:12,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 01:54:12,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 01:54:12,009 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 01:54:12,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 01:54:12,010 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 01:54:12,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 01:54:12,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 01:54:12,011 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 01:54:12,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 01:54:12,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 01:54:12,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 01:54:12,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 01:54:12,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 01:54:12,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 01:54:12,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 01:54:12,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 01:54:12,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 01:54:12,013 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-08-24 01:54:12,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 01:54:12,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 01:54:12,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 01:54:12,345 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 01:54:12,346 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 01:54:12,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-24 01:54:13,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 01:54:13,605 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 01:54:13,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-24 01:54:13,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6daf133b/af5a5b52cebe4c19b5b56fbc54469216/FLAGdea502268 [2023-08-24 01:54:13,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6daf133b/af5a5b52cebe4c19b5b56fbc54469216 [2023-08-24 01:54:13,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 01:54:13,632 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 01:54:13,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 01:54:13,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 01:54:13,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 01:54:13,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:13,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716296c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13, skipping insertion in model container [2023-08-24 01:54:13,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:13,675 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 01:54:13,870 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-08-24 01:54:13,874 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 01:54:13,884 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 01:54:13,934 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-08-24 01:54:13,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 01:54:13,946 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 01:54:13,946 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 01:54:13,952 INFO L206 MainTranslator]: Completed translation [2023-08-24 01:54:13,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13 WrapperNode [2023-08-24 01:54:13,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 01:54:13,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 01:54:13,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 01:54:13,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 01:54:13,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:13,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,018 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 288 [2023-08-24 01:54:14,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 01:54:14,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 01:54:14,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 01:54:14,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 01:54:14,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 01:54:14,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 01:54:14,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 01:54:14,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 01:54:14,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (1/1) ... [2023-08-24 01:54:14,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 01:54:14,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:54:14,106 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-24 01:54:14,130 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-24 01:54:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 01:54:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 01:54:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 01:54:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 01:54:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 01:54:14,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 01:54:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 01:54:14,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 01:54:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 01:54:14,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 01:54:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 01:54:14,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 01:54:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 01:54:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 01:54:14,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 01:54:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 01:54:14,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 01:54:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 01:54:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 01:54:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 01:54:14,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 01:54:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 01:54:14,143 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 01:54:14,233 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 01:54:14,234 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 01:54:14,600 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 01:54:14,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 01:54:14,696 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 01:54:14,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:54:14 BoogieIcfgContainer [2023-08-24 01:54:14,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 01:54:14,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 01:54:14,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 01:54:14,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 01:54:14,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 01:54:13" (1/3) ... [2023-08-24 01:54:14,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10609c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:54:14, skipping insertion in model container [2023-08-24 01:54:14,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:54:13" (2/3) ... [2023-08-24 01:54:14,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10609c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:54:14, skipping insertion in model container [2023-08-24 01:54:14,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:54:14" (3/3) ... [2023-08-24 01:54:14,708 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-08-24 01:54:14,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 01:54:14,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 01:54:14,723 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 01:54:14,837 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-24 01:54:14,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 191 transitions, 430 flow [2023-08-24 01:54:14,966 INFO L124 PetriNetUnfolderBase]: 2/185 cut-off events. [2023-08-24 01:54:14,967 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 01:54:14,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 185 events. 2/185 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-08-24 01:54:14,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 191 transitions, 430 flow [2023-08-24 01:54:14,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 169 transitions, 374 flow [2023-08-24 01:54:14,984 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 01:54:14,996 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 169 transitions, 374 flow [2023-08-24 01:54:15,000 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 169 transitions, 374 flow [2023-08-24 01:54:15,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 169 transitions, 374 flow [2023-08-24 01:54:15,040 INFO L124 PetriNetUnfolderBase]: 2/169 cut-off events. [2023-08-24 01:54:15,041 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 01:54:15,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 169 events. 2/169 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-08-24 01:54:15,044 INFO L119 LiptonReduction]: Number of co-enabled transitions 3042 [2023-08-24 01:54:21,131 INFO L134 LiptonReduction]: Checked pairs total: 15662 [2023-08-24 01:54:21,132 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-24 01:54:21,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 01:54:21,149 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=false, 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;@44024093, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 01:54:21,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 01:54:21,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 01:54:21,162 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2023-08-24 01:54:21,162 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 01:54:21,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:54:21,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:54:21,164 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:54:21,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:54:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash 477829290, now seen corresponding path program 1 times [2023-08-24 01:54:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:54:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797577536] [2023-08-24 01:54:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:54:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:54:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:54:22,819 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-24 01:54:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:54:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797577536] [2023-08-24 01:54:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797577536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:54:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:54:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 01:54:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146836183] [2023-08-24 01:54:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:54:22,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 01:54:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:54:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 01:54:22,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-24 01:54:22,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 317 [2023-08-24 01:54:22,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 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-24 01:54:22,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:54:22,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 317 [2023-08-24 01:54:22,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:54:44,804 INFO L124 PetriNetUnfolderBase]: 340125/423387 cut-off events. [2023-08-24 01:54:44,805 INFO L125 PetriNetUnfolderBase]: For 25992/25992 co-relation queries the response was YES. [2023-08-24 01:54:45,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867685 conditions, 423387 events. 340125/423387 cut-off events. For 25992/25992 co-relation queries the response was YES. Maximal size of possible extension queue 7883. Compared 2334367 event pairs, 87704 based on Foata normal form. 1/423388 useless extension candidates. Maximal degree in co-relation 755129. Up to 222239 conditions per place. [2023-08-24 01:54:46,828 INFO L140 encePairwiseOnDemand]: 308/317 looper letters, 143 selfloop transitions, 18 changer transitions 17/178 dead transitions. [2023-08-24 01:54:46,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 178 transitions, 820 flow [2023-08-24 01:54:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 01:54:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 01:54:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1049 transitions. [2023-08-24 01:54:46,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5515247108307045 [2023-08-24 01:54:46,844 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1049 transitions. [2023-08-24 01:54:46,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1049 transitions. [2023-08-24 01:54:46,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:54:46,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1049 transitions. [2023-08-24 01:54:46,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 174.83333333333334) internal successors, (1049), 6 states have internal predecessors, (1049), 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-24 01:54:46,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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-24 01:54:46,866 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 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-24 01:54:46,867 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 136 flow. Second operand 6 states and 1049 transitions. [2023-08-24 01:54:46,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 178 transitions, 820 flow [2023-08-24 01:54:48,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 178 transitions, 748 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-24 01:54:48,781 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 234 flow [2023-08-24 01:54:48,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2023-08-24 01:54:48,786 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2023-08-24 01:54:48,787 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 234 flow [2023-08-24 01:54:48,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 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-24 01:54:48,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:54:48,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:54:48,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 01:54:48,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:54:48,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:54:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1298141890, now seen corresponding path program 2 times [2023-08-24 01:54:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:54:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523495628] [2023-08-24 01:54:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:54:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:54:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:54:49,182 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-24 01:54:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:54:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523495628] [2023-08-24 01:54:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523495628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:54:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:54:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 01:54:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746874111] [2023-08-24 01:54:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:54:49,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 01:54:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:54:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 01:54:49,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 01:54:49,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 01:54:49,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 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-24 01:54:49,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:54:49,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 01:54:49,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:54:58,111 INFO L124 PetriNetUnfolderBase]: 110776/147831 cut-off events. [2023-08-24 01:54:58,112 INFO L125 PetriNetUnfolderBase]: For 4522/5028 co-relation queries the response was YES. [2023-08-24 01:54:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303402 conditions, 147831 events. 110776/147831 cut-off events. For 4522/5028 co-relation queries the response was YES. Maximal size of possible extension queue 5871. Compared 982079 event pairs, 16644 based on Foata normal form. 1180/139833 useless extension candidates. Maximal degree in co-relation 186181. Up to 115357 conditions per place. [2023-08-24 01:54:59,096 INFO L140 encePairwiseOnDemand]: 303/317 looper letters, 126 selfloop transitions, 30 changer transitions 0/184 dead transitions. [2023-08-24 01:54:59,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 184 transitions, 792 flow [2023-08-24 01:54:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 01:54:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 01:54:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1201 transitions. [2023-08-24 01:54:59,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5412347904461469 [2023-08-24 01:54:59,104 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1201 transitions. [2023-08-24 01:54:59,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1201 transitions. [2023-08-24 01:54:59,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:54:59,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1201 transitions. [2023-08-24 01:54:59,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.57142857142858) internal successors, (1201), 7 states have internal predecessors, (1201), 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-24 01:54:59,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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-24 01:54:59,117 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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-24 01:54:59,117 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 234 flow. Second operand 7 states and 1201 transitions. [2023-08-24 01:54:59,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 184 transitions, 792 flow [2023-08-24 01:54:59,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 184 transitions, 784 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 01:54:59,174 INFO L231 Difference]: Finished difference. Result has 74 places, 100 transitions, 403 flow [2023-08-24 01:54:59,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=74, PETRI_TRANSITIONS=100} [2023-08-24 01:54:59,175 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2023-08-24 01:54:59,175 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 403 flow [2023-08-24 01:54:59,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 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-24 01:54:59,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:54:59,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:54:59,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 01:54:59,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:54:59,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:54:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash -812834256, now seen corresponding path program 3 times [2023-08-24 01:54:59,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:54:59,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861744516] [2023-08-24 01:54:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:54:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:54:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:54:59,548 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-24 01:54:59,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:54:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861744516] [2023-08-24 01:54:59,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861744516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:54:59,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:54:59,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 01:54:59,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305755647] [2023-08-24 01:54:59,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:54:59,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 01:54:59,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:54:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 01:54:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 01:54:59,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 01:54:59,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 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-24 01:54:59,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:54:59,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 01:54:59,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:55:08,335 INFO L124 PetriNetUnfolderBase]: 103247/139730 cut-off events. [2023-08-24 01:55:08,335 INFO L125 PetriNetUnfolderBase]: For 76193/83180 co-relation queries the response was YES. [2023-08-24 01:55:09,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378068 conditions, 139730 events. 103247/139730 cut-off events. For 76193/83180 co-relation queries the response was YES. Maximal size of possible extension queue 5007. Compared 959589 event pairs, 20431 based on Foata normal form. 3354/134375 useless extension candidates. Maximal degree in co-relation 225055. Up to 107412 conditions per place. [2023-08-24 01:55:09,540 INFO L140 encePairwiseOnDemand]: 303/317 looper letters, 122 selfloop transitions, 45 changer transitions 0/195 dead transitions. [2023-08-24 01:55:09,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 195 transitions, 1035 flow [2023-08-24 01:55:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 01:55:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 01:55:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1195 transitions. [2023-08-24 01:55:09,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5385308697611537 [2023-08-24 01:55:09,543 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1195 transitions. [2023-08-24 01:55:09,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1195 transitions. [2023-08-24 01:55:09,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:55:09,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1195 transitions. [2023-08-24 01:55:09,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.71428571428572) internal successors, (1195), 7 states have internal predecessors, (1195), 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-24 01:55:09,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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-24 01:55:09,551 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 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-24 01:55:09,552 INFO L175 Difference]: Start difference. First operand has 74 places, 100 transitions, 403 flow. Second operand 7 states and 1195 transitions. [2023-08-24 01:55:09,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 195 transitions, 1035 flow [2023-08-24 01:55:09,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 195 transitions, 1035 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 01:55:09,641 INFO L231 Difference]: Finished difference. Result has 82 places, 117 transitions, 598 flow [2023-08-24 01:55:09,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=598, PETRI_PLACES=82, PETRI_TRANSITIONS=117} [2023-08-24 01:55:09,642 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 13 predicate places. [2023-08-24 01:55:09,642 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 117 transitions, 598 flow [2023-08-24 01:55:09,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.16666666666666) internal successors, (937), 6 states have internal predecessors, (937), 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-24 01:55:09,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:09,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:09,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 01:55:09,643 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:55:09,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -857617794, now seen corresponding path program 4 times [2023-08-24 01:55:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008599227] [2023-08-24 01:55:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:10,007 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-24 01:55:10,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:55:10,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008599227] [2023-08-24 01:55:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008599227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:55:10,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:55:10,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 01:55:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299923925] [2023-08-24 01:55:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:55:10,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 01:55:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:55:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 01:55:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 01:55:10,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 01:55:10,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 117 transitions, 598 flow. Second operand has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 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-24 01:55:10,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:55:10,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 01:55:10,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:55:19,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][198], [60#L181-4true, 72#L150true, 37#thread2EXITtrue, 251#true, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, 211#true, 49#thread5EXITtrue, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:19,002 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:55:19,003 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:19,003 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:19,003 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:19,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][198], [72#L150true, 37#thread2EXITtrue, 251#true, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 87#L182-1true, 150#L112true, 211#true, 49#thread5EXITtrue, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 129#L93true, 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:19,191 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:55:19,191 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:19,191 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:19,191 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:19,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([670] L150-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork3_#res#1.offset_7| 0) (= (+ v_~s~0_143 1) v_~s~0_142) (= |v_thread6Thread1of1ForFork3_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_143} OutVars{thread6Thread1of1ForFork3_#t~post12#1=|v_thread6Thread1of1ForFork3_#t~post12#1_7|, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_7|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_7|, ~s~0=v_~s~0_142} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~post12#1, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_#res#1.offset, ~s~0][244], [60#L181-4true, 251#true, 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 211#true, 124#thread4EXITtrue, 147#L74true, 194#thread1EXITtrue, 7#thread6EXITtrue, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 22#L131true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:19,535 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 01:55:19,535 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 01:55:19,535 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 01:55:19,536 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 01:55:19,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([670] L150-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork3_#res#1.offset_7| 0) (= (+ v_~s~0_143 1) v_~s~0_142) (= |v_thread6Thread1of1ForFork3_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_143} OutVars{thread6Thread1of1ForFork3_#t~post12#1=|v_thread6Thread1of1ForFork3_#t~post12#1_7|, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_7|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_7|, ~s~0=v_~s~0_142} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~post12#1, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_#res#1.offset, ~s~0][244], [251#true, 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 87#L182-1true, 211#true, 147#L74true, 124#thread4EXITtrue, 194#thread1EXITtrue, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 22#L131true, 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:19,705 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 01:55:19,705 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 01:55:19,705 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 01:55:19,705 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 01:55:19,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([670] L150-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork3_#res#1.offset_7| 0) (= (+ v_~s~0_143 1) v_~s~0_142) (= |v_thread6Thread1of1ForFork3_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_143} OutVars{thread6Thread1of1ForFork3_#t~post12#1=|v_thread6Thread1of1ForFork3_#t~post12#1_7|, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_7|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_7|, ~s~0=v_~s~0_142} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~post12#1, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_#res#1.offset, ~s~0][244], [251#true, 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 211#true, 124#thread4EXITtrue, 147#L74true, 15#L182-2true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 22#L131true, 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:19,791 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 01:55:19,791 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 01:55:19,791 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 01:55:19,791 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 01:55:19,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([670] L150-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork3_#res#1.offset_7| 0) (= (+ v_~s~0_143 1) v_~s~0_142) (= |v_thread6Thread1of1ForFork3_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_143} OutVars{thread6Thread1of1ForFork3_#t~post12#1=|v_thread6Thread1of1ForFork3_#t~post12#1_7|, thread6Thread1of1ForFork3_#res#1.base=|v_thread6Thread1of1ForFork3_#res#1.base_7|, thread6Thread1of1ForFork3_#res#1.offset=|v_thread6Thread1of1ForFork3_#res#1.offset_7|, ~s~0=v_~s~0_142} AuxVars[] AssignedVars[thread6Thread1of1ForFork3_#t~post12#1, thread6Thread1of1ForFork3_#res#1.base, thread6Thread1of1ForFork3_#res#1.offset, ~s~0][244], [251#true, 157#L183-1true, 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 211#true, 124#thread4EXITtrue, 147#L74true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 22#L131true, 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:19,845 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 01:55:19,845 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 01:55:19,845 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 01:55:19,845 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 01:55:19,958 INFO L124 PetriNetUnfolderBase]: 110878/151339 cut-off events. [2023-08-24 01:55:19,959 INFO L125 PetriNetUnfolderBase]: For 132803/138820 co-relation queries the response was YES. [2023-08-24 01:55:20,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440067 conditions, 151339 events. 110878/151339 cut-off events. For 132803/138820 co-relation queries the response was YES. Maximal size of possible extension queue 5371. Compared 1073080 event pairs, 26958 based on Foata normal form. 2412/143427 useless extension candidates. Maximal degree in co-relation 270868. Up to 109237 conditions per place. [2023-08-24 01:55:21,027 INFO L140 encePairwiseOnDemand]: 303/317 looper letters, 141 selfloop transitions, 89 changer transitions 0/258 dead transitions. [2023-08-24 01:55:21,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 258 transitions, 1633 flow [2023-08-24 01:55:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 01:55:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 01:55:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1527 transitions. [2023-08-24 01:55:21,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352260778128286 [2023-08-24 01:55:21,031 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1527 transitions. [2023-08-24 01:55:21,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1527 transitions. [2023-08-24 01:55:21,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:55:21,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1527 transitions. [2023-08-24 01:55:21,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.66666666666666) internal successors, (1527), 9 states have internal predecessors, (1527), 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-24 01:55:21,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 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-24 01:55:21,040 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 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-24 01:55:21,040 INFO L175 Difference]: Start difference. First operand has 82 places, 117 transitions, 598 flow. Second operand 9 states and 1527 transitions. [2023-08-24 01:55:21,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 258 transitions, 1633 flow [2023-08-24 01:55:21,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 258 transitions, 1626 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 01:55:21,186 INFO L231 Difference]: Finished difference. Result has 93 places, 163 transitions, 1144 flow [2023-08-24 01:55:21,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1144, PETRI_PLACES=93, PETRI_TRANSITIONS=163} [2023-08-24 01:55:21,187 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 24 predicate places. [2023-08-24 01:55:21,187 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 163 transitions, 1144 flow [2023-08-24 01:55:21,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 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-24 01:55:21,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:21,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:21,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 01:55:21,188 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:55:21,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1528369352, now seen corresponding path program 5 times [2023-08-24 01:55:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:21,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462987348] [2023-08-24 01:55:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:21,729 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-24 01:55:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:55:21,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462987348] [2023-08-24 01:55:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462987348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:55:21,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:55:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 01:55:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506032829] [2023-08-24 01:55:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:55:21,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 01:55:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:55:21,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 01:55:21,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-24 01:55:21,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 01:55:21,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 163 transitions, 1144 flow. Second operand has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 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-24 01:55:21,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:55:21,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 01:55:21,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:55:47,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][368], [60#L181-4true, 72#L150true, 251#true, 80#thread3EXITtrue, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 274#(<= (+ 2 ~s~0) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 211#true, 124#thread4EXITtrue, 147#L74true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 22#L131true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:47,670 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:55:47,670 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:47,671 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:47,671 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:47,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][367], [60#L181-4true, 72#L150true, 251#true, 80#thread3EXITtrue, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 274#(<= (+ 2 ~s~0) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 211#true, 124#thread4EXITtrue, 147#L74true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 22#L131true, 13#L52true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:47,698 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:55:47,698 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:47,698 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:47,698 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:55:49,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][368], [72#L150true, 251#true, 80#thread3EXITtrue, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 274#(<= (+ 2 ~s~0) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 87#L182-1true, 211#true, 124#thread4EXITtrue, 147#L74true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 22#L131true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:49,021 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:55:49,021 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:49,021 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:49,021 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:49,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][367], [72#L150true, 251#true, 80#thread3EXITtrue, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 87#L182-1true, 211#true, 124#thread4EXITtrue, 147#L74true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 22#L131true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256))]) [2023-08-24 01:55:49,036 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:55:49,036 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:49,036 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:49,036 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:55:51,497 INFO L124 PetriNetUnfolderBase]: 264211/372525 cut-off events. [2023-08-24 01:55:51,497 INFO L125 PetriNetUnfolderBase]: For 452373/458075 co-relation queries the response was YES. [2023-08-24 01:55:53,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119812 conditions, 372525 events. 264211/372525 cut-off events. For 452373/458075 co-relation queries the response was YES. Maximal size of possible extension queue 16361. Compared 3130505 event pairs, 50991 based on Foata normal form. 7811/357561 useless extension candidates. Maximal degree in co-relation 572000. Up to 97495 conditions per place. [2023-08-24 01:55:54,686 INFO L140 encePairwiseOnDemand]: 303/317 looper letters, 216 selfloop transitions, 210 changer transitions 0/454 dead transitions. [2023-08-24 01:55:54,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 454 transitions, 3471 flow [2023-08-24 01:55:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 01:55:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 01:55:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2228 transitions. [2023-08-24 01:55:54,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5406454743994176 [2023-08-24 01:55:54,692 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2228 transitions. [2023-08-24 01:55:54,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2228 transitions. [2023-08-24 01:55:54,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:55:54,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2228 transitions. [2023-08-24 01:55:54,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 171.3846153846154) internal successors, (2228), 13 states have internal predecessors, (2228), 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-24 01:55:54,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 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-24 01:55:54,703 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 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-24 01:55:54,703 INFO L175 Difference]: Start difference. First operand has 93 places, 163 transitions, 1144 flow. Second operand 13 states and 2228 transitions. [2023-08-24 01:55:54,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 454 transitions, 3471 flow [2023-08-24 01:55:58,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 454 transitions, 3446 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-24 01:55:58,632 INFO L231 Difference]: Finished difference. Result has 111 places, 286 transitions, 2868 flow [2023-08-24 01:55:58,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2868, PETRI_PLACES=111, PETRI_TRANSITIONS=286} [2023-08-24 01:55:58,633 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 42 predicate places. [2023-08-24 01:55:58,633 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 286 transitions, 2868 flow [2023-08-24 01:55:58,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 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-24 01:55:58,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:55:58,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:55:58,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 01:55:58,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:55:58,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:55:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2063468316, now seen corresponding path program 6 times [2023-08-24 01:55:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:55:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041114345] [2023-08-24 01:55:58,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:55:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:55:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:55:59,003 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-24 01:55:59,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:55:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041114345] [2023-08-24 01:55:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041114345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:55:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:55:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 01:55:59,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591229797] [2023-08-24 01:55:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:55:59,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 01:55:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:55:59,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 01:55:59,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-24 01:55:59,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 01:55:59,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 286 transitions, 2868 flow. Second operand has 9 states, 9 states have (on average 153.77777777777777) internal successors, (1384), 9 states have internal predecessors, (1384), 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-24 01:55:59,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:55:59,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 01:55:59,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:56:29,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [60#L181-4true, 251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), 50#L45true, Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), 218#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 147#L74true, 124#thread4EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true]) [2023-08-24 01:56:29,138 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-24 01:56:29,138 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 01:56:29,139 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 01:56:29,139 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 01:56:32,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [60#L181-4true, 44#L49true, 251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), 218#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 147#L74true, 124#thread4EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true]) [2023-08-24 01:56:32,788 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 01:56:32,788 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:56:32,788 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:56:32,788 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:56:32,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][425], [60#L181-4true, 251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 211#true, 147#L74true, 124#thread4EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 238#true]) [2023-08-24 01:56:32,788 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:56:32,788 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:32,788 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:32,788 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:32,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 50#L45true, Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), 218#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 87#L182-1true, 124#thread4EXITtrue, 147#L74true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true]) [2023-08-24 01:56:32,789 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-24 01:56:32,789 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:56:32,789 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:56:32,789 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-24 01:56:34,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][426], [60#L181-4true, 251#true, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 274#(<= (+ 2 ~s~0) ~t~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 211#true, 147#L74true, 194#thread1EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true]) [2023-08-24 01:56:34,903 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:56:34,904 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:34,904 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:34,904 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:35,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [44#L49true, 251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), 218#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 87#L182-1true, 124#thread4EXITtrue, 147#L74true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true]) [2023-08-24 01:56:35,140 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:56:35,140 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:35,140 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:35,140 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:35,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][425], [251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 87#L182-1true, 211#true, 124#thread4EXITtrue, 147#L74true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 238#true]) [2023-08-24 01:56:35,140 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:56:35,140 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:35,140 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:35,140 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:35,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][426], [60#L181-4true, 251#true, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 274#(<= (+ 2 ~s~0) ~t~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 211#true, 124#thread4EXITtrue, 147#L74true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true]) [2023-08-24 01:56:35,199 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:56:35,200 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:35,200 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:35,200 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:56:37,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][426], [251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 87#L182-1true, 211#true, 147#L74true, 194#thread1EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true]) [2023-08-24 01:56:37,435 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 01:56:37,435 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 01:56:37,435 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 01:56:37,435 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 01:56:37,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][426], [251#true, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 274#(<= (+ 2 ~s~0) ~t~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 87#L182-1true, 211#true, 147#L74true, 124#thread4EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 238#true]) [2023-08-24 01:56:37,622 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:56:37,622 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:37,622 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:37,622 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:56:41,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][323], [113#L183-2true, 251#true, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 304#(<= (+ ~s~0 4) ~t~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 275#(<= (+ 3 ~s~0) ~t~0), 211#true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 274#(<= (+ 2 ~s~0) ~t~0), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, 129#L93true]) [2023-08-24 01:56:41,139 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 01:56:41,139 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 01:56:41,139 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 01:56:41,139 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 01:56:41,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][323], [251#true, 79#L184-1true, 304#(<= (+ ~s~0 4) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 275#(<= (+ 3 ~s~0) ~t~0), 211#true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 274#(<= (+ 2 ~s~0) ~t~0), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, 129#L93true]) [2023-08-24 01:56:41,740 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 01:56:41,740 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 01:56:41,740 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 01:56:41,740 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 01:56:42,074 INFO L124 PetriNetUnfolderBase]: 288459/410327 cut-off events. [2023-08-24 01:56:42,074 INFO L125 PetriNetUnfolderBase]: For 1434343/1469476 co-relation queries the response was YES. [2023-08-24 01:56:44,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629792 conditions, 410327 events. 288459/410327 cut-off events. For 1434343/1469476 co-relation queries the response was YES. Maximal size of possible extension queue 17344. Compared 3533747 event pairs, 58487 based on Foata normal form. 7644/392889 useless extension candidates. Maximal degree in co-relation 799052. Up to 107470 conditions per place. [2023-08-24 01:56:46,701 INFO L140 encePairwiseOnDemand]: 303/317 looper letters, 206 selfloop transitions, 407 changer transitions 1/642 dead transitions. [2023-08-24 01:56:46,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 642 transitions, 6905 flow [2023-08-24 01:56:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 01:56:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 01:56:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2225 transitions. [2023-08-24 01:56:46,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5399174957534579 [2023-08-24 01:56:46,707 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2225 transitions. [2023-08-24 01:56:46,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2225 transitions. [2023-08-24 01:56:46,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:56:46,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2225 transitions. [2023-08-24 01:56:46,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 171.15384615384616) internal successors, (2225), 13 states have internal predecessors, (2225), 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-24 01:56:46,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 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-24 01:56:46,718 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 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-24 01:56:46,718 INFO L175 Difference]: Start difference. First operand has 111 places, 286 transitions, 2868 flow. Second operand 13 states and 2225 transitions. [2023-08-24 01:56:46,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 642 transitions, 6905 flow [2023-08-24 01:57:20,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 642 transitions, 6738 flow, removed 77 selfloop flow, removed 2 redundant places. [2023-08-24 01:57:20,744 INFO L231 Difference]: Finished difference. Result has 127 places, 488 transitions, 6440 flow [2023-08-24 01:57:20,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=2755, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6440, PETRI_PLACES=127, PETRI_TRANSITIONS=488} [2023-08-24 01:57:20,746 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 58 predicate places. [2023-08-24 01:57:20,746 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 488 transitions, 6440 flow [2023-08-24 01:57:20,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 153.77777777777777) internal successors, (1384), 9 states have internal predecessors, (1384), 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-24 01:57:20,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:57:20,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:57:20,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 01:57:20,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:57:20,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:57:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 547651110, now seen corresponding path program 7 times [2023-08-24 01:57:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:57:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704393737] [2023-08-24 01:57:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:57:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:57:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:57:21,058 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-24 01:57:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:57:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704393737] [2023-08-24 01:57:21,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704393737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:57:21,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:57:21,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 01:57:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209392308] [2023-08-24 01:57:21,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:57:21,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 01:57:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:57:21,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 01:57:21,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-24 01:57:21,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 01:57:21,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 488 transitions, 6440 flow. Second operand has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 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-24 01:57:21,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:57:21,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 01:57:21,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:58:05,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][438], [Black: 309#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), 60#L181-4true, Black: 315#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 313#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 211#true, 124#thread4EXITtrue, 147#L74true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), 328#(<= (+ 2 ~s~0) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, Black: 302#(<= (+ 2 ~s~0) ~t~0), Black: 301#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 01:58:05,105 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:58:05,105 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:58:05,105 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:58:05,105 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:58:05,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][437], [Black: 309#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), 60#L181-4true, Black: 315#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 313#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 211#true, 124#thread4EXITtrue, 147#L74true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), 328#(<= (+ 2 ~s~0) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 238#true, Black: 302#(<= (+ 2 ~s~0) ~t~0), Black: 301#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 01:58:05,496 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 01:58:05,496 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:58:05,496 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:58:05,496 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 01:58:07,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][438], [Black: 309#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), Black: 315#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 313#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 251#true, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 274#(<= (+ 2 ~s~0) ~t~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 87#L182-1true, 211#true, 147#L74true, 124#thread4EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), 80#thread3EXITtrue, Black: 225#(= ~t~0 ~s~0), 328#(<= (+ 2 ~s~0) ~t~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 238#true, Black: 302#(<= (+ 2 ~s~0) ~t~0), Black: 301#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 01:58:07,893 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:58:07,893 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:58:07,893 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:58:07,893 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:58:07,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][437], [Black: 309#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), Black: 315#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 313#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 251#true, 274#(<= (+ 2 ~s~0) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 87#L182-1true, 211#true, 124#thread4EXITtrue, 147#L74true, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 80#thread3EXITtrue, Black: 273#(<= (+ ~s~0 1) ~t~0), 328#(<= (+ 2 ~s~0) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 303#(<= (+ 3 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 13#L52true, 238#true, Black: 302#(<= (+ 2 ~s~0) ~t~0), Black: 301#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 01:58:07,917 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 01:58:07,917 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:58:07,917 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:58:07,917 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 01:58:16,778 INFO L124 PetriNetUnfolderBase]: 296856/421844 cut-off events. [2023-08-24 01:58:16,778 INFO L125 PetriNetUnfolderBase]: For 2372622/2463931 co-relation queries the response was YES. [2023-08-24 01:58:21,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980165 conditions, 421844 events. 296856/421844 cut-off events. For 2372622/2463931 co-relation queries the response was YES. Maximal size of possible extension queue 17722. Compared 3623968 event pairs, 57238 based on Foata normal form. 16440/413733 useless extension candidates. Maximal degree in co-relation 1233448. Up to 117656 conditions per place. [2023-08-24 01:58:23,886 INFO L140 encePairwiseOnDemand]: 303/317 looper letters, 228 selfloop transitions, 432 changer transitions 6/694 dead transitions. [2023-08-24 01:58:23,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 694 transitions, 9432 flow [2023-08-24 01:58:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 01:58:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 01:58:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1886 transitions. [2023-08-24 01:58:23,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408660739891024 [2023-08-24 01:58:23,903 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1886 transitions. [2023-08-24 01:58:23,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1886 transitions. [2023-08-24 01:58:23,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:58:23,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1886 transitions. [2023-08-24 01:58:23,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 171.45454545454547) internal successors, (1886), 11 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-24 01:58:23,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 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-24 01:58:23,912 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 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-24 01:58:23,912 INFO L175 Difference]: Start difference. First operand has 127 places, 488 transitions, 6440 flow. Second operand 11 states and 1886 transitions. [2023-08-24 01:58:23,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 694 transitions, 9432 flow [2023-08-24 01:59:57,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 694 transitions, 9222 flow, removed 90 selfloop flow, removed 3 redundant places. [2023-08-24 01:59:57,649 INFO L231 Difference]: Finished difference. Result has 136 places, 555 transitions, 8270 flow [2023-08-24 01:59:57,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=6230, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8270, PETRI_PLACES=136, PETRI_TRANSITIONS=555} [2023-08-24 01:59:57,650 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 67 predicate places. [2023-08-24 01:59:57,650 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 555 transitions, 8270 flow [2023-08-24 01:59:57,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 154.375) internal successors, (1235), 8 states have internal predecessors, (1235), 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-24 01:59:57,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:59:57,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:59:57,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 01:59:57,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 01:59:57,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:59:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash -69898550, now seen corresponding path program 8 times [2023-08-24 01:59:57,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:59:57,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328841701] [2023-08-24 01:59:57,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:59:57,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:59:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:59:57,906 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-24 01:59:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:59:57,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328841701] [2023-08-24 01:59:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328841701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:59:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:59:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 01:59:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786967103] [2023-08-24 01:59:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:59:57,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 01:59:57,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:59:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 01:59:57,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 01:59:57,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 01:59:57,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 555 transitions, 8270 flow. Second operand has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 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-24 01:59:57,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:59:57,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 01:59:57,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:01:13,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][248], [Black: 309#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), Black: 315#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 313#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 251#true, 157#L183-1true, 304#(<= (+ ~s~0 4) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 275#(<= (+ 3 ~s~0) ~t~0), 211#true, Black: 336#(and (<= (+ 3 ~s~0) ~m6~0) (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), Black: 338#(and (<= (+ 3 ~s~0) ~m6~0) (<= (+ 3 ~s~0) ~t~0)), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), 37#thread2EXITtrue, Black: 274#(<= (+ 2 ~s~0) ~t~0), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, 329#(<= (+ 3 ~s~0) ~t~0), 347#(<= (+ 2 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 129#L93true, 238#true, Black: 303#(<= (+ 3 ~s~0) ~t~0), Black: 302#(<= (+ 2 ~s~0) ~t~0), Black: 301#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 02:01:13,538 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 02:01:13,538 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 02:01:13,538 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 02:01:13,538 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 02:01:14,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][248], [Black: 309#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), 113#L183-2true, Black: 315#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 313#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 251#true, 304#(<= (+ ~s~0 4) ~t~0), Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 275#(<= (+ 3 ~s~0) ~t~0), 211#true, Black: 336#(and (<= (+ 3 ~s~0) ~m6~0) (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), Black: 338#(and (<= (+ 3 ~s~0) ~m6~0) (<= (+ 3 ~s~0) ~t~0)), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 274#(<= (+ 2 ~s~0) ~t~0), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, 329#(<= (+ 3 ~s~0) ~t~0), 347#(<= (+ 2 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 129#L93true, 238#true, Black: 303#(<= (+ 3 ~s~0) ~t~0), Black: 302#(<= (+ 2 ~s~0) ~t~0), Black: 301#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 02:01:14,625 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 02:01:14,626 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 02:01:14,626 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 02:01:14,626 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 02:01:15,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][248], [Black: 309#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), Black: 315#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 313#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 251#true, 79#L184-1true, Black: 255#(and (<= 1 ~t~0) (= ~s~0 0)), 304#(<= (+ ~s~0 4) ~t~0), Black: 254#(and (= ~m1~0 0) (<= 1 ~t~0) (= ~s~0 0)), Black: 263#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 261#(and (<= 2 ~m4~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 275#(<= (+ 3 ~s~0) ~t~0), 211#true, Black: 336#(and (<= (+ 3 ~s~0) ~m6~0) (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0)), Black: 338#(and (<= (+ 3 ~s~0) ~m6~0) (<= (+ 3 ~s~0) ~t~0)), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 216#(= ~b~0 (* (div ~b~0 256) 256)), 72#L150true, Black: 278#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 288#(and (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 282#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 274#(<= (+ 2 ~s~0) ~t~0), Black: 286#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 284#(and (<= (+ 2 ~s~0) ~t~0) (< ~s~0 ~m5~0)), Black: 273#(<= (+ ~s~0 1) ~t~0), Black: 225#(= ~t~0 ~s~0), Black: 227#(<= (+ ~s~0 1) ~t~0), Black: 230#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 232#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 150#L112true, 329#(<= (+ 3 ~s~0) ~t~0), 347#(<= (+ 2 ~s~0) ~t~0), Black: 247#(and (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), Black: 245#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m3~0) (= ~s~0 0)), 129#L93true, 238#true, Black: 303#(<= (+ 3 ~s~0) ~t~0), Black: 302#(<= (+ 2 ~s~0) ~t~0), Black: 301#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 02:01:15,048 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 02:01:15,048 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 02:01:15,048 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 02:01:15,049 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 02:01:15,993 INFO L124 PetriNetUnfolderBase]: 382312/541497 cut-off events. [2023-08-24 02:01:15,993 INFO L125 PetriNetUnfolderBase]: For 3300727/3428876 co-relation queries the response was YES. [2023-08-24 02:01:20,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677625 conditions, 541497 events. 382312/541497 cut-off events. For 3300727/3428876 co-relation queries the response was YES. Maximal size of possible extension queue 22542. Compared 4708459 event pairs, 72288 based on Foata normal form. 21836/533827 useless extension candidates. Maximal degree in co-relation 1649460. Up to 265297 conditions per place. [2023-08-24 02:01:23,072 INFO L140 encePairwiseOnDemand]: 303/317 looper letters, 334 selfloop transitions, 476 changer transitions 10/848 dead transitions. [2023-08-24 02:01:23,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 848 transitions, 13081 flow [2023-08-24 02:01:23,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 02:01:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 02:01:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1541 transitions. [2023-08-24 02:01:23,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401331931300386 [2023-08-24 02:01:23,075 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1541 transitions. [2023-08-24 02:01:23,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1541 transitions. [2023-08-24 02:01:23,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:01:23,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1541 transitions. [2023-08-24 02:01:23,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 171.22222222222223) internal successors, (1541), 9 states have internal predecessors, (1541), 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-24 02:01:23,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 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-24 02:01:23,082 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 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-24 02:01:23,082 INFO L175 Difference]: Start difference. First operand has 136 places, 555 transitions, 8270 flow. Second operand 9 states and 1541 transitions. [2023-08-24 02:01:23,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 848 transitions, 13081 flow [2023-08-24 02:05:55,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 848 transitions, 12289 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-24 02:05:55,353 INFO L231 Difference]: Finished difference. Result has 140 places, 709 transitions, 11824 flow [2023-08-24 02:05:55,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=7611, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11824, PETRI_PLACES=140, PETRI_TRANSITIONS=709} [2023-08-24 02:05:55,354 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 71 predicate places. [2023-08-24 02:05:55,354 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 709 transitions, 11824 flow [2023-08-24 02:05:55,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 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-24 02:05:55,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:05:55,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:05:55,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 02:05:55,355 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 02:05:55,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:05:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1189794366, now seen corresponding path program 9 times [2023-08-24 02:05:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:05:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590189432] [2023-08-24 02:05:55,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:05:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:05:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:05:55,645 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-24 02:05:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:05:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590189432] [2023-08-24 02:05:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590189432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:05:55,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:05:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 02:05:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935004123] [2023-08-24 02:05:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:05:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 02:05:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:05:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 02:05:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-24 02:05:55,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 317 [2023-08-24 02:05:55,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 709 transitions, 11824 flow. Second operand has 10 states, 10 states have (on average 153.3) internal successors, (1533), 10 states have internal predecessors, (1533), 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-24 02:05:55,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:05:55,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 317 [2023-08-24 02:05:55,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand