/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/03_incdec.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:15:15,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:15:15,363 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 11:15:15,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:15:15,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:15:15,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:15:15,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:15:15,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:15:15,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:15:15,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:15:15,381 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:15:15,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:15:15,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:15:15,382 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:15:15,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:15:15,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:15:15,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:15:15,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:15:15,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:15:15,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:15:15,383 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:15:15,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:15:15,387 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:15:15,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:15:15,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:15:15,388 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:15:15,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:15:15,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:15:15,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:15:15,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:15:15,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:15:15,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:15:15,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:15:15,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:15:15,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:15:15,390 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:15:15,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:15:15,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:15:15,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:15:15,643 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:15:15,643 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:15:15,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/03_incdec.i [2023-08-24 11:15:16,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:15:16,708 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:15:16,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/03_incdec.i [2023-08-24 11:15:16,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5513cce5/017cad2ad3c14aff9583db6a9e0671c9/FLAGe4d69007a [2023-08-24 11:15:17,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5513cce5/017cad2ad3c14aff9583db6a9e0671c9 [2023-08-24 11:15:17,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:15:17,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:15:17,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:15:17,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:15:17,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:15:17,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17, skipping insertion in model container [2023-08-24 11:15:17,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:15:17,349 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/03_incdec.i[30534,30547] [2023-08-24 11:15:17,353 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/03_incdec.i[30928,30941] [2023-08-24 11:15:17,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:15:17,367 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:15:17,385 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-24 11:15:17,389 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-24 11:15:17,399 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [689] [2023-08-24 11:15:17,400 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [700] [2023-08-24 11:15:17,400 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [701] [2023-08-24 11:15:17,400 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [702] [2023-08-24 11:15:17,401 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [703] [2023-08-24 11:15:17,402 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/03_incdec.i[30534,30547] [2023-08-24 11:15:17,402 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [716] [2023-08-24 11:15:17,402 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [717] [2023-08-24 11:15:17,403 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/03_incdec.i[30928,30941] [2023-08-24 11:15:17,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:15:17,446 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:15:17,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17 WrapperNode [2023-08-24 11:15:17,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:15:17,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:15:17,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:15:17,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:15:17,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,495 INFO L138 Inliner]: procedures = 172, calls = 24, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 134 [2023-08-24 11:15:17,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:15:17,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:15:17,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:15:17,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:15:17,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:15:17,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:15:17,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:15:17,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:15:17,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (1/1) ... [2023-08-24 11:15:17,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:15:17,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:15:17,558 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 11:15:17,572 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 11:15:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-24 11:15:17,585 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-24 11:15:17,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:15:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:15:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:15:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:15:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:15:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:15:17,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:15:17,587 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 11:15:17,679 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:15:17,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:15:17,871 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:15:17,957 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:15:17,958 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-24 11:15:17,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:15:17 BoogieIcfgContainer [2023-08-24 11:15:17,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:15:17,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:15:17,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:15:17,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:15:17,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:15:17" (1/3) ... [2023-08-24 11:15:17,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f176cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:15:17, skipping insertion in model container [2023-08-24 11:15:17,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:15:17" (2/3) ... [2023-08-24 11:15:17,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f176cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:15:17, skipping insertion in model container [2023-08-24 11:15:17,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:15:17" (3/3) ... [2023-08-24 11:15:17,967 INFO L112 eAbstractionObserver]: Analyzing ICFG 03_incdec.i [2023-08-24 11:15:17,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:15:17,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:15:17,979 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:15:18,030 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:15:18,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:18,100 INFO L124 PetriNetUnfolderBase]: 7/91 cut-off events. [2023-08-24 11:15:18,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:18,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 165 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-24 11:15:18,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:18,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:18,111 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:18,120 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:18,123 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:18,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:18,144 INFO L124 PetriNetUnfolderBase]: 7/91 cut-off events. [2023-08-24 11:15:18,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:18,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 165 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-24 11:15:18,147 INFO L119 LiptonReduction]: Number of co-enabled transitions 1378 [2023-08-24 11:15:22,094 INFO L134 LiptonReduction]: Checked pairs total: 1359 [2023-08-24 11:15:22,094 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-24 11:15:22,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:15:22,106 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;@43335d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:15:22,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 11:15:22,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:15:22,108 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-24 11:15:22,108 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:22,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:22,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 11:15:22,109 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:15:22,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash 17159279, now seen corresponding path program 1 times [2023-08-24 11:15:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842843048] [2023-08-24 11:15:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:22,230 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 11:15:22,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842843048] [2023-08-24 11:15:22,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842843048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:22,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:22,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:15:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93750198] [2023-08-24 11:15:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:22,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:15:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:15:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:15:22,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 186 [2023-08-24 11:15:22,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 9 transitions, 23 flow. Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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 11:15:22,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:22,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 186 [2023-08-24 11:15:22,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:22,281 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-08-24 11:15:22,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:22,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2023-08-24 11:15:22,282 INFO L140 encePairwiseOnDemand]: 183/186 looper letters, 0 selfloop transitions, 0 changer transitions 6/6 dead transitions. [2023-08-24 11:15:22,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 27 flow [2023-08-24 11:15:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:15:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:15:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2023-08-24 11:15:22,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2023-08-24 11:15:22,294 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 136 transitions. [2023-08-24 11:15:22,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 136 transitions. [2023-08-24 11:15:22,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:22,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 136 transitions. [2023-08-24 11:15:22,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:22,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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 11:15:22,304 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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 11:15:22,305 INFO L175 Difference]: Start difference. First operand has 12 places, 9 transitions, 23 flow. Second operand 2 states and 136 transitions. [2023-08-24 11:15:22,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 27 flow [2023-08-24 11:15:22,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:22,308 INFO L231 Difference]: Finished difference. Result has 10 places, 0 transitions, 0 flow [2023-08-24 11:15:22,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=10, PETRI_TRANSITIONS=0} [2023-08-24 11:15:22,312 INFO L281 CegarLoopForPetriNet]: 12 programPoint places, -2 predicate places. [2023-08-24 11:15:22,312 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 0 transitions, 0 flow [2023-08-24 11:15:22,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 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 11:15:22,314 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 11:15:22,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 11:15:22,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 11:15:22,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 11:15:22,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:15:22,315 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:15:22,326 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-24 11:15:22,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:22,337 INFO L124 PetriNetUnfolderBase]: 7/91 cut-off events. [2023-08-24 11:15:22,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:22,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 165 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-24 11:15:22,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:22,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:22,338 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:22,338 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:22,339 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:22,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 167 flow [2023-08-24 11:15:22,346 INFO L124 PetriNetUnfolderBase]: 7/91 cut-off events. [2023-08-24 11:15:22,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:22,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 165 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-24 11:15:22,347 INFO L119 LiptonReduction]: Number of co-enabled transitions 1378 [2023-08-24 11:15:25,785 INFO L134 LiptonReduction]: Checked pairs total: 1379 [2023-08-24 11:15:25,786 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-24 11:15:25,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:15:25,788 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;@43335d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:15:25,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:15:25,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:15:25,790 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-08-24 11:15:25,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:15:25,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:25,790 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-24 11:15:25,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:15:25,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1648966836, now seen corresponding path program 1 times [2023-08-24 11:15:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:25,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531249624] [2023-08-24 11:15:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:15:25,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:15:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:15:25,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:15:25,835 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:15:25,835 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:15:25,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:15:25,835 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:15:25,835 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:15:25,836 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:15:25,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 11:15:25,850 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:15:25,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:25,871 INFO L124 PetriNetUnfolderBase]: 13/157 cut-off events. [2023-08-24 11:15:25,871 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:25,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 13/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 474 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 6 conditions per place. [2023-08-24 11:15:25,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:25,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:25,874 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:25,874 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:25,874 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:25,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:25,887 INFO L124 PetriNetUnfolderBase]: 13/157 cut-off events. [2023-08-24 11:15:25,888 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:25,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 13/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 474 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 6 conditions per place. [2023-08-24 11:15:25,891 INFO L119 LiptonReduction]: Number of co-enabled transitions 8480 [2023-08-24 11:15:27,909 INFO L134 LiptonReduction]: Checked pairs total: 31217 [2023-08-24 11:15:27,909 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-24 11:15:27,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:15:27,911 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;@43335d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:15:27,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 11:15:27,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:15:27,914 INFO L124 PetriNetUnfolderBase]: 3/43 cut-off events. [2023-08-24 11:15:27,915 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:27,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:27,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:27,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:27,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1911115954, now seen corresponding path program 1 times [2023-08-24 11:15:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602475473] [2023-08-24 11:15:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:27,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:28,060 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 11:15:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602475473] [2023-08-24 11:15:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602475473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:28,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:15:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864272503] [2023-08-24 11:15:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:28,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:15:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:15:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:15:28,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 240 [2023-08-24 11:15:28,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 62 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 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 11:15:28,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:28,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 240 [2023-08-24 11:15:28,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:28,302 INFO L124 PetriNetUnfolderBase]: 915/1641 cut-off events. [2023-08-24 11:15:28,302 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-08-24 11:15:28,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 1641 events. 915/1641 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10189 event pairs, 261 based on Foata normal form. 12/1413 useless extension candidates. Maximal degree in co-relation 2360. Up to 497 conditions per place. [2023-08-24 11:15:28,309 INFO L140 encePairwiseOnDemand]: 224/240 looper letters, 76 selfloop transitions, 10 changer transitions 9/102 dead transitions. [2023-08-24 11:15:28,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 102 transitions, 416 flow [2023-08-24 11:15:28,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:15:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:15:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2023-08-24 11:15:28,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3909722222222222 [2023-08-24 11:15:28,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 563 transitions. [2023-08-24 11:15:28,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 563 transitions. [2023-08-24 11:15:28,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:28,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 563 transitions. [2023-08-24 11:15:28,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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 11:15:28,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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 11:15:28,317 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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 11:15:28,317 INFO L175 Difference]: Start difference. First operand has 58 places, 62 transitions, 136 flow. Second operand 6 states and 563 transitions. [2023-08-24 11:15:28,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 102 transitions, 416 flow [2023-08-24 11:15:28,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 414 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:28,320 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 176 flow [2023-08-24 11:15:28,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-24 11:15:28,320 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-08-24 11:15:28,320 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 176 flow [2023-08-24 11:15:28,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 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 11:15:28,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:28,321 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:28,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:15:28,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:28,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1281007343, now seen corresponding path program 1 times [2023-08-24 11:15:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:28,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477118916] [2023-08-24 11:15:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:28,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477118916] [2023-08-24 11:15:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477118916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:28,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:28,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:15:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535045164] [2023-08-24 11:15:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:28,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:15:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:28,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:15:28,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:15:28,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 240 [2023-08-24 11:15:28,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 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 11:15:28,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:28,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 240 [2023-08-24 11:15:28,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:28,678 INFO L124 PetriNetUnfolderBase]: 875/1620 cut-off events. [2023-08-24 11:15:28,678 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-24 11:15:28,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3526 conditions, 1620 events. 875/1620 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10349 event pairs, 243 based on Foata normal form. 10/1510 useless extension candidates. Maximal degree in co-relation 2006. Up to 519 conditions per place. [2023-08-24 11:15:28,684 INFO L140 encePairwiseOnDemand]: 232/240 looper letters, 69 selfloop transitions, 12 changer transitions 9/97 dead transitions. [2023-08-24 11:15:28,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 97 transitions, 457 flow [2023-08-24 11:15:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:15:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:15:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-08-24 11:15:28,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2023-08-24 11:15:28,685 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-08-24 11:15:28,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-08-24 11:15:28,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:28,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-08-24 11:15:28,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 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 11:15:28,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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 11:15:28,689 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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 11:15:28,689 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 176 flow. Second operand 6 states and 540 transitions. [2023-08-24 11:15:28,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 97 transitions, 457 flow [2023-08-24 11:15:28,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:28,697 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 225 flow [2023-08-24 11:15:28,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-08-24 11:15:28,698 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2023-08-24 11:15:28,698 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 225 flow [2023-08-24 11:15:28,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 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 11:15:28,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:28,699 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:28,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:15:28,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:28,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1116333369, now seen corresponding path program 1 times [2023-08-24 11:15:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:28,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440739688] [2023-08-24 11:15:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440739688] [2023-08-24 11:15:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440739688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:28,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:15:28,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519441495] [2023-08-24 11:15:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:28,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:15:28,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:28,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:15:28,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:15:28,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 240 [2023-08-24 11:15:28,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 11:15:28,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:28,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 240 [2023-08-24 11:15:28,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:28,836 INFO L124 PetriNetUnfolderBase]: 518/1070 cut-off events. [2023-08-24 11:15:28,836 INFO L125 PetriNetUnfolderBase]: For 266/284 co-relation queries the response was YES. [2023-08-24 11:15:28,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 1070 events. 518/1070 cut-off events. For 266/284 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6989 event pairs, 368 based on Foata normal form. 20/1038 useless extension candidates. Maximal degree in co-relation 1447. Up to 711 conditions per place. [2023-08-24 11:15:28,840 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 35 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2023-08-24 11:15:28,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 321 flow [2023-08-24 11:15:28,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:15:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:15:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-08-24 11:15:28,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2023-08-24 11:15:28,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-08-24 11:15:28,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-08-24 11:15:28,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:28,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-08-24 11:15:28,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 11:15:28,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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 11:15:28,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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 11:15:28,844 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 225 flow. Second operand 3 states and 327 transitions. [2023-08-24 11:15:28,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 321 flow [2023-08-24 11:15:28,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:28,848 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 231 flow [2023-08-24 11:15:28,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-08-24 11:15:28,850 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-08-24 11:15:28,850 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 231 flow [2023-08-24 11:15:28,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 11:15:28,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:28,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:28,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:15:28,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:28,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash -708953918, now seen corresponding path program 1 times [2023-08-24 11:15:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:28,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089554943] [2023-08-24 11:15:28,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:28,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089554943] [2023-08-24 11:15:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089554943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:15:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056371537] [2023-08-24 11:15:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:28,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:15:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:15:28,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:15:28,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 240 [2023-08-24 11:15:28,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 11:15:28,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:28,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 240 [2023-08-24 11:15:28,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:28,980 INFO L124 PetriNetUnfolderBase]: 453/960 cut-off events. [2023-08-24 11:15:28,980 INFO L125 PetriNetUnfolderBase]: For 373/373 co-relation queries the response was YES. [2023-08-24 11:15:28,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 960 events. 453/960 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6235 event pairs, 226 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1874. Up to 781 conditions per place. [2023-08-24 11:15:28,984 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 23 selfloop transitions, 2 changer transitions 18/61 dead transitions. [2023-08-24 11:15:28,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 322 flow [2023-08-24 11:15:28,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:15:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:15:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-24 11:15:28,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-08-24 11:15:28,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-24 11:15:28,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-24 11:15:28,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:28,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-24 11:15:28,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 11:15:28,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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 11:15:28,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 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 11:15:28,988 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 231 flow. Second operand 3 states and 324 transitions. [2023-08-24 11:15:28,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 322 flow [2023-08-24 11:15:28,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:15:28,991 INFO L231 Difference]: Finished difference. Result has 69 places, 39 transitions, 187 flow [2023-08-24 11:15:28,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=69, PETRI_TRANSITIONS=39} [2023-08-24 11:15:28,992 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2023-08-24 11:15:28,992 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 39 transitions, 187 flow [2023-08-24 11:15:28,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 11:15:28,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:28,993 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:28,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:15:28,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:28,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1363126712, now seen corresponding path program 1 times [2023-08-24 11:15:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691157826] [2023-08-24 11:15:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691157826] [2023-08-24 11:15:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691157826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:29,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:15:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348206350] [2023-08-24 11:15:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:29,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:15:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:15:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:15:29,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 240 [2023-08-24 11:15:29,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 39 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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 11:15:29,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:29,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 240 [2023-08-24 11:15:29,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:29,302 INFO L124 PetriNetUnfolderBase]: 728/1385 cut-off events. [2023-08-24 11:15:29,302 INFO L125 PetriNetUnfolderBase]: For 1140/1160 co-relation queries the response was YES. [2023-08-24 11:15:29,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3445 conditions, 1385 events. 728/1385 cut-off events. For 1140/1160 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8956 event pairs, 223 based on Foata normal form. 40/1421 useless extension candidates. Maximal degree in co-relation 3306. Up to 737 conditions per place. [2023-08-24 11:15:29,308 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 51 selfloop transitions, 15 changer transitions 2/75 dead transitions. [2023-08-24 11:15:29,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 449 flow [2023-08-24 11:15:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:15:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:15:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 571 transitions. [2023-08-24 11:15:29,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3398809523809524 [2023-08-24 11:15:29,310 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 571 transitions. [2023-08-24 11:15:29,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 571 transitions. [2023-08-24 11:15:29,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:29,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 571 transitions. [2023-08-24 11:15:29,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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 11:15:29,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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 11:15:29,313 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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 11:15:29,313 INFO L175 Difference]: Start difference. First operand has 69 places, 39 transitions, 187 flow. Second operand 7 states and 571 transitions. [2023-08-24 11:15:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 449 flow [2023-08-24 11:15:29,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:15:29,316 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 267 flow [2023-08-24 11:15:29,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-08-24 11:15:29,317 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2023-08-24 11:15:29,317 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 267 flow [2023-08-24 11:15:29,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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 11:15:29,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:29,317 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:29,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:15:29,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:29,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash 584427890, now seen corresponding path program 2 times [2023-08-24 11:15:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975344286] [2023-08-24 11:15:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:29,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975344286] [2023-08-24 11:15:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975344286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:29,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:29,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:15:29,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434568286] [2023-08-24 11:15:29,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:29,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:15:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:29,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:15:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:15:29,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 240 [2023-08-24 11:15:29,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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 11:15:29,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:29,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 240 [2023-08-24 11:15:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:29,630 INFO L124 PetriNetUnfolderBase]: 821/1597 cut-off events. [2023-08-24 11:15:29,630 INFO L125 PetriNetUnfolderBase]: For 2192/2212 co-relation queries the response was YES. [2023-08-24 11:15:29,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4221 conditions, 1597 events. 821/1597 cut-off events. For 2192/2212 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10991 event pairs, 335 based on Foata normal form. 36/1630 useless extension candidates. Maximal degree in co-relation 3858. Up to 765 conditions per place. [2023-08-24 11:15:29,637 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 52 selfloop transitions, 18 changer transitions 4/81 dead transitions. [2023-08-24 11:15:29,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 556 flow [2023-08-24 11:15:29,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:15:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:15:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 571 transitions. [2023-08-24 11:15:29,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3398809523809524 [2023-08-24 11:15:29,640 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 571 transitions. [2023-08-24 11:15:29,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 571 transitions. [2023-08-24 11:15:29,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:29,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 571 transitions. [2023-08-24 11:15:29,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 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 11:15:29,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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 11:15:29,643 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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 11:15:29,643 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 267 flow. Second operand 7 states and 571 transitions. [2023-08-24 11:15:29,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 556 flow [2023-08-24 11:15:29,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 520 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 11:15:29,648 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 349 flow [2023-08-24 11:15:29,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-08-24 11:15:29,649 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2023-08-24 11:15:29,649 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 349 flow [2023-08-24 11:15:29,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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 11:15:29,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:29,649 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:29,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:15:29,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:29,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1192496078, now seen corresponding path program 3 times [2023-08-24 11:15:29,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:29,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133161664] [2023-08-24 11:15:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:29,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:15:29,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133161664] [2023-08-24 11:15:29,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133161664] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:15:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560441433] [2023-08-24 11:15:29,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 11:15:29,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:29,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:15:29,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:15:29,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 11:15:29,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-24 11:15:29,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:15:29,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 11:15:29,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:15:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:15:29,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:15:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:29,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560441433] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 11:15:29,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 11:15:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 12 [2023-08-24 11:15:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351671247] [2023-08-24 11:15:29,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:29,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:15:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:15:29,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-08-24 11:15:29,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 240 [2023-08-24 11:15:29,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 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 11:15:29,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:29,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 240 [2023-08-24 11:15:29,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:30,046 INFO L124 PetriNetUnfolderBase]: 310/844 cut-off events. [2023-08-24 11:15:30,046 INFO L125 PetriNetUnfolderBase]: For 1271/1281 co-relation queries the response was YES. [2023-08-24 11:15:30,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 844 events. 310/844 cut-off events. For 1271/1281 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6135 event pairs, 72 based on Foata normal form. 50/876 useless extension candidates. Maximal degree in co-relation 1661. Up to 464 conditions per place. [2023-08-24 11:15:30,049 INFO L140 encePairwiseOnDemand]: 230/240 looper letters, 15 selfloop transitions, 12 changer transitions 22/66 dead transitions. [2023-08-24 11:15:30,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 463 flow [2023-08-24 11:15:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:15:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:15:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2023-08-24 11:15:30,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43020833333333336 [2023-08-24 11:15:30,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 413 transitions. [2023-08-24 11:15:30,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 413 transitions. [2023-08-24 11:15:30,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:30,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 413 transitions. [2023-08-24 11:15:30,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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 11:15:30,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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 11:15:30,055 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 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 11:15:30,056 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 349 flow. Second operand 4 states and 413 transitions. [2023-08-24 11:15:30,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 463 flow [2023-08-24 11:15:30,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 438 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 11:15:30,059 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 228 flow [2023-08-24 11:15:30,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2023-08-24 11:15:30,060 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-08-24 11:15:30,060 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 228 flow [2023-08-24 11:15:30,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 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 11:15:30,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:30,061 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:30,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 11:15:30,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:30,265 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:30,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1429769844, now seen corresponding path program 1 times [2023-08-24 11:15:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685099464] [2023-08-24 11:15:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:15:30,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:30,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685099464] [2023-08-24 11:15:30,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685099464] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:15:30,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144015080] [2023-08-24 11:15:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:30,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:15:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:15:30,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:15:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 11:15:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:30,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-24 11:15:30,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:15:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:15:30,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:15:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:15:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144015080] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:15:30,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:15:30,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-08-24 11:15:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411159458] [2023-08-24 11:15:30,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:15:30,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 11:15:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 11:15:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-08-24 11:15:30,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 240 [2023-08-24 11:15:30,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 228 flow. Second operand has 17 states, 17 states have (on average 71.82352941176471) internal successors, (1221), 17 states have internal predecessors, (1221), 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 11:15:30,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:30,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 240 [2023-08-24 11:15:30,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:31,004 INFO L124 PetriNetUnfolderBase]: 191/446 cut-off events. [2023-08-24 11:15:31,005 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2023-08-24 11:15:31,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 446 events. 191/446 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2486 event pairs, 29 based on Foata normal form. 12/457 useless extension candidates. Maximal degree in co-relation 1234. Up to 117 conditions per place. [2023-08-24 11:15:31,006 INFO L140 encePairwiseOnDemand]: 229/240 looper letters, 20 selfloop transitions, 6 changer transitions 58/89 dead transitions. [2023-08-24 11:15:31,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 573 flow [2023-08-24 11:15:31,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 11:15:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 11:15:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1043 transitions. [2023-08-24 11:15:31,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3104166666666667 [2023-08-24 11:15:31,009 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1043 transitions. [2023-08-24 11:15:31,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1043 transitions. [2023-08-24 11:15:31,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:31,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1043 transitions. [2023-08-24 11:15:31,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 74.5) internal successors, (1043), 14 states have internal predecessors, (1043), 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 11:15:31,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 240.0) internal successors, (3600), 15 states have internal predecessors, (3600), 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 11:15:31,015 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 240.0) internal successors, (3600), 15 states have internal predecessors, (3600), 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 11:15:31,015 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 228 flow. Second operand 14 states and 1043 transitions. [2023-08-24 11:15:31,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 573 flow [2023-08-24 11:15:31,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 536 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-08-24 11:15:31,017 INFO L231 Difference]: Finished difference. Result has 66 places, 26 transitions, 137 flow [2023-08-24 11:15:31,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=137, PETRI_PLACES=66, PETRI_TRANSITIONS=26} [2023-08-24 11:15:31,018 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-08-24 11:15:31,018 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 26 transitions, 137 flow [2023-08-24 11:15:31,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 71.82352941176471) internal successors, (1221), 17 states have internal predecessors, (1221), 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 11:15:31,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:31,018 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:31,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 11:15:31,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-24 11:15:31,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-24 11:15:31,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1949784975, now seen corresponding path program 1 times [2023-08-24 11:15:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:31,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299697312] [2023-08-24 11:15:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:31,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299697312] [2023-08-24 11:15:31,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299697312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:31,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:31,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:15:31,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130176215] [2023-08-24 11:15:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:31,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:15:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:15:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:15:31,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 240 [2023-08-24 11:15:31,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 26 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 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 11:15:31,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:31,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 240 [2023-08-24 11:15:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:31,399 INFO L124 PetriNetUnfolderBase]: 19/72 cut-off events. [2023-08-24 11:15:31,399 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-24 11:15:31,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 72 events. 19/72 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 0 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 208. Up to 30 conditions per place. [2023-08-24 11:15:31,400 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2023-08-24 11:15:31,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 30 transitions, 190 flow [2023-08-24 11:15:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:15:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:15:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 528 transitions. [2023-08-24 11:15:31,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2023-08-24 11:15:31,401 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 528 transitions. [2023-08-24 11:15:31,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 528 transitions. [2023-08-24 11:15:31,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:31,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 528 transitions. [2023-08-24 11:15:31,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 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 11:15:31,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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 11:15:31,405 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 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 11:15:31,405 INFO L175 Difference]: Start difference. First operand has 66 places, 26 transitions, 137 flow. Second operand 7 states and 528 transitions. [2023-08-24 11:15:31,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 30 transitions, 190 flow [2023-08-24 11:15:31,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 30 transitions, 154 flow, removed 3 selfloop flow, removed 16 redundant places. [2023-08-24 11:15:31,406 INFO L231 Difference]: Finished difference. Result has 43 places, 0 transitions, 0 flow [2023-08-24 11:15:31,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=43, PETRI_TRANSITIONS=0} [2023-08-24 11:15:31,407 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2023-08-24 11:15:31,407 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 0 transitions, 0 flow [2023-08-24 11:15:31,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 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 11:15:31,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 11:15:31,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 11:15:31,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-24 11:15:31,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-08-24 11:15:31,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-08-24 11:15:31,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 11:15:31,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:15:31,408 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:31,408 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-24 11:15:31,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:31,419 INFO L124 PetriNetUnfolderBase]: 13/157 cut-off events. [2023-08-24 11:15:31,419 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:31,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 13/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 474 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 6 conditions per place. [2023-08-24 11:15:31,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:31,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:31,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:31,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:31,421 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:31,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 135 transitions, 282 flow [2023-08-24 11:15:31,429 INFO L124 PetriNetUnfolderBase]: 13/157 cut-off events. [2023-08-24 11:15:31,429 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:31,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 13/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 474 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 6 conditions per place. [2023-08-24 11:15:31,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 8480 [2023-08-24 11:15:33,312 INFO L134 LiptonReduction]: Checked pairs total: 31874 [2023-08-24 11:15:33,312 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-24 11:15:33,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:15:33,313 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;@43335d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:15:33,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:15:33,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:15:33,316 INFO L124 PetriNetUnfolderBase]: 5/49 cut-off events. [2023-08-24 11:15:33,316 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:15:33,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:33,316 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-24 11:15:33,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:15:33,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1810043064, now seen corresponding path program 1 times [2023-08-24 11:15:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241467459] [2023-08-24 11:15:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:15:33,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:15:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:15:33,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:15:33,327 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:15:33,327 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:15:33,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:15:33,327 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:15:33,328 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:15:33,328 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:15:33,328 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-24 11:15:33,352 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:15:33,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 189 transitions, 399 flow [2023-08-24 11:15:33,366 INFO L124 PetriNetUnfolderBase]: 19/223 cut-off events. [2023-08-24 11:15:33,366 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:15:33,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 223 events. 19/223 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 789 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-24 11:15:33,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 189 transitions, 399 flow [2023-08-24 11:15:33,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 189 transitions, 399 flow [2023-08-24 11:15:33,368 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:15:33,368 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 189 transitions, 399 flow [2023-08-24 11:15:33,369 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 189 transitions, 399 flow [2023-08-24 11:15:33,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 189 transitions, 399 flow [2023-08-24 11:15:33,381 INFO L124 PetriNetUnfolderBase]: 19/223 cut-off events. [2023-08-24 11:15:33,381 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:15:33,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 223 events. 19/223 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 789 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-24 11:15:33,389 INFO L119 LiptonReduction]: Number of co-enabled transitions 21306 [2023-08-24 11:15:35,923 INFO L134 LiptonReduction]: Checked pairs total: 84802 [2023-08-24 11:15:35,923 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-08-24 11:15:35,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:15:35,924 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;@43335d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:15:35,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-08-24 11:15:35,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:15:35,926 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2023-08-24 11:15:35,926 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 11:15:35,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:35,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:35,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:15:35,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1921087803, now seen corresponding path program 1 times [2023-08-24 11:15:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:35,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417809486] [2023-08-24 11:15:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:35,961 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 11:15:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:35,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417809486] [2023-08-24 11:15:35,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417809486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:35,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:35,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:15:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40752585] [2023-08-24 11:15:35,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:35,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:15:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:15:35,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:15:35,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 339 [2023-08-24 11:15:35,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:35,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:35,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 339 [2023-08-24 11:15:35,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:37,976 INFO L124 PetriNetUnfolderBase]: 30296/42821 cut-off events. [2023-08-24 11:15:37,977 INFO L125 PetriNetUnfolderBase]: For 1681/1681 co-relation queries the response was YES. [2023-08-24 11:15:38,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86054 conditions, 42821 events. 30296/42821 cut-off events. For 1681/1681 co-relation queries the response was YES. Maximal size of possible extension queue 1997. Compared 293413 event pairs, 13118 based on Foata normal form. 0/34839 useless extension candidates. Maximal degree in co-relation 14115. Up to 39627 conditions per place. [2023-08-24 11:15:38,170 INFO L140 encePairwiseOnDemand]: 323/339 looper letters, 91 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2023-08-24 11:15:38,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 431 flow [2023-08-24 11:15:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:15:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:15:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-24 11:15:38,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415929203539823 [2023-08-24 11:15:38,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-24 11:15:38,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-24 11:15:38,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:38,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-24 11:15:38,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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 11:15:38,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 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 11:15:38,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 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 11:15:38,174 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 203 flow. Second operand 3 states and 423 transitions. [2023-08-24 11:15:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 431 flow [2023-08-24 11:15:38,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 423 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:38,177 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 211 flow [2023-08-24 11:15:38,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2023-08-24 11:15:38,178 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2023-08-24 11:15:38,178 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 211 flow [2023-08-24 11:15:38,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:38,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:38,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:38,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:15:38,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:15:38,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1349051883, now seen corresponding path program 1 times [2023-08-24 11:15:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:38,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118563300] [2023-08-24 11:15:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:38,254 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 11:15:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118563300] [2023-08-24 11:15:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118563300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:38,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:38,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:15:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172537791] [2023-08-24 11:15:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:38,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:15:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:15:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:15:38,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 339 [2023-08-24 11:15:38,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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 11:15:38,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:38,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 339 [2023-08-24 11:15:38,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:41,165 INFO L124 PetriNetUnfolderBase]: 40997/58515 cut-off events. [2023-08-24 11:15:41,165 INFO L125 PetriNetUnfolderBase]: For 5522/5522 co-relation queries the response was YES. [2023-08-24 11:15:41,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122686 conditions, 58515 events. 40997/58515 cut-off events. For 5522/5522 co-relation queries the response was YES. Maximal size of possible extension queue 3053. Compared 432080 event pairs, 13203 based on Foata normal form. 310/51612 useless extension candidates. Maximal degree in co-relation 89481. Up to 25259 conditions per place. [2023-08-24 11:15:41,414 INFO L140 encePairwiseOnDemand]: 328/339 looper letters, 198 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2023-08-24 11:15:41,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 221 transitions, 973 flow [2023-08-24 11:15:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:15:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:15:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2023-08-24 11:15:41,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40658800393313665 [2023-08-24 11:15:41,417 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2023-08-24 11:15:41,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2023-08-24 11:15:41,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:41,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2023-08-24 11:15:41,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 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 11:15:41,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 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 11:15:41,421 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 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 11:15:41,421 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 211 flow. Second operand 6 states and 827 transitions. [2023-08-24 11:15:41,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 221 transitions, 973 flow [2023-08-24 11:15:41,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 221 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:15:41,426 INFO L231 Difference]: Finished difference. Result has 87 places, 92 transitions, 296 flow [2023-08-24 11:15:41,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2023-08-24 11:15:41,426 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2023-08-24 11:15:41,426 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 296 flow [2023-08-24 11:15:41,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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 11:15:41,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:41,427 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:41,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:15:41,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:15:41,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1640946625, now seen corresponding path program 1 times [2023-08-24 11:15:41,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:41,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967737217] [2023-08-24 11:15:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:41,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:41,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:41,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967737217] [2023-08-24 11:15:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967737217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:41,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:41,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:15:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194145325] [2023-08-24 11:15:41,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:41,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:15:41,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:15:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:15:41,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 339 [2023-08-24 11:15:41,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 92 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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 11:15:41,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:41,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 339 [2023-08-24 11:15:41,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:45,756 INFO L124 PetriNetUnfolderBase]: 52996/76376 cut-off events. [2023-08-24 11:15:45,757 INFO L125 PetriNetUnfolderBase]: For 21680/21680 co-relation queries the response was YES. [2023-08-24 11:15:45,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169230 conditions, 76376 events. 52996/76376 cut-off events. For 21680/21680 co-relation queries the response was YES. Maximal size of possible extension queue 4205. Compared 596463 event pairs, 18697 based on Foata normal form. 330/69809 useless extension candidates. Maximal degree in co-relation 75087. Up to 32710 conditions per place. [2023-08-24 11:15:46,127 INFO L140 encePairwiseOnDemand]: 328/339 looper letters, 205 selfloop transitions, 19 changer transitions 0/233 dead transitions. [2023-08-24 11:15:46,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 233 transitions, 1161 flow [2023-08-24 11:15:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:15:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:15:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-08-24 11:15:46,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4060963618485742 [2023-08-24 11:15:46,130 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-08-24 11:15:46,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-08-24 11:15:46,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:46,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-08-24 11:15:46,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 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 11:15:46,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 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 11:15:46,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 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 11:15:46,134 INFO L175 Difference]: Start difference. First operand has 87 places, 92 transitions, 296 flow. Second operand 6 states and 826 transitions. [2023-08-24 11:15:46,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 233 transitions, 1161 flow [2023-08-24 11:15:46,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 233 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:15:46,156 INFO L231 Difference]: Finished difference. Result has 93 places, 104 transitions, 432 flow [2023-08-24 11:15:46,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=93, PETRI_TRANSITIONS=104} [2023-08-24 11:15:46,157 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2023-08-24 11:15:46,157 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 104 transitions, 432 flow [2023-08-24 11:15:46,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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 11:15:46,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:46,157 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:46,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 11:15:46,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:15:46,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1929602686, now seen corresponding path program 1 times [2023-08-24 11:15:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:46,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244425219] [2023-08-24 11:15:46,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:15:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244425219] [2023-08-24 11:15:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244425219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:46,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:15:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134321012] [2023-08-24 11:15:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:46,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:15:46,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:15:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:15:46,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 339 [2023-08-24 11:15:46,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 104 transitions, 432 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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 11:15:46,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:46,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 339 [2023-08-24 11:15:46,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:51,819 INFO L124 PetriNetUnfolderBase]: 65067/94852 cut-off events. [2023-08-24 11:15:51,819 INFO L125 PetriNetUnfolderBase]: For 48393/48411 co-relation queries the response was YES. [2023-08-24 11:15:52,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220357 conditions, 94852 events. 65067/94852 cut-off events. For 48393/48411 co-relation queries the response was YES. Maximal size of possible extension queue 5396. Compared 779204 event pairs, 23097 based on Foata normal form. 340/90062 useless extension candidates. Maximal degree in co-relation 104939. Up to 40055 conditions per place. [2023-08-24 11:15:52,251 INFO L140 encePairwiseOnDemand]: 328/339 looper letters, 214 selfloop transitions, 25 changer transitions 0/248 dead transitions. [2023-08-24 11:15:52,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 248 transitions, 1434 flow [2023-08-24 11:15:52,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:15:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:15:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 823 transitions. [2023-08-24 11:15:52,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40462143559488695 [2023-08-24 11:15:52,254 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 823 transitions. [2023-08-24 11:15:52,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 823 transitions. [2023-08-24 11:15:52,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:52,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 823 transitions. [2023-08-24 11:15:52,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 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 11:15:52,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 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 11:15:52,258 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 339.0) internal successors, (2373), 7 states have internal predecessors, (2373), 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 11:15:52,258 INFO L175 Difference]: Start difference. First operand has 93 places, 104 transitions, 432 flow. Second operand 6 states and 823 transitions. [2023-08-24 11:15:52,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 248 transitions, 1434 flow [2023-08-24 11:15:52,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 248 transitions, 1434 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:52,299 INFO L231 Difference]: Finished difference. Result has 100 places, 119 transitions, 644 flow [2023-08-24 11:15:52,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=100, PETRI_TRANSITIONS=119} [2023-08-24 11:15:52,300 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2023-08-24 11:15:52,300 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 119 transitions, 644 flow [2023-08-24 11:15:52,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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 11:15:52,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:52,300 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:52,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 11:15:52,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:15:52,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:52,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2021240983, now seen corresponding path program 1 times [2023-08-24 11:15:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:52,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308676470] [2023-08-24 11:15:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:52,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308676470] [2023-08-24 11:15:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308676470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:52,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:15:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259607882] [2023-08-24 11:15:52,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:52,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:15:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:15:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:15:52,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 339 [2023-08-24 11:15:52,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 119 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 11:15:52,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:52,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 339 [2023-08-24 11:15:52,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:55,962 INFO L124 PetriNetUnfolderBase]: 37369/58824 cut-off events. [2023-08-24 11:15:55,962 INFO L125 PetriNetUnfolderBase]: For 19993/21584 co-relation queries the response was YES. [2023-08-24 11:15:56,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127694 conditions, 58824 events. 37369/58824 cut-off events. For 19993/21584 co-relation queries the response was YES. Maximal size of possible extension queue 3831. Compared 527838 event pairs, 20753 based on Foata normal form. 2420/58765 useless extension candidates. Maximal degree in co-relation 86536. Up to 31919 conditions per place. [2023-08-24 11:15:56,272 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 77 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2023-08-24 11:15:56,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 148 transitions, 876 flow [2023-08-24 11:15:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:15:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:15:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-24 11:15:56,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46804326450344147 [2023-08-24 11:15:56,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-24 11:15:56,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-24 11:15:56,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:56,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-24 11:15:56,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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 11:15:56,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 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 11:15:56,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 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 11:15:56,277 INFO L175 Difference]: Start difference. First operand has 100 places, 119 transitions, 644 flow. Second operand 3 states and 476 transitions. [2023-08-24 11:15:56,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 148 transitions, 876 flow [2023-08-24 11:15:56,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 148 transitions, 876 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:15:56,300 INFO L231 Difference]: Finished difference. Result has 104 places, 122 transitions, 674 flow [2023-08-24 11:15:56,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=104, PETRI_TRANSITIONS=122} [2023-08-24 11:15:56,301 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2023-08-24 11:15:56,301 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 122 transitions, 674 flow [2023-08-24 11:15:56,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 11:15:56,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:56,301 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:56,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 11:15:56,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:15:56,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1297864425, now seen corresponding path program 1 times [2023-08-24 11:15:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15264664] [2023-08-24 11:15:56,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:56,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15264664] [2023-08-24 11:15:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15264664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:56,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:56,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:15:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875063918] [2023-08-24 11:15:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:56,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:15:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:15:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:15:56,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 339 [2023-08-24 11:15:56,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 122 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 11:15:56,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:56,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 339 [2023-08-24 11:15:56,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:15:57,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, 104#thr1EXITtrue, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, 116#L711-1true, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 101#L738-5true, thr1Thread2of3ForFork0InUse, 140#L725-1true, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 232#(= ~inc_flag~0 1), 212#true]) [2023-08-24 11:15:57,484 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 11:15:57,484 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 11:15:57,484 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:57,484 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 11:15:57,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [8#L711-1true, Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 101#L738-5true, thr1Thread2of3ForFork0InUse, 140#L725-1true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 212#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:57,502 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 11:15:57,502 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 11:15:57,502 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 11:15:57,502 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:57,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1270] L725-->L725-1: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_124, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][91], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 43#L725-1true, 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 173#L711-1true, thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 101#L738-5true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:57,521 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-24 11:15:57,521 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 11:15:57,521 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 11:15:57,521 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:57,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, 73#L712true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 104#thr1EXITtrue, 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 140#L725-1true, 101#L738-5true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 232#(= ~inc_flag~0 1), Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 212#true]) [2023-08-24 11:15:57,803 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:15:57,803 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:15:57,803 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 11:15:57,803 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 11:15:57,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 14#L712true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 101#L738-5true, thr1Thread2of3ForFork0InUse, 140#L725-1true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 212#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:57,816 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:15:57,816 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 11:15:57,816 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:15:57,816 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 11:15:57,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1270] L725-->L725-1: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_124, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][91], [83#L712true, Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 43#L725-1true, 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 101#L738-5true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:57,833 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:15:57,833 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 11:15:57,833 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:15:57,833 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 11:15:58,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, 29#L738-4true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 104#thr1EXITtrue, 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, 116#L711-1true, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 140#L725-1true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 212#true, 232#(= ~inc_flag~0 1), Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0))]) [2023-08-24 11:15:58,084 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,084 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [8#L711-1true, Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 29#L738-4true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 140#L725-1true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1), Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 212#true]) [2023-08-24 11:15:58,099 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,099 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,099 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,099 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1270] L725-->L725-1: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_124, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][91], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 29#L738-4true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 43#L725-1true, 173#L711-1true, 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,116 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,117 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,117 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,117 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 104#thr1EXITtrue, 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 101#L738-5true, thr1Thread2of3ForFork0InUse, 140#L725-1true, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 232#(= ~inc_flag~0 1), 212#true]) [2023-08-24 11:15:58,188 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,188 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,188 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,188 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 104#thr1EXITtrue, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 140#L725-1true, 101#L738-5true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1), Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 212#true]) [2023-08-24 11:15:58,204 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,204 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,204 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,204 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1270] L725-->L725-1: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_124, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][91], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 43#L725-1true, 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), 101#L738-5true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 19#thr1EXITtrue, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,224 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,224 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,224 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:15:58,224 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-24 11:15:58,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, 29#L738-4true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 73#L712true, 104#thr1EXITtrue, 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread2of3ForFork0InUse, 140#L725-1true, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 212#true, Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,289 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:15:58,289 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:15:58,289 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:15:58,289 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:15:58,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 29#L738-4true, 14#L712true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread2of3ForFork0InUse, 140#L725-1true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 212#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,307 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:15:58,307 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:15:58,307 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:15:58,307 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:15:58,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1270] L725-->L725-1: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_124, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][91], [83#L712true, Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 29#L738-4true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 43#L725-1true, 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,324 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:15:58,324 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:15:58,324 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:15:58,324 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-24 11:15:58,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, 29#L738-4true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 104#thr1EXITtrue, 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread2of3ForFork0InUse, 140#L725-1true, 200#true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 212#true, Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,847 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:15:58,847 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:58,847 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:15:58,847 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:58,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1164] L725-->L725-1: Formula: (and (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{~m~0=v_~m~0_124, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 29#L738-4true, 104#thr1EXITtrue, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread2of3ForFork0InUse, 140#L725-1true, thr1Thread3of3ForFork0InUse, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, Black: 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), 212#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,860 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:15:58,860 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:58,860 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:58,860 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:15:58,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1270] L725-->L725-1: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= (mod v_~m~0_125 4294967296) 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_124 0)) InVars {~m~0=v_~m~0_125} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_11|, ~m~0=v_~m~0_124, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][91], [Black: 224#true, Black: 191#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|)), 29#L738-4true, Black: 196#(and (<= |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread1of3ForFork0_inc_~inc_v~0#1|) (<= (div ~value~0 4294967296) (div |thr1Thread1of3ForFork0_inc_~inc_v~0#1| 4294967296))), 43#L725-1true, 215#(and (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0)), thr1Thread1of3ForFork0InUse, Black: 208#(and (<= (div ~value~0 4294967296) (div |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 4294967296)) (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= (+ |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), Black: 203#(and (<= |thr1Thread2of3ForFork0_inc_~inc_v~0#1| 0) (<= 0 |thr1Thread2of3ForFork0_inc_~inc_v~0#1|)), thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 19#thr1EXITtrue, Black: 185#(and (<= ~value~0 (* (div ~value~0 4294967296) 4294967296)) (< 0 (+ (div ~value~0 4294967296) 1))), 226#(= ~dec_flag~0 1), 144#thr1EXITtrue, Black: 220#(and (<= (+ |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 1) ~value~0) (< 0 (+ (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296) 1)) (<= |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread3of3ForFork0_inc_~inc_v~0#1| 4294967296))), 188#true, 232#(= ~inc_flag~0 1)]) [2023-08-24 11:15:58,879 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:15:58,880 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:15:58,880 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:58,880 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:15:59,267 INFO L124 PetriNetUnfolderBase]: 25485/42137 cut-off events. [2023-08-24 11:15:59,267 INFO L125 PetriNetUnfolderBase]: For 22810/23232 co-relation queries the response was YES. [2023-08-24 11:15:59,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95745 conditions, 42137 events. 25485/42137 cut-off events. For 22810/23232 co-relation queries the response was YES. Maximal size of possible extension queue 2970. Compared 397235 event pairs, 13239 based on Foata normal form. 134/40618 useless extension candidates. Maximal degree in co-relation 72953. Up to 36476 conditions per place. [2023-08-24 11:15:59,463 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 59 selfloop transitions, 3 changer transitions 3/134 dead transitions. [2023-08-24 11:15:59,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 134 transitions, 838 flow [2023-08-24 11:15:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:15:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:15:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-24 11:15:59,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4503441494591937 [2023-08-24 11:15:59,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-24 11:15:59,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-24 11:15:59,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:15:59,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-24 11:15:59,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:15:59,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 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 11:15:59,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 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 11:15:59,467 INFO L175 Difference]: Start difference. First operand has 104 places, 122 transitions, 674 flow. Second operand 3 states and 458 transitions. [2023-08-24 11:15:59,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 134 transitions, 838 flow [2023-08-24 11:15:59,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 835 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:15:59,564 INFO L231 Difference]: Finished difference. Result has 103 places, 119 transitions, 674 flow [2023-08-24 11:15:59,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=103, PETRI_TRANSITIONS=119} [2023-08-24 11:15:59,565 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2023-08-24 11:15:59,565 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 119 transitions, 674 flow [2023-08-24 11:15:59,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 11:15:59,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:15:59,565 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:15:59,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 11:15:59,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:15:59,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:15:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 569169597, now seen corresponding path program 1 times [2023-08-24 11:15:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:15:59,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741748386] [2023-08-24 11:15:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:15:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:15:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:15:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:15:59,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:15:59,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741748386] [2023-08-24 11:15:59,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741748386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:15:59,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:15:59,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:15:59,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903790713] [2023-08-24 11:15:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:15:59,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:15:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:15:59,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:15:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:15:59,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 339 [2023-08-24 11:15:59,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 119 transitions, 674 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 11:15:59,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:15:59,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 339 [2023-08-24 11:15:59,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:07,499 INFO L124 PetriNetUnfolderBase]: 76827/114975 cut-off events. [2023-08-24 11:16:07,500 INFO L125 PetriNetUnfolderBase]: For 114149/114751 co-relation queries the response was YES. [2023-08-24 11:16:07,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290945 conditions, 114975 events. 76827/114975 cut-off events. For 114149/114751 co-relation queries the response was YES. Maximal size of possible extension queue 6562. Compared 1017199 event pairs, 37209 based on Foata normal form. 884/115660 useless extension candidates. Maximal degree in co-relation 171092. Up to 85560 conditions per place. [2023-08-24 11:16:08,075 INFO L140 encePairwiseOnDemand]: 328/339 looper letters, 210 selfloop transitions, 37 changer transitions 6/265 dead transitions. [2023-08-24 11:16:08,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 265 transitions, 1794 flow [2023-08-24 11:16:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:16:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:16:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1010 transitions. [2023-08-24 11:16:08,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724188790560472 [2023-08-24 11:16:08,078 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1010 transitions. [2023-08-24 11:16:08,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1010 transitions. [2023-08-24 11:16:08,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:08,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1010 transitions. [2023-08-24 11:16:08,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 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 11:16:08,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 339.0) internal successors, (3051), 9 states have internal predecessors, (3051), 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 11:16:08,082 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 339.0) internal successors, (3051), 9 states have internal predecessors, (3051), 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 11:16:08,082 INFO L175 Difference]: Start difference. First operand has 103 places, 119 transitions, 674 flow. Second operand 8 states and 1010 transitions. [2023-08-24 11:16:08,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 265 transitions, 1794 flow [2023-08-24 11:16:08,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 265 transitions, 1794 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:08,180 INFO L231 Difference]: Finished difference. Result has 114 places, 142 transitions, 1052 flow [2023-08-24 11:16:08,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1052, PETRI_PLACES=114, PETRI_TRANSITIONS=142} [2023-08-24 11:16:08,181 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2023-08-24 11:16:08,181 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 142 transitions, 1052 flow [2023-08-24 11:16:08,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 11:16:08,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:08,181 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:08,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 11:16:08,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:16:08,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -50146499, now seen corresponding path program 2 times [2023-08-24 11:16:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:08,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594298943] [2023-08-24 11:16:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:16:08,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594298943] [2023-08-24 11:16:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594298943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:16:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799280248] [2023-08-24 11:16:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:08,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:16:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:08,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:16:08,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:16:08,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 339 [2023-08-24 11:16:08,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 142 transitions, 1052 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 11:16:08,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:08,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 339 [2023-08-24 11:16:08,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:18,688 INFO L124 PetriNetUnfolderBase]: 97758/146248 cut-off events. [2023-08-24 11:16:18,688 INFO L125 PetriNetUnfolderBase]: For 204675/205749 co-relation queries the response was YES. [2023-08-24 11:16:19,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387094 conditions, 146248 events. 97758/146248 cut-off events. For 204675/205749 co-relation queries the response was YES. Maximal size of possible extension queue 8393. Compared 1324385 event pairs, 36921 based on Foata normal form. 1224/147161 useless extension candidates. Maximal degree in co-relation 355647. Up to 88295 conditions per place. [2023-08-24 11:16:19,706 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 232 selfloop transitions, 62 changer transitions 8/314 dead transitions. [2023-08-24 11:16:19,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 314 transitions, 2582 flow [2023-08-24 11:16:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:16:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:16:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1021 transitions. [2023-08-24 11:16:19,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37647492625368734 [2023-08-24 11:16:19,708 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1021 transitions. [2023-08-24 11:16:19,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1021 transitions. [2023-08-24 11:16:19,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:19,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1021 transitions. [2023-08-24 11:16:19,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.625) internal successors, (1021), 8 states have internal predecessors, (1021), 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 11:16:19,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 339.0) internal successors, (3051), 9 states have internal predecessors, (3051), 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 11:16:19,713 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 339.0) internal successors, (3051), 9 states have internal predecessors, (3051), 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 11:16:19,713 INFO L175 Difference]: Start difference. First operand has 114 places, 142 transitions, 1052 flow. Second operand 8 states and 1021 transitions. [2023-08-24 11:16:19,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 314 transitions, 2582 flow [2023-08-24 11:16:20,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 314 transitions, 2549 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:20,415 INFO L231 Difference]: Finished difference. Result has 123 places, 178 transitions, 1746 flow [2023-08-24 11:16:20,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1746, PETRI_PLACES=123, PETRI_TRANSITIONS=178} [2023-08-24 11:16:20,415 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 39 predicate places. [2023-08-24 11:16:20,415 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 178 transitions, 1746 flow [2023-08-24 11:16:20,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 11:16:20,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:20,416 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:20,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 11:16:20,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:16:20,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1294516265, now seen corresponding path program 3 times [2023-08-24 11:16:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564468402] [2023-08-24 11:16:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:20,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564468402] [2023-08-24 11:16:20,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564468402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:20,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447097659] [2023-08-24 11:16:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:20,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 339 [2023-08-24 11:16:20,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 178 transitions, 1746 flow. Second operand has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 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 11:16:20,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:20,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 339 [2023-08-24 11:16:20,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:31,065 INFO L124 PetriNetUnfolderBase]: 91247/137743 cut-off events. [2023-08-24 11:16:31,065 INFO L125 PetriNetUnfolderBase]: For 266280/267735 co-relation queries the response was YES. [2023-08-24 11:16:31,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380739 conditions, 137743 events. 91247/137743 cut-off events. For 266280/267735 co-relation queries the response was YES. Maximal size of possible extension queue 7969. Compared 1268806 event pairs, 29325 based on Foata normal form. 2542/140037 useless extension candidates. Maximal degree in co-relation 359426. Up to 61982 conditions per place. [2023-08-24 11:16:31,944 INFO L140 encePairwiseOnDemand]: 325/339 looper letters, 253 selfloop transitions, 72 changer transitions 31/368 dead transitions. [2023-08-24 11:16:31,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 368 transitions, 3190 flow [2023-08-24 11:16:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:16:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:16:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1165 transitions. [2023-08-24 11:16:31,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3818420190101606 [2023-08-24 11:16:31,947 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1165 transitions. [2023-08-24 11:16:31,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1165 transitions. [2023-08-24 11:16:31,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:31,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1165 transitions. [2023-08-24 11:16:31,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.44444444444446) internal successors, (1165), 9 states have internal predecessors, (1165), 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 11:16:31,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:16:31,952 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:16:31,952 INFO L175 Difference]: Start difference. First operand has 123 places, 178 transitions, 1746 flow. Second operand 9 states and 1165 transitions. [2023-08-24 11:16:31,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 368 transitions, 3190 flow [2023-08-24 11:16:33,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 368 transitions, 3161 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:33,646 INFO L231 Difference]: Finished difference. Result has 133 places, 186 transitions, 2049 flow [2023-08-24 11:16:33,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2049, PETRI_PLACES=133, PETRI_TRANSITIONS=186} [2023-08-24 11:16:33,647 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 49 predicate places. [2023-08-24 11:16:33,647 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 186 transitions, 2049 flow [2023-08-24 11:16:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 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 11:16:33,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:33,649 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:33,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 11:16:33,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:16:33,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash -905716053, now seen corresponding path program 1 times [2023-08-24 11:16:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:33,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974718946] [2023-08-24 11:16:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:33,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:33,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974718946] [2023-08-24 11:16:33,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974718946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:33,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:33,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417153428] [2023-08-24 11:16:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:33,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:33,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:33,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 339 [2023-08-24 11:16:33,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 186 transitions, 2049 flow. Second operand has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 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 11:16:33,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:33,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 339 [2023-08-24 11:16:33,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:44,763 INFO L124 PetriNetUnfolderBase]: 89335/135237 cut-off events. [2023-08-24 11:16:44,763 INFO L125 PetriNetUnfolderBase]: For 346929/348205 co-relation queries the response was YES. [2023-08-24 11:16:45,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388802 conditions, 135237 events. 89335/135237 cut-off events. For 346929/348205 co-relation queries the response was YES. Maximal size of possible extension queue 8024. Compared 1250264 event pairs, 28655 based on Foata normal form. 2380/137368 useless extension candidates. Maximal degree in co-relation 366972. Up to 63219 conditions per place. [2023-08-24 11:16:45,724 INFO L140 encePairwiseOnDemand]: 325/339 looper letters, 243 selfloop transitions, 69 changer transitions 41/365 dead transitions. [2023-08-24 11:16:45,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 365 transitions, 3491 flow [2023-08-24 11:16:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:16:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:16:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1154 transitions. [2023-08-24 11:16:45,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782366437233694 [2023-08-24 11:16:45,726 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1154 transitions. [2023-08-24 11:16:45,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1154 transitions. [2023-08-24 11:16:45,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:45,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1154 transitions. [2023-08-24 11:16:45,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.22222222222223) internal successors, (1154), 9 states have internal predecessors, (1154), 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 11:16:45,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:16:45,730 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:16:45,730 INFO L175 Difference]: Start difference. First operand has 133 places, 186 transitions, 2049 flow. Second operand 9 states and 1154 transitions. [2023-08-24 11:16:45,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 365 transitions, 3491 flow [2023-08-24 11:16:48,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 365 transitions, 3325 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-24 11:16:48,211 INFO L231 Difference]: Finished difference. Result has 139 places, 188 transitions, 2151 flow [2023-08-24 11:16:48,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2151, PETRI_PLACES=139, PETRI_TRANSITIONS=188} [2023-08-24 11:16:48,212 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 55 predicate places. [2023-08-24 11:16:48,212 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 188 transitions, 2151 flow [2023-08-24 11:16:48,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.14285714285714) internal successors, (708), 7 states have internal predecessors, (708), 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 11:16:48,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:48,212 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:48,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-24 11:16:48,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:16:48,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash 875584616, now seen corresponding path program 1 times [2023-08-24 11:16:48,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:48,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423988021] [2023-08-24 11:16:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423988021] [2023-08-24 11:16:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423988021] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373120141] [2023-08-24 11:16:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:48,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:48,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:48,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:48,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 11:16:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:48,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-24 11:16:48,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:48,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373120141] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:48,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 11:16:48,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 12 [2023-08-24 11:16:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127154917] [2023-08-24 11:16:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:48,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:16:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:16:48,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-08-24 11:16:48,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 339 [2023-08-24 11:16:48,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 188 transitions, 2151 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:48,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:48,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 339 [2023-08-24 11:16:48,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:54,535 INFO L124 PetriNetUnfolderBase]: 42580/71142 cut-off events. [2023-08-24 11:16:54,536 INFO L125 PetriNetUnfolderBase]: For 110600/111968 co-relation queries the response was YES. [2023-08-24 11:16:54,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164267 conditions, 71142 events. 42580/71142 cut-off events. For 110600/111968 co-relation queries the response was YES. Maximal size of possible extension queue 4865. Compared 713249 event pairs, 23189 based on Foata normal form. 4814/73322 useless extension candidates. Maximal degree in co-relation 156770. Up to 62170 conditions per place. [2023-08-24 11:16:54,937 INFO L140 encePairwiseOnDemand]: 314/339 looper letters, 43 selfloop transitions, 28 changer transitions 120/235 dead transitions. [2023-08-24 11:16:54,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 235 transitions, 2523 flow [2023-08-24 11:16:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:16:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:16:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2023-08-24 11:16:54,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4491150442477876 [2023-08-24 11:16:54,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 609 transitions. [2023-08-24 11:16:54,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 609 transitions. [2023-08-24 11:16:54,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:54,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 609 transitions. [2023-08-24 11:16:54,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 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 11:16:54,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 339.0) internal successors, (1695), 5 states have internal predecessors, (1695), 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 11:16:54,940 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 339.0) internal successors, (1695), 5 states have internal predecessors, (1695), 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 11:16:54,940 INFO L175 Difference]: Start difference. First operand has 139 places, 188 transitions, 2151 flow. Second operand 4 states and 609 transitions. [2023-08-24 11:16:54,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 235 transitions, 2523 flow [2023-08-24 11:16:55,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 235 transitions, 2283 flow, removed 48 selfloop flow, removed 6 redundant places. [2023-08-24 11:16:55,275 INFO L231 Difference]: Finished difference. Result has 137 places, 108 transitions, 673 flow [2023-08-24 11:16:55,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=673, PETRI_PLACES=137, PETRI_TRANSITIONS=108} [2023-08-24 11:16:55,275 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 53 predicate places. [2023-08-24 11:16:55,275 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 108 transitions, 673 flow [2023-08-24 11:16:55,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:55,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:55,275 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:55,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 11:16:55,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:55,479 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:16:55,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1860210196, now seen corresponding path program 1 times [2023-08-24 11:16:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233331055] [2023-08-24 11:16:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:55,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:55,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233331055] [2023-08-24 11:16:55,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233331055] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:55,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575887470] [2023-08-24 11:16:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:55,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:55,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:55,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:55,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 11:16:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:55,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-24 11:16:55,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:55,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:55,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575887470] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:16:55,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:16:55,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-08-24 11:16:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667815230] [2023-08-24 11:16:55,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:16:55,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 11:16:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 11:16:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-08-24 11:16:55,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 339 [2023-08-24 11:16:55,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 108 transitions, 673 flow. Second operand has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 17 states have internal predecessors, (1669), 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 11:16:55,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:55,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 339 [2023-08-24 11:16:55,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:00,803 INFO L124 PetriNetUnfolderBase]: 21975/36463 cut-off events. [2023-08-24 11:17:00,803 INFO L125 PetriNetUnfolderBase]: For 53196/53210 co-relation queries the response was YES. [2023-08-24 11:17:00,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111404 conditions, 36463 events. 21975/36463 cut-off events. For 53196/53210 co-relation queries the response was YES. Maximal size of possible extension queue 2160. Compared 328704 event pairs, 2040 based on Foata normal form. 164/36561 useless extension candidates. Maximal degree in co-relation 111368. Up to 10193 conditions per place. [2023-08-24 11:17:00,972 INFO L140 encePairwiseOnDemand]: 313/339 looper letters, 404 selfloop transitions, 67 changer transitions 431/911 dead transitions. [2023-08-24 11:17:00,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 911 transitions, 6441 flow [2023-08-24 11:17:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-08-24 11:17:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-08-24 11:17:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5275 transitions. [2023-08-24 11:17:00,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3241764995083579 [2023-08-24 11:17:00,977 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 5275 transitions. [2023-08-24 11:17:00,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 5275 transitions. [2023-08-24 11:17:00,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:00,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 5275 transitions. [2023-08-24 11:17:00,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 109.89583333333333) internal successors, (5275), 48 states have internal predecessors, (5275), 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 11:17:00,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 339.0) internal successors, (16611), 49 states have internal predecessors, (16611), 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 11:17:00,992 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 339.0) internal successors, (16611), 49 states have internal predecessors, (16611), 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 11:17:00,992 INFO L175 Difference]: Start difference. First operand has 137 places, 108 transitions, 673 flow. Second operand 48 states and 5275 transitions. [2023-08-24 11:17:00,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 911 transitions, 6441 flow [2023-08-24 11:17:01,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 911 transitions, 6038 flow, removed 185 selfloop flow, removed 10 redundant places. [2023-08-24 11:17:01,180 INFO L231 Difference]: Finished difference. Result has 185 places, 153 transitions, 1168 flow [2023-08-24 11:17:01,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=1168, PETRI_PLACES=185, PETRI_TRANSITIONS=153} [2023-08-24 11:17:01,181 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 101 predicate places. [2023-08-24 11:17:01,181 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 153 transitions, 1168 flow [2023-08-24 11:17:01,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 98.17647058823529) internal successors, (1669), 17 states have internal predecessors, (1669), 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 11:17:01,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:01,181 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:01,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-24 11:17:01,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:01,385 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:01,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1210816747, now seen corresponding path program 1 times [2023-08-24 11:17:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:01,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848868159] [2023-08-24 11:17:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848868159] [2023-08-24 11:17:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848868159] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:17:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351864189] [2023-08-24 11:17:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:01,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:17:01,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:17:01,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 11:17:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:01,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-24 11:17:01,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:17:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:01,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:17:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351864189] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:17:01,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:17:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-08-24 11:17:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689967753] [2023-08-24 11:17:01,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:17:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 11:17:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 11:17:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-08-24 11:17:01,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 339 [2023-08-24 11:17:01,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 153 transitions, 1168 flow. Second operand has 17 states, 17 states have (on average 98.0) internal successors, (1666), 17 states have internal predecessors, (1666), 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 11:17:01,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:01,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 339 [2023-08-24 11:17:01,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:07,065 INFO L124 PetriNetUnfolderBase]: 18481/31017 cut-off events. [2023-08-24 11:17:07,066 INFO L125 PetriNetUnfolderBase]: For 181626/181646 co-relation queries the response was YES. [2023-08-24 11:17:07,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132240 conditions, 31017 events. 18481/31017 cut-off events. For 181626/181646 co-relation queries the response was YES. Maximal size of possible extension queue 1645. Compared 275894 event pairs, 2158 based on Foata normal form. 216/31168 useless extension candidates. Maximal degree in co-relation 132186. Up to 8881 conditions per place. [2023-08-24 11:17:07,278 INFO L140 encePairwiseOnDemand]: 314/339 looper letters, 331 selfloop transitions, 65 changer transitions 513/918 dead transitions. [2023-08-24 11:17:07,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 918 transitions, 8688 flow [2023-08-24 11:17:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-24 11:17:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-24 11:17:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4904 transitions. [2023-08-24 11:17:07,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32146837102589315 [2023-08-24 11:17:07,284 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 4904 transitions. [2023-08-24 11:17:07,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 4904 transitions. [2023-08-24 11:17:07,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:07,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4904 transitions. [2023-08-24 11:17:07,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 108.97777777777777) internal successors, (4904), 45 states have internal predecessors, (4904), 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 11:17:07,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 339.0) internal successors, (15594), 46 states have internal predecessors, (15594), 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 11:17:07,297 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 339.0) internal successors, (15594), 46 states have internal predecessors, (15594), 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 11:17:07,297 INFO L175 Difference]: Start difference. First operand has 185 places, 153 transitions, 1168 flow. Second operand 45 states and 4904 transitions. [2023-08-24 11:17:07,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 918 transitions, 8688 flow [2023-08-24 11:17:08,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 918 transitions, 8206 flow, removed 167 selfloop flow, removed 10 redundant places. [2023-08-24 11:17:08,110 INFO L231 Difference]: Finished difference. Result has 228 places, 170 transitions, 1696 flow [2023-08-24 11:17:08,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1696, PETRI_PLACES=228, PETRI_TRANSITIONS=170} [2023-08-24 11:17:08,111 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 144 predicate places. [2023-08-24 11:17:08,111 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 170 transitions, 1696 flow [2023-08-24 11:17:08,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 98.0) internal successors, (1666), 17 states have internal predecessors, (1666), 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 11:17:08,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:08,111 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:08,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 11:17:08,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-24 11:17:08,316 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:08,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2127160413, now seen corresponding path program 1 times [2023-08-24 11:17:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:08,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233644066] [2023-08-24 11:17:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:17:08,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233644066] [2023-08-24 11:17:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233644066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:08,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:17:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635530316] [2023-08-24 11:17:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:08,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:17:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:17:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:17:08,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 339 [2023-08-24 11:17:08,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 170 transitions, 1696 flow. Second operand has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 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 11:17:08,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:08,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 339 [2023-08-24 11:17:08,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:11,058 INFO L124 PetriNetUnfolderBase]: 12283/21095 cut-off events. [2023-08-24 11:17:11,058 INFO L125 PetriNetUnfolderBase]: For 285488/285512 co-relation queries the response was YES. [2023-08-24 11:17:11,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106279 conditions, 21095 events. 12283/21095 cut-off events. For 285488/285512 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 182306 event pairs, 3094 based on Foata normal form. 182/21116 useless extension candidates. Maximal degree in co-relation 106210. Up to 8035 conditions per place. [2023-08-24 11:17:11,187 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 182 selfloop transitions, 19 changer transitions 116/327 dead transitions. [2023-08-24 11:17:11,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 327 transitions, 3601 flow [2023-08-24 11:17:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:17:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:17:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1068 transitions. [2023-08-24 11:17:11,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3500491642084562 [2023-08-24 11:17:11,188 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1068 transitions. [2023-08-24 11:17:11,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1068 transitions. [2023-08-24 11:17:11,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:11,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1068 transitions. [2023-08-24 11:17:11,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 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 11:17:11,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:17:11,191 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:17:11,191 INFO L175 Difference]: Start difference. First operand has 228 places, 170 transitions, 1696 flow. Second operand 9 states and 1068 transitions. [2023-08-24 11:17:11,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 327 transitions, 3601 flow [2023-08-24 11:17:12,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 327 transitions, 3112 flow, removed 188 selfloop flow, removed 19 redundant places. [2023-08-24 11:17:12,116 INFO L231 Difference]: Finished difference. Result has 203 places, 140 transitions, 1183 flow [2023-08-24 11:17:12,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=203, PETRI_TRANSITIONS=140} [2023-08-24 11:17:12,116 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 119 predicate places. [2023-08-24 11:17:12,116 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 140 transitions, 1183 flow [2023-08-24 11:17:12,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 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 11:17:12,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:12,117 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:12,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-24 11:17:12,117 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:12,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:12,117 INFO L85 PathProgramCache]: Analyzing trace with hash 935979761, now seen corresponding path program 1 times [2023-08-24 11:17:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:12,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121462358] [2023-08-24 11:17:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:17:12,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121462358] [2023-08-24 11:17:12,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121462358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:12,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:12,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:17:12,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809845504] [2023-08-24 11:17:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:12,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:17:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:12,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:17:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:17:12,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 339 [2023-08-24 11:17:12,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 140 transitions, 1183 flow. Second operand has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 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 11:17:12,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:12,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 339 [2023-08-24 11:17:12,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:13,794 INFO L124 PetriNetUnfolderBase]: 6636/11815 cut-off events. [2023-08-24 11:17:13,795 INFO L125 PetriNetUnfolderBase]: For 142055/142119 co-relation queries the response was YES. [2023-08-24 11:17:13,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58740 conditions, 11815 events. 6636/11815 cut-off events. For 142055/142119 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 98885 event pairs, 1547 based on Foata normal form. 58/11782 useless extension candidates. Maximal degree in co-relation 58681. Up to 5857 conditions per place. [2023-08-24 11:17:13,851 INFO L140 encePairwiseOnDemand]: 329/339 looper letters, 154 selfloop transitions, 19 changer transitions 83/265 dead transitions. [2023-08-24 11:17:13,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 265 transitions, 2662 flow [2023-08-24 11:17:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:17:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:17:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1037 transitions. [2023-08-24 11:17:13,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33988856112749916 [2023-08-24 11:17:13,853 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1037 transitions. [2023-08-24 11:17:13,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1037 transitions. [2023-08-24 11:17:13,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:13,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1037 transitions. [2023-08-24 11:17:13,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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 11:17:13,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:17:13,856 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:17:13,856 INFO L175 Difference]: Start difference. First operand has 203 places, 140 transitions, 1183 flow. Second operand 9 states and 1037 transitions. [2023-08-24 11:17:13,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 265 transitions, 2662 flow [2023-08-24 11:17:13,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 265 transitions, 2581 flow, removed 27 selfloop flow, removed 9 redundant places. [2023-08-24 11:17:14,001 INFO L231 Difference]: Finished difference. Result has 191 places, 114 transitions, 1005 flow [2023-08-24 11:17:14,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1005, PETRI_PLACES=191, PETRI_TRANSITIONS=114} [2023-08-24 11:17:14,002 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 107 predicate places. [2023-08-24 11:17:14,002 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 114 transitions, 1005 flow [2023-08-24 11:17:14,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 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 11:17:14,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:14,002 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:14,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-24 11:17:14,002 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:14,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -947415669, now seen corresponding path program 1 times [2023-08-24 11:17:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848142263] [2023-08-24 11:17:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:17:14,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848142263] [2023-08-24 11:17:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848142263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:17:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670146171] [2023-08-24 11:17:14,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:14,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:14,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:17:14,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:17:14,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 11:17:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:14,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-24 11:17:14,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:17:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:17:14,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:17:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:17:14,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670146171] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:17:14,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:17:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-24 11:17:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386218712] [2023-08-24 11:17:14,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:17:14,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 11:17:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 11:17:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-08-24 11:17:14,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 339 [2023-08-24 11:17:14,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 114 transitions, 1005 flow. Second operand has 23 states, 23 states have (on average 95.0) internal successors, (2185), 23 states have internal predecessors, (2185), 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 11:17:14,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:14,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 339 [2023-08-24 11:17:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:16,226 INFO L124 PetriNetUnfolderBase]: 3712/6924 cut-off events. [2023-08-24 11:17:16,227 INFO L125 PetriNetUnfolderBase]: For 92404/92404 co-relation queries the response was YES. [2023-08-24 11:17:16,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36599 conditions, 6924 events. 3712/6924 cut-off events. For 92404/92404 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 57214 event pairs, 532 based on Foata normal form. 22/6940 useless extension candidates. Maximal degree in co-relation 36543. Up to 2310 conditions per place. [2023-08-24 11:17:16,263 INFO L140 encePairwiseOnDemand]: 321/339 looper letters, 146 selfloop transitions, 34 changer transitions 144/333 dead transitions. [2023-08-24 11:17:16,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 333 transitions, 3557 flow [2023-08-24 11:17:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-24 11:17:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-24 11:17:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2432 transitions. [2023-08-24 11:17:16,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29891838741396265 [2023-08-24 11:17:16,277 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2432 transitions. [2023-08-24 11:17:16,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2432 transitions. [2023-08-24 11:17:16,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:16,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2432 transitions. [2023-08-24 11:17:16,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 101.33333333333333) internal successors, (2432), 24 states have internal predecessors, (2432), 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 11:17:16,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 339.0) internal successors, (8475), 25 states have internal predecessors, (8475), 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 11:17:16,288 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 339.0) internal successors, (8475), 25 states have internal predecessors, (8475), 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 11:17:16,288 INFO L175 Difference]: Start difference. First operand has 191 places, 114 transitions, 1005 flow. Second operand 24 states and 2432 transitions. [2023-08-24 11:17:16,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 333 transitions, 3557 flow [2023-08-24 11:17:16,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 333 transitions, 3250 flow, removed 129 selfloop flow, removed 14 redundant places. [2023-08-24 11:17:16,390 INFO L231 Difference]: Finished difference. Result has 184 places, 105 transitions, 984 flow [2023-08-24 11:17:16,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=984, PETRI_PLACES=184, PETRI_TRANSITIONS=105} [2023-08-24 11:17:16,390 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 100 predicate places. [2023-08-24 11:17:16,390 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 105 transitions, 984 flow [2023-08-24 11:17:16,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 95.0) internal successors, (2185), 23 states have internal predecessors, (2185), 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 11:17:16,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:16,391 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:16,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 11:17:16,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-24 11:17:16,591 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:16,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash -636382708, now seen corresponding path program 1 times [2023-08-24 11:17:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558286741] [2023-08-24 11:17:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:17:16,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558286741] [2023-08-24 11:17:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558286741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:17:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188687177] [2023-08-24 11:17:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:16,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 11:17:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 11:17:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-24 11:17:16,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 339 [2023-08-24 11:17:16,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 105 transitions, 984 flow. Second operand has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:16,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:16,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 339 [2023-08-24 11:17:16,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:17,611 INFO L124 PetriNetUnfolderBase]: 3113/5807 cut-off events. [2023-08-24 11:17:17,612 INFO L125 PetriNetUnfolderBase]: For 62114/62134 co-relation queries the response was YES. [2023-08-24 11:17:17,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29170 conditions, 5807 events. 3113/5807 cut-off events. For 62114/62134 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 46697 event pairs, 687 based on Foata normal form. 14/5803 useless extension candidates. Maximal degree in co-relation 29121. Up to 2187 conditions per place. [2023-08-24 11:17:17,636 INFO L140 encePairwiseOnDemand]: 329/339 looper letters, 98 selfloop transitions, 18 changer transitions 98/222 dead transitions. [2023-08-24 11:17:17,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 222 transitions, 2330 flow [2023-08-24 11:17:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 11:17:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 11:17:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1680 transitions. [2023-08-24 11:17:17,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30973451327433627 [2023-08-24 11:17:17,638 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1680 transitions. [2023-08-24 11:17:17,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1680 transitions. [2023-08-24 11:17:17,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:17,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1680 transitions. [2023-08-24 11:17:17,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 105.0) internal successors, (1680), 16 states have internal predecessors, (1680), 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 11:17:17,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 339.0) internal successors, (5763), 17 states have internal predecessors, (5763), 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 11:17:17,642 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 339.0) internal successors, (5763), 17 states have internal predecessors, (5763), 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 11:17:17,642 INFO L175 Difference]: Start difference. First operand has 184 places, 105 transitions, 984 flow. Second operand 16 states and 1680 transitions. [2023-08-24 11:17:17,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 222 transitions, 2330 flow [2023-08-24 11:17:17,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 222 transitions, 2196 flow, removed 31 selfloop flow, removed 19 redundant places. [2023-08-24 11:17:17,691 INFO L231 Difference]: Finished difference. Result has 169 places, 88 transitions, 768 flow [2023-08-24 11:17:17,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=768, PETRI_PLACES=169, PETRI_TRANSITIONS=88} [2023-08-24 11:17:17,691 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 85 predicate places. [2023-08-24 11:17:17,691 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 88 transitions, 768 flow [2023-08-24 11:17:17,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:17,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:17,691 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:17,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-24 11:17:17,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:17,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2111583494, now seen corresponding path program 1 times [2023-08-24 11:17:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:17,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547694472] [2023-08-24 11:17:17,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:17,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547694472] [2023-08-24 11:17:17,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547694472] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:17:17,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438288252] [2023-08-24 11:17:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:17,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:17:17,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:17:17,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 11:17:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:17,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-24 11:17:17,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:17:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:18,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:17:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:18,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438288252] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:17:18,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:17:18,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-24 11:17:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602982621] [2023-08-24 11:17:18,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:17:18,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 11:17:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 11:17:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-08-24 11:17:18,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 339 [2023-08-24 11:17:18,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 88 transitions, 768 flow. Second operand has 23 states, 23 states have (on average 94.8695652173913) internal successors, (2182), 23 states have internal predecessors, (2182), 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 11:17:18,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:18,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 339 [2023-08-24 11:17:18,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:19,485 INFO L124 PetriNetUnfolderBase]: 2400/4475 cut-off events. [2023-08-24 11:17:19,486 INFO L125 PetriNetUnfolderBase]: For 46232/46232 co-relation queries the response was YES. [2023-08-24 11:17:19,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22123 conditions, 4475 events. 2400/4475 cut-off events. For 46232/46232 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 34585 event pairs, 379 based on Foata normal form. 22/4496 useless extension candidates. Maximal degree in co-relation 22078. Up to 1387 conditions per place. [2023-08-24 11:17:19,508 INFO L140 encePairwiseOnDemand]: 321/339 looper letters, 102 selfloop transitions, 25 changer transitions 146/281 dead transitions. [2023-08-24 11:17:19,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 281 transitions, 2840 flow [2023-08-24 11:17:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-24 11:17:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-24 11:17:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2403 transitions. [2023-08-24 11:17:19,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29535398230088494 [2023-08-24 11:17:19,510 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2403 transitions. [2023-08-24 11:17:19,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2403 transitions. [2023-08-24 11:17:19,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:19,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2403 transitions. [2023-08-24 11:17:19,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 100.125) internal successors, (2403), 24 states have internal predecessors, (2403), 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 11:17:19,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 339.0) internal successors, (8475), 25 states have internal predecessors, (8475), 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 11:17:19,520 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 339.0) internal successors, (8475), 25 states have internal predecessors, (8475), 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 11:17:19,520 INFO L175 Difference]: Start difference. First operand has 169 places, 88 transitions, 768 flow. Second operand 24 states and 2403 transitions. [2023-08-24 11:17:19,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 281 transitions, 2840 flow [2023-08-24 11:17:19,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 281 transitions, 2542 flow, removed 125 selfloop flow, removed 16 redundant places. [2023-08-24 11:17:19,567 INFO L231 Difference]: Finished difference. Result has 150 places, 71 transitions, 638 flow [2023-08-24 11:17:19,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=638, PETRI_PLACES=150, PETRI_TRANSITIONS=71} [2023-08-24 11:17:19,567 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 66 predicate places. [2023-08-24 11:17:19,567 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 71 transitions, 638 flow [2023-08-24 11:17:19,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 94.8695652173913) internal successors, (2182), 23 states have internal predecessors, (2182), 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 11:17:19,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:19,567 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:19,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 11:17:19,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:19,770 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:19,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash 360354572, now seen corresponding path program 2 times [2023-08-24 11:17:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064898554] [2023-08-24 11:17:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:17:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:19,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064898554] [2023-08-24 11:17:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064898554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:19,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:17:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102156067] [2023-08-24 11:17:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:19,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 11:17:19,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:19,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 11:17:19,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-08-24 11:17:19,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 339 [2023-08-24 11:17:19,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 71 transitions, 638 flow. Second operand has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:19,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:19,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 339 [2023-08-24 11:17:19,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:20,334 INFO L124 PetriNetUnfolderBase]: 800/1747 cut-off events. [2023-08-24 11:17:20,335 INFO L125 PetriNetUnfolderBase]: For 12498/12498 co-relation queries the response was YES. [2023-08-24 11:17:20,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7970 conditions, 1747 events. 800/1747 cut-off events. For 12498/12498 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 12905 event pairs, 96 based on Foata normal form. 16/1763 useless extension candidates. Maximal degree in co-relation 7931. Up to 722 conditions per place. [2023-08-24 11:17:20,342 INFO L140 encePairwiseOnDemand]: 329/339 looper letters, 40 selfloop transitions, 9 changer transitions 83/138 dead transitions. [2023-08-24 11:17:20,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 138 transitions, 1357 flow [2023-08-24 11:17:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 11:17:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 11:17:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1541 transitions. [2023-08-24 11:17:20,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3030481809242871 [2023-08-24 11:17:20,344 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1541 transitions. [2023-08-24 11:17:20,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1541 transitions. [2023-08-24 11:17:20,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:20,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1541 transitions. [2023-08-24 11:17:20,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 102.73333333333333) internal successors, (1541), 15 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 11:17:20,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 339.0) internal successors, (5424), 16 states have internal predecessors, (5424), 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 11:17:20,348 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 339.0) internal successors, (5424), 16 states have internal predecessors, (5424), 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 11:17:20,348 INFO L175 Difference]: Start difference. First operand has 150 places, 71 transitions, 638 flow. Second operand 15 states and 1541 transitions. [2023-08-24 11:17:20,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 138 transitions, 1357 flow [2023-08-24 11:17:20,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 138 transitions, 1224 flow, removed 35 selfloop flow, removed 22 redundant places. [2023-08-24 11:17:20,362 INFO L231 Difference]: Finished difference. Result has 129 places, 50 transitions, 370 flow [2023-08-24 11:17:20,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=370, PETRI_PLACES=129, PETRI_TRANSITIONS=50} [2023-08-24 11:17:20,362 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 45 predicate places. [2023-08-24 11:17:20,363 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 50 transitions, 370 flow [2023-08-24 11:17:20,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:20,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:20,363 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:20,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-24 11:17:20,363 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:20,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash -462805364, now seen corresponding path program 3 times [2023-08-24 11:17:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212589702] [2023-08-24 11:17:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:17:20,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212589702] [2023-08-24 11:17:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212589702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:17:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283013265] [2023-08-24 11:17:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 11:17:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 11:17:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-24 11:17:20,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 339 [2023-08-24 11:17:20,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 50 transitions, 370 flow. Second operand has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:20,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:20,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 339 [2023-08-24 11:17:20,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:20,717 INFO L124 PetriNetUnfolderBase]: 304/717 cut-off events. [2023-08-24 11:17:20,717 INFO L125 PetriNetUnfolderBase]: For 3420/3420 co-relation queries the response was YES. [2023-08-24 11:17:20,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 717 events. 304/717 cut-off events. For 3420/3420 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4757 event pairs, 50 based on Foata normal form. 12/729 useless extension candidates. Maximal degree in co-relation 2916. Up to 371 conditions per place. [2023-08-24 11:17:20,719 INFO L140 encePairwiseOnDemand]: 331/339 looper letters, 34 selfloop transitions, 4 changer transitions 37/81 dead transitions. [2023-08-24 11:17:20,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 81 transitions, 697 flow [2023-08-24 11:17:20,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 11:17:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 11:17:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1021 transitions. [2023-08-24 11:17:20,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30117994100294987 [2023-08-24 11:17:20,721 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1021 transitions. [2023-08-24 11:17:20,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1021 transitions. [2023-08-24 11:17:20,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:20,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1021 transitions. [2023-08-24 11:17:20,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.1) internal successors, (1021), 10 states have internal predecessors, (1021), 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 11:17:20,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 339.0) internal successors, (3729), 11 states have internal predecessors, (3729), 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 11:17:20,724 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 339.0) internal successors, (3729), 11 states have internal predecessors, (3729), 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 11:17:20,724 INFO L175 Difference]: Start difference. First operand has 129 places, 50 transitions, 370 flow. Second operand 10 states and 1021 transitions. [2023-08-24 11:17:20,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 81 transitions, 697 flow [2023-08-24 11:17:20,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 81 transitions, 603 flow, removed 27 selfloop flow, removed 21 redundant places. [2023-08-24 11:17:20,729 INFO L231 Difference]: Finished difference. Result has 95 places, 41 transitions, 238 flow [2023-08-24 11:17:20,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=95, PETRI_TRANSITIONS=41} [2023-08-24 11:17:20,729 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 11 predicate places. [2023-08-24 11:17:20,729 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 41 transitions, 238 flow [2023-08-24 11:17:20,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:20,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:20,730 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:20,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-24 11:17:20,730 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-24 11:17:20,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1444125300, now seen corresponding path program 4 times [2023-08-24 11:17:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103428144] [2023-08-24 11:17:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:17:20,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103428144] [2023-08-24 11:17:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103428144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:17:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986215808] [2023-08-24 11:17:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:20,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 11:17:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 11:17:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-24 11:17:20,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 339 [2023-08-24 11:17:20,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 41 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:20,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:20,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 339 [2023-08-24 11:17:20,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:20,977 INFO L124 PetriNetUnfolderBase]: 132/329 cut-off events. [2023-08-24 11:17:20,977 INFO L125 PetriNetUnfolderBase]: For 723/723 co-relation queries the response was YES. [2023-08-24 11:17:20,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 329 events. 132/329 cut-off events. For 723/723 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1697 event pairs, 22 based on Foata normal form. 12/341 useless extension candidates. Maximal degree in co-relation 1137. Up to 210 conditions per place. [2023-08-24 11:17:20,978 INFO L140 encePairwiseOnDemand]: 331/339 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2023-08-24 11:17:20,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 55 transitions, 386 flow [2023-08-24 11:17:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:17:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:17:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 906 transitions. [2023-08-24 11:17:20,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2969518190757129 [2023-08-24 11:17:20,979 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 906 transitions. [2023-08-24 11:17:20,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 906 transitions. [2023-08-24 11:17:20,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:20,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 906 transitions. [2023-08-24 11:17:20,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.66666666666667) internal successors, (906), 9 states have internal predecessors, (906), 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 11:17:20,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:17:20,983 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 339.0) internal successors, (3390), 10 states have internal predecessors, (3390), 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 11:17:20,983 INFO L175 Difference]: Start difference. First operand has 95 places, 41 transitions, 238 flow. Second operand 9 states and 906 transitions. [2023-08-24 11:17:20,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 55 transitions, 386 flow [2023-08-24 11:17:20,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 55 transitions, 336 flow, removed 8 selfloop flow, removed 19 redundant places. [2023-08-24 11:17:20,984 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2023-08-24 11:17:20,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2023-08-24 11:17:20,985 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2023-08-24 11:17:20,985 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2023-08-24 11:17:20,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 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 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-08-24 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-08-24 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-08-24 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-08-24 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-08-24 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-08-24 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2023-08-24 11:17:20,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2023-08-24 11:17:20,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-24 11:17:20,987 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:20,988 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-24 11:17:20,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 189 transitions, 399 flow [2023-08-24 11:17:21,001 INFO L124 PetriNetUnfolderBase]: 19/223 cut-off events. [2023-08-24 11:17:21,001 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:17:21,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 223 events. 19/223 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 789 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-24 11:17:21,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 189 transitions, 399 flow [2023-08-24 11:17:21,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 189 transitions, 399 flow [2023-08-24 11:17:21,003 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:17:21,003 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 189 transitions, 399 flow [2023-08-24 11:17:21,003 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 189 transitions, 399 flow [2023-08-24 11:17:21,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 189 transitions, 399 flow [2023-08-24 11:17:21,014 INFO L124 PetriNetUnfolderBase]: 19/223 cut-off events. [2023-08-24 11:17:21,014 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:17:21,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 223 events. 19/223 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 789 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-24 11:17:21,020 INFO L119 LiptonReduction]: Number of co-enabled transitions 21306 [2023-08-24 11:17:23,546 INFO L134 LiptonReduction]: Checked pairs total: 83173 [2023-08-24 11:17:23,546 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-08-24 11:17:23,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:17:23,549 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;@43335d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:17:23,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:17:23,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:17:23,552 INFO L124 PetriNetUnfolderBase]: 10/82 cut-off events. [2023-08-24 11:17:23,553 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:17:23,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:23,553 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-24 11:17:23,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:17:23,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1899942690, now seen corresponding path program 1 times [2023-08-24 11:17:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095110186] [2023-08-24 11:17:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:17:23,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:17:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:17:23,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:17:23,580 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:17:23,580 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:17:23,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-24 11:17:23,580 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:17:23,582 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:17:23,582 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:17:23,582 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-24 11:17:23,610 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:17:23,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 243 transitions, 518 flow [2023-08-24 11:17:23,628 INFO L124 PetriNetUnfolderBase]: 25/289 cut-off events. [2023-08-24 11:17:23,628 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 11:17:23,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 289 events. 25/289 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1114 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 231. Up to 10 conditions per place. [2023-08-24 11:17:23,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 243 transitions, 518 flow [2023-08-24 11:17:23,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 243 transitions, 518 flow [2023-08-24 11:17:23,633 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:17:23,634 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 243 transitions, 518 flow [2023-08-24 11:17:23,634 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 243 transitions, 518 flow [2023-08-24 11:17:23,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 243 transitions, 518 flow [2023-08-24 11:17:23,651 INFO L124 PetriNetUnfolderBase]: 25/289 cut-off events. [2023-08-24 11:17:23,651 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 11:17:23,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 289 events. 25/289 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1114 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 231. Up to 10 conditions per place. [2023-08-24 11:17:23,658 INFO L119 LiptonReduction]: Number of co-enabled transitions 39856 [2023-08-24 11:17:26,950 INFO L134 LiptonReduction]: Checked pairs total: 162151 [2023-08-24 11:17:26,951 INFO L136 LiptonReduction]: Total number of compositions: 189 [2023-08-24 11:17:26,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:17:26,952 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;@43335d1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:17:26,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-24 11:17:26,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:17:26,954 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2023-08-24 11:17:26,954 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 11:17:26,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:26,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:26,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 11:17:26,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1923384770, now seen corresponding path program 1 times [2023-08-24 11:17:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969884873] [2023-08-24 11:17:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:26,991 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 11:17:26,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:26,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969884873] [2023-08-24 11:17:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969884873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:26,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:17:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952806660] [2023-08-24 11:17:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:26,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:17:26,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:17:26,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:17:26,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 432 [2023-08-24 11:17:26,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 120 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 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 11:17:26,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:26,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 432 [2023-08-24 11:17:26,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand