/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-counter-fun.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 09:08:43,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 09:08:43,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 09:08:43,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 09:08:43,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 09:08:43,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 09:08:43,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 09:08:43,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 09:08:43,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 09:08:43,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 09:08:43,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 09:08:43,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 09:08:43,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 09:08:43,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 09:08:43,707 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 09:08:43,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 09:08:43,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 09:08:43,708 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 09:08:43,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 09:08:43,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 09:08:43,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 09:08:43,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 09:08:43,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 09:08:43,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 09:08:43,709 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 09:08:43,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 09:08:43,710 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 09:08:43,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 09:08:43,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 09:08:43,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 09:08:43,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:08:43,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 09:08:43,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 09:08:43,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 09:08:43,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 09:08:43,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 09:08:43,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 09:08:43,712 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 09:08:43,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 09:08:43,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 09:08:43,712 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 09:08:43,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 09:08:43,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 09:08:43,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 09:08:43,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 09:08:43,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 09:08:43,911 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 09:08:43,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-counter-fun.wvr_bound2.c [2023-08-04 09:08:44,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 09:08:44,941 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 09:08:44,942 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-counter-fun.wvr_bound2.c [2023-08-04 09:08:44,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c02ad7a/37b11d9127734fab8699cf2f026af7b0/FLAGa3137c48e [2023-08-04 09:08:44,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c02ad7a/37b11d9127734fab8699cf2f026af7b0 [2023-08-04 09:08:44,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 09:08:44,958 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 09:08:44,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 09:08:44,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 09:08:44,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 09:08:44,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:08:44" (1/1) ... [2023-08-04 09:08:44,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f1e12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:44, skipping insertion in model container [2023-08-04 09:08:44,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:08:44" (1/1) ... [2023-08-04 09:08:44,975 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 09:08:45,107 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-counter-fun.wvr_bound2.c[2843,2856] [2023-08-04 09:08:45,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:08:45,116 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 09:08:45,130 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-counter-fun.wvr_bound2.c[2843,2856] [2023-08-04 09:08:45,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:08:45,137 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:08:45,137 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:08:45,141 INFO L206 MainTranslator]: Completed translation [2023-08-04 09:08:45,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45 WrapperNode [2023-08-04 09:08:45,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 09:08:45,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 09:08:45,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 09:08:45,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 09:08:45,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,168 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 230 [2023-08-04 09:08:45,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 09:08:45,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 09:08:45,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 09:08:45,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 09:08:45,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 09:08:45,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 09:08:45,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 09:08:45,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 09:08:45,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (1/1) ... [2023-08-04 09:08:45,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:08:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:08:45,228 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-04 09:08:45,230 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-04 09:08:45,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 09:08:45,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 09:08:45,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 09:08:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 09:08:45,253 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 09:08:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 09:08:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 09:08:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 09:08:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 09:08:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 09:08:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 09:08:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 09:08:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 09:08:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 09:08:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 09:08:45,256 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 09:08:45,335 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 09:08:45,336 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 09:08:45,603 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 09:08:45,706 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 09:08:45,706 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-08-04 09:08:45,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:08:45 BoogieIcfgContainer [2023-08-04 09:08:45,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 09:08:45,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 09:08:45,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 09:08:45,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 09:08:45,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 09:08:44" (1/3) ... [2023-08-04 09:08:45,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a68e5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:08:45, skipping insertion in model container [2023-08-04 09:08:45,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:08:45" (2/3) ... [2023-08-04 09:08:45,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a68e5be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:08:45, skipping insertion in model container [2023-08-04 09:08:45,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:08:45" (3/3) ... [2023-08-04 09:08:45,717 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-counter-fun.wvr_bound2.c [2023-08-04 09:08:45,723 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 09:08:45,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 09:08:45,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 09:08:45,731 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 09:08:45,792 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 09:08:45,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:45,904 INFO L124 PetriNetUnfolderBase]: 40/325 cut-off events. [2023-08-04 09:08:45,904 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:08:45,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 325 events. 40/325 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 888 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 210. Up to 8 conditions per place. [2023-08-04 09:08:45,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:45,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:45,928 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:08:45,934 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:45,936 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:45,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:45,993 INFO L124 PetriNetUnfolderBase]: 40/325 cut-off events. [2023-08-04 09:08:45,993 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:08:45,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 325 events. 40/325 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 888 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 210. Up to 8 conditions per place. [2023-08-04 09:08:45,997 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 09:08:50,689 INFO L134 LiptonReduction]: Checked pairs total: 3210 [2023-08-04 09:08:50,689 INFO L136 LiptonReduction]: Total number of compositions: 178 [2023-08-04 09:08:50,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:08:50,702 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f16a634, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:08:50,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:08:50,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:08:50,709 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2023-08-04 09:08:50,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:08:50,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:08:50,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:08:50,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:08:50,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:08:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash -705519671, now seen corresponding path program 1 times [2023-08-04 09:08:50,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:08:50,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945362090] [2023-08-04 09:08:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:50,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:08:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:50,946 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-04 09:08:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:08:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945362090] [2023-08-04 09:08:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945362090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:08:50,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:08:50,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:08:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649206410] [2023-08-04 09:08:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:08:50,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:08:50,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:08:50,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:08:50,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:08:50,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 363 [2023-08-04 09:08:50,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 34 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:50,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:08:50,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 363 [2023-08-04 09:08:50,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:08:51,091 INFO L124 PetriNetUnfolderBase]: 262/423 cut-off events. [2023-08-04 09:08:51,091 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 09:08:51,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 423 events. 262/423 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1593 event pairs, 119 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 692. Up to 394 conditions per place. [2023-08-04 09:08:51,097 INFO L140 encePairwiseOnDemand]: 359/363 looper letters, 27 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2023-08-04 09:08:51,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 154 flow [2023-08-04 09:08:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:08:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:08:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-08-04 09:08:51,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4674012855831038 [2023-08-04 09:08:51,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-08-04 09:08:51,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-08-04 09:08:51,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:08:51,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-08-04 09:08:51,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,125 INFO L175 Difference]: Start difference. First operand has 31 places, 34 transitions, 90 flow. Second operand 3 states and 509 transitions. [2023-08-04 09:08:51,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 154 flow [2023-08-04 09:08:51,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:08:51,129 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 88 flow [2023-08-04 09:08:51,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-08-04 09:08:51,133 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-04 09:08:51,134 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 88 flow [2023-08-04 09:08:51,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:08:51,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:08:51,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 09:08:51,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:08:51,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:08:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash -840758921, now seen corresponding path program 1 times [2023-08-04 09:08:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:08:51,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818057790] [2023-08-04 09:08:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:08:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:08:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:08:51,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818057790] [2023-08-04 09:08:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818057790] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:08:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899292711] [2023-08-04 09:08:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:08:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:08:51,215 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-04 09:08:51,217 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-04 09:08:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:51,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:08:51,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:08:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:08:51,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:08:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899292711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:08:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:08:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:08:51,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702889342] [2023-08-04 09:08:51,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:08:51,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:08:51,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:08:51,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:08:51,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:08:51,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 363 [2023-08-04 09:08:51,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:08:51,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 363 [2023-08-04 09:08:51,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:08:51,423 INFO L124 PetriNetUnfolderBase]: 259/413 cut-off events. [2023-08-04 09:08:51,423 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-04 09:08:51,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 413 events. 259/413 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1492 event pairs, 85 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 681. Up to 365 conditions per place. [2023-08-04 09:08:51,427 INFO L140 encePairwiseOnDemand]: 360/363 looper letters, 29 selfloop transitions, 2 changer transitions 1/36 dead transitions. [2023-08-04 09:08:51,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 162 flow [2023-08-04 09:08:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:08:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:08:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-08-04 09:08:51,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46831955922865015 [2023-08-04 09:08:51,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-08-04 09:08:51,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-08-04 09:08:51,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:08:51,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-08-04 09:08:51,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,446 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 88 flow. Second operand 3 states and 510 transitions. [2023-08-04 09:08:51,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 162 flow [2023-08-04 09:08:51,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 09:08:51,449 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 86 flow [2023-08-04 09:08:51,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2023-08-04 09:08:51,450 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-04 09:08:51,450 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 86 flow [2023-08-04 09:08:51,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:08:51,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:08:51,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 09:08:51,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:08:51,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:08:51,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:08:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2061339015, now seen corresponding path program 1 times [2023-08-04 09:08:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:08:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334792912] [2023-08-04 09:08:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:08:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:51,760 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-04 09:08:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:08:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334792912] [2023-08-04 09:08:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334792912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:08:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890772057] [2023-08-04 09:08:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:51,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:08:51,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:08:51,763 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-04 09:08:51,794 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-04 09:08:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:51,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:08:51,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:08:51,849 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-04 09:08:51,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:08:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890772057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:08:51,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:08:51,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:08:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017455974] [2023-08-04 09:08:51,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:08:51,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:08:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:08:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:08:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:08:51,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 363 [2023-08-04 09:08:51,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:08:51,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 363 [2023-08-04 09:08:51,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:08:51,930 INFO L124 PetriNetUnfolderBase]: 173/288 cut-off events. [2023-08-04 09:08:51,930 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-04 09:08:51,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 288 events. 173/288 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 903 event pairs, 52 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 347. Up to 197 conditions per place. [2023-08-04 09:08:51,932 INFO L140 encePairwiseOnDemand]: 360/363 looper letters, 33 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-04 09:08:51,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 176 flow [2023-08-04 09:08:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:08:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:08:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-08-04 09:08:51,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2023-08-04 09:08:51,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-08-04 09:08:51,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-08-04 09:08:51,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:08:51,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-08-04 09:08:51,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,938 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 86 flow. Second operand 3 states and 513 transitions. [2023-08-04 09:08:51,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 176 flow [2023-08-04 09:08:51,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:08:51,940 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 94 flow [2023-08-04 09:08:51,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2023-08-04 09:08:51,941 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-04 09:08:51,941 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 94 flow [2023-08-04 09:08:51,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:51,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:08:51,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:08:51,952 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-04 09:08:52,146 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,SelfDestructingSolverStorable2 [2023-08-04 09:08:52,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:08:52,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:08:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash 537723621, now seen corresponding path program 1 times [2023-08-04 09:08:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:08:52,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936524237] [2023-08-04 09:08:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:08:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:08:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:08:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936524237] [2023-08-04 09:08:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936524237] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:08:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648599723] [2023-08-04 09:08:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:08:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:08:52,230 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-04 09:08:52,257 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-04 09:08:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:52,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:08:52,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:08:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:08:52,331 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:08:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648599723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:08:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:08:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:08:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855853231] [2023-08-04 09:08:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:08:52,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:08:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:08:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:08:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:08:52,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 363 [2023-08-04 09:08:52,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:08:52,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 363 [2023-08-04 09:08:52,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:08:52,409 INFO L124 PetriNetUnfolderBase]: 164/275 cut-off events. [2023-08-04 09:08:52,409 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 09:08:52,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 275 events. 164/275 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 852 event pairs, 69 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 343. Up to 232 conditions per place. [2023-08-04 09:08:52,411 INFO L140 encePairwiseOnDemand]: 360/363 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-04 09:08:52,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 170 flow [2023-08-04 09:08:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:08:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:08:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-08-04 09:08:52,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46831955922865015 [2023-08-04 09:08:52,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-08-04 09:08:52,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-08-04 09:08:52,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:08:52,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-08-04 09:08:52,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 363.0) internal successors, (1452), 4 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,416 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 94 flow. Second operand 3 states and 510 transitions. [2023-08-04 09:08:52,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 170 flow [2023-08-04 09:08:52,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:08:52,417 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 96 flow [2023-08-04 09:08:52,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-08-04 09:08:52,418 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-04 09:08:52,418 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 96 flow [2023-08-04 09:08:52,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:08:52,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:08:52,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 09:08:52,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:08:52,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:08:52,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:08:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1100518124, now seen corresponding path program 1 times [2023-08-04 09:08:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:08:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742106097] [2023-08-04 09:08:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:08:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:08:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:08:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742106097] [2023-08-04 09:08:52,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742106097] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:08:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402065935] [2023-08-04 09:08:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:52,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:08:52,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:08:52,687 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-04 09:08:52,688 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-04 09:08:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:08:52,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:08:52,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:08:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:08:52,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:08:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:08:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402065935] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:08:52,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:08:52,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:08:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549454492] [2023-08-04 09:08:52,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:08:52,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:08:52,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:08:52,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:08:52,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:08:52,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 363 [2023-08-04 09:08:52,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 163.2) internal successors, (816), 5 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:08:52,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 363 [2023-08-04 09:08:52,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:08:52,888 INFO L124 PetriNetUnfolderBase]: 10/23 cut-off events. [2023-08-04 09:08:52,888 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 09:08:52,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 23 events. 10/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 1 based on Foata normal form. 3/20 useless extension candidates. Maximal degree in co-relation 48. Up to 13 conditions per place. [2023-08-04 09:08:52,889 INFO L140 encePairwiseOnDemand]: 360/363 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2023-08-04 09:08:52,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 14 transitions, 58 flow [2023-08-04 09:08:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:08:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:08:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2023-08-04 09:08:52,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44490358126721763 [2023-08-04 09:08:52,891 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2023-08-04 09:08:52,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2023-08-04 09:08:52,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:08:52,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2023-08-04 09:08:52,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,897 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,897 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 96 flow. Second operand 4 states and 646 transitions. [2023-08-04 09:08:52,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 14 transitions, 58 flow [2023-08-04 09:08:52,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 14 transitions, 56 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:08:52,898 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 09:08:52,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 09:08:52,898 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -13 predicate places. [2023-08-04 09:08:52,898 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 09:08:52,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.2) internal successors, (816), 5 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:08:52,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:08:52,921 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-04 09:08:53,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:08:53,106 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 09:08:53,108 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 09:08:53,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:53,140 INFO L124 PetriNetUnfolderBase]: 40/325 cut-off events. [2023-08-04 09:08:53,141 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:08:53,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 325 events. 40/325 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 888 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 210. Up to 8 conditions per place. [2023-08-04 09:08:53,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:53,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:53,142 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:08:53,142 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:53,143 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:53,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 185 transitions, 392 flow [2023-08-04 09:08:53,165 INFO L124 PetriNetUnfolderBase]: 40/325 cut-off events. [2023-08-04 09:08:53,165 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:08:53,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 325 events. 40/325 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 888 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 210. Up to 8 conditions per place. [2023-08-04 09:08:53,167 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 09:08:57,539 INFO L134 LiptonReduction]: Checked pairs total: 3254 [2023-08-04 09:08:57,540 INFO L136 LiptonReduction]: Total number of compositions: 181 [2023-08-04 09:08:57,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 09:08:57,542 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f16a634, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:08:57,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 09:08:57,545 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:08:57,545 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-08-04 09:08:57,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:08:57,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:08:57,545 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 09:08:57,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 09:08:57,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:08:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash -59037269, now seen corresponding path program 1 times [2023-08-04 09:08:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:08:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013627028] [2023-08-04 09:08:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:08:57,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:08:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:08:57,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:08:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:08:57,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:08:57,606 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:08:57,606 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 09:08:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 09:08:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 09:08:57,606 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 09:08:57,607 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 09:08:57,607 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 09:08:57,607 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 09:08:57,629 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 09:08:57,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 211 transitions, 470 flow [2023-08-04 09:08:57,706 INFO L124 PetriNetUnfolderBase]: 141/900 cut-off events. [2023-08-04 09:08:57,706 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:08:57,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 900 events. 141/900 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4264 event pairs, 2 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 561. Up to 32 conditions per place. [2023-08-04 09:08:57,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 211 transitions, 470 flow [2023-08-04 09:08:57,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 211 transitions, 470 flow [2023-08-04 09:08:57,714 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:08:57,714 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 211 transitions, 470 flow [2023-08-04 09:08:57,714 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 211 transitions, 470 flow [2023-08-04 09:08:57,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 211 transitions, 470 flow [2023-08-04 09:08:57,790 INFO L124 PetriNetUnfolderBase]: 141/900 cut-off events. [2023-08-04 09:08:57,790 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:08:57,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 900 events. 141/900 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4264 event pairs, 2 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 561. Up to 32 conditions per place. [2023-08-04 09:08:57,805 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 09:09:02,488 INFO L134 LiptonReduction]: Checked pairs total: 9808 [2023-08-04 09:09:02,488 INFO L136 LiptonReduction]: Total number of compositions: 194 [2023-08-04 09:09:02,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:09:02,490 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f16a634, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:09:02,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:09:02,491 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:09:02,491 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2023-08-04 09:09:02,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:09:02,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:02,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:02,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:02,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:02,492 INFO L85 PathProgramCache]: Analyzing trace with hash 371579416, now seen corresponding path program 1 times [2023-08-04 09:09:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:02,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397410842] [2023-08-04 09:09:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:02,515 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-04 09:09:02,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:02,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397410842] [2023-08-04 09:09:02,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397410842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:02,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:02,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:09:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383573324] [2023-08-04 09:09:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:09:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:09:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:09:02,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 405 [2023-08-04 09:09:02,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 48 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:02,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:02,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 405 [2023-08-04 09:09:02,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:03,482 INFO L124 PetriNetUnfolderBase]: 8528/11041 cut-off events. [2023-08-04 09:09:03,482 INFO L125 PetriNetUnfolderBase]: For 1042/1042 co-relation queries the response was YES. [2023-08-04 09:09:03,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22388 conditions, 11041 events. 8528/11041 cut-off events. For 1042/1042 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47452 event pairs, 3472 based on Foata normal form. 0/6250 useless extension candidates. Maximal degree in co-relation 6836. Up to 10604 conditions per place. [2023-08-04 09:09:03,548 INFO L140 encePairwiseOnDemand]: 401/405 looper letters, 39 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-04 09:09:03,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 232 flow [2023-08-04 09:09:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:09:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:09:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2023-08-04 09:09:03,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4674897119341564 [2023-08-04 09:09:03,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2023-08-04 09:09:03,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2023-08-04 09:09:03,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:03,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2023-08-04 09:09:03,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:03,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:03,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:03,555 INFO L175 Difference]: Start difference. First operand has 43 places, 48 transitions, 144 flow. Second operand 3 states and 568 transitions. [2023-08-04 09:09:03,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 232 flow [2023-08-04 09:09:03,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:09:03,560 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 142 flow [2023-08-04 09:09:03,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2023-08-04 09:09:03,561 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-04 09:09:03,561 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 142 flow [2023-08-04 09:09:03,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:03,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:03,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:03,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 09:09:03,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:03,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:03,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1874450823, now seen corresponding path program 1 times [2023-08-04 09:09:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361712669] [2023-08-04 09:09:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:03,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:09:03,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:03,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361712669] [2023-08-04 09:09:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361712669] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553080321] [2023-08-04 09:09:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:03,625 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-04 09:09:03,681 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-04 09:09:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:03,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:09:03,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:09:03,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:09:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553080321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:03,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:09:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:09:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207266730] [2023-08-04 09:09:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:03,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:09:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:03,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:09:03,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:03,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 405 [2023-08-04 09:09:03,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:03,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:03,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 405 [2023-08-04 09:09:03,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:04,622 INFO L124 PetriNetUnfolderBase]: 8490/11018 cut-off events. [2023-08-04 09:09:04,622 INFO L125 PetriNetUnfolderBase]: For 836/836 co-relation queries the response was YES. [2023-08-04 09:09:04,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22268 conditions, 11018 events. 8490/11018 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 49211 event pairs, 3438 based on Foata normal form. 0/6265 useless extension candidates. Maximal degree in co-relation 22230. Up to 10393 conditions per place. [2023-08-04 09:09:04,663 INFO L140 encePairwiseOnDemand]: 402/405 looper letters, 44 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-04 09:09:04,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 250 flow [2023-08-04 09:09:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:09:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:09:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2023-08-04 09:09:04,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699588477366255 [2023-08-04 09:09:04,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2023-08-04 09:09:04,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2023-08-04 09:09:04,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:04,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2023-08-04 09:09:04,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 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-04 09:09:04,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:04,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:04,669 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 142 flow. Second operand 3 states and 571 transitions. [2023-08-04 09:09:04,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 250 flow [2023-08-04 09:09:04,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 09:09:04,673 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 146 flow [2023-08-04 09:09:04,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2023-08-04 09:09:04,674 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-04 09:09:04,674 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 146 flow [2023-08-04 09:09:04,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:04,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:04,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:04,679 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-04 09:09:04,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:04,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:04,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1986891497, now seen corresponding path program 1 times [2023-08-04 09:09:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726752783] [2023-08-04 09:09:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:04,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-04 09:09:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726752783] [2023-08-04 09:09:04,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726752783] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:04,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778844765] [2023-08-04 09:09:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:04,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:04,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:04,949 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-04 09:09:04,951 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-04 09:09:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:05,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:09:05,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:05,034 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-04 09:09:05,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:09:05,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778844765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:05,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:09:05,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:09:05,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437631929] [2023-08-04 09:09:05,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:05,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:09:05,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:05,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:09:05,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:05,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 405 [2023-08-04 09:09:05,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:05,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:05,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 405 [2023-08-04 09:09:05,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:05,702 INFO L124 PetriNetUnfolderBase]: 7285/9576 cut-off events. [2023-08-04 09:09:05,702 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2023-08-04 09:09:05,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19653 conditions, 9576 events. 7285/9576 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 43050 event pairs, 2490 based on Foata normal form. 0/5676 useless extension candidates. Maximal degree in co-relation 6727. Up to 6832 conditions per place. [2023-08-04 09:09:05,736 INFO L140 encePairwiseOnDemand]: 402/405 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-04 09:09:05,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 290 flow [2023-08-04 09:09:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:09:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:09:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2023-08-04 09:09:05,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748971193415638 [2023-08-04 09:09:05,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2023-08-04 09:09:05,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2023-08-04 09:09:05,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:05,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2023-08-04 09:09:05,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:05,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:05,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:05,741 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 146 flow. Second operand 3 states and 577 transitions. [2023-08-04 09:09:05,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 290 flow [2023-08-04 09:09:05,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:05,744 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 156 flow [2023-08-04 09:09:05,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2023-08-04 09:09:05,746 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-04 09:09:05,746 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 156 flow [2023-08-04 09:09:05,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:05,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:05,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:05,753 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-04 09:09:05,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:05,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:05,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1610530756, now seen corresponding path program 1 times [2023-08-04 09:09:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514282274] [2023-08-04 09:09:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:09:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514282274] [2023-08-04 09:09:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514282274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356436663] [2023-08-04 09:09:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:06,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:06,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:06,021 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-04 09:09:06,041 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-04 09:09:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:06,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:09:06,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:09:06,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:09:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356436663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:06,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:09:06,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:09:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783324373] [2023-08-04 09:09:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:06,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:09:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:06,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:09:06,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:06,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 405 [2023-08-04 09:09:06,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:06,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:06,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 405 [2023-08-04 09:09:06,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:06,734 INFO L124 PetriNetUnfolderBase]: 7162/9505 cut-off events. [2023-08-04 09:09:06,735 INFO L125 PetriNetUnfolderBase]: For 1501/1501 co-relation queries the response was YES. [2023-08-04 09:09:06,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20213 conditions, 9505 events. 7162/9505 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 42881 event pairs, 2789 based on Foata normal form. 0/5936 useless extension candidates. Maximal degree in co-relation 7255. Up to 7266 conditions per place. [2023-08-04 09:09:06,765 INFO L140 encePairwiseOnDemand]: 402/405 looper letters, 52 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-04 09:09:06,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 302 flow [2023-08-04 09:09:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:09:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:09:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2023-08-04 09:09:06,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748971193415638 [2023-08-04 09:09:06,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2023-08-04 09:09:06,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2023-08-04 09:09:06,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:06,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2023-08-04 09:09:06,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:06,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:06,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 405.0) internal successors, (1620), 4 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:06,770 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 156 flow. Second operand 3 states and 577 transitions. [2023-08-04 09:09:06,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 302 flow [2023-08-04 09:09:06,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:06,774 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 166 flow [2023-08-04 09:09:06,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2023-08-04 09:09:06,775 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-08-04 09:09:06,775 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 166 flow [2023-08-04 09:09:06,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:06,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:06,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:06,780 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-04 09:09:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:06,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:06,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2100096160, now seen corresponding path program 1 times [2023-08-04 09:09:06,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:06,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792124032] [2023-08-04 09:09:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:06,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:09:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792124032] [2023-08-04 09:09:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792124032] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235356602] [2023-08-04 09:09:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:07,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:07,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:07,024 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:07,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 09:09:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:07,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:09:07,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:09:07,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:09:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235356602] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:07,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:09:07,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327864573] [2023-08-04 09:09:07,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:07,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:07,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 405 [2023-08-04 09:09:07,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:07,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:07,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 405 [2023-08-04 09:09:07,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:07,681 INFO L124 PetriNetUnfolderBase]: 6455/8558 cut-off events. [2023-08-04 09:09:07,681 INFO L125 PetriNetUnfolderBase]: For 1163/1163 co-relation queries the response was YES. [2023-08-04 09:09:07,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18397 conditions, 8558 events. 6455/8558 cut-off events. For 1163/1163 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 38242 event pairs, 1919 based on Foata normal form. 3/5408 useless extension candidates. Maximal degree in co-relation 12370. Up to 8129 conditions per place. [2023-08-04 09:09:07,709 INFO L140 encePairwiseOnDemand]: 401/405 looper letters, 45 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 09:09:07,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 280 flow [2023-08-04 09:09:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:09:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:09:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2023-08-04 09:09:07,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458641975308642 [2023-08-04 09:09:07,711 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 743 transitions. [2023-08-04 09:09:07,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 743 transitions. [2023-08-04 09:09:07,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:07,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 743 transitions. [2023-08-04 09:09:07,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:07,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:07,714 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:07,714 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 166 flow. Second operand 4 states and 743 transitions. [2023-08-04 09:09:07,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 280 flow [2023-08-04 09:09:07,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:07,726 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 178 flow [2023-08-04 09:09:07,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-08-04 09:09:07,727 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-08-04 09:09:07,727 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 178 flow [2023-08-04 09:09:07,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:07,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:07,727 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:07,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 09:09:07,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 09:09:07,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:07,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash -909420161, now seen corresponding path program 1 times [2023-08-04 09:09:07,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129712459] [2023-08-04 09:09:07,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:09:07,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:07,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129712459] [2023-08-04 09:09:07,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129712459] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:07,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597472] [2023-08-04 09:09:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:07,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:07,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:07,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 09:09:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:08,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:09:08,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:09:08,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:09:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597472] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:08,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:08,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:09:08,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693595311] [2023-08-04 09:09:08,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:08,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:08,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:08,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 405 [2023-08-04 09:09:08,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 179.2) internal successors, (896), 5 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:08,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:08,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 405 [2023-08-04 09:09:08,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:08,546 INFO L124 PetriNetUnfolderBase]: 6116/8102 cut-off events. [2023-08-04 09:09:08,546 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2023-08-04 09:09:08,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17367 conditions, 8102 events. 6116/8102 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36518 event pairs, 1699 based on Foata normal form. 27/5132 useless extension candidates. Maximal degree in co-relation 11406. Up to 6556 conditions per place. [2023-08-04 09:09:08,571 INFO L140 encePairwiseOnDemand]: 401/405 looper letters, 53 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 09:09:08,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 324 flow [2023-08-04 09:09:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:09:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:09:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 751 transitions. [2023-08-04 09:09:08,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46358024691358024 [2023-08-04 09:09:08,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 751 transitions. [2023-08-04 09:09:08,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 751 transitions. [2023-08-04 09:09:08,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:08,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 751 transitions. [2023-08-04 09:09:08,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:08,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:08,577 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:08,577 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 178 flow. Second operand 4 states and 751 transitions. [2023-08-04 09:09:08,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 324 flow [2023-08-04 09:09:08,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 315 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:09:08,586 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 183 flow [2023-08-04 09:09:08,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-04 09:09:08,587 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-08-04 09:09:08,587 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 183 flow [2023-08-04 09:09:08,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.2) internal successors, (896), 5 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:08,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:08,588 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:08,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 09:09:08,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:08,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:08,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1609398498, now seen corresponding path program 1 times [2023-08-04 09:09:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730219775] [2023-08-04 09:09:08,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:09:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730219775] [2023-08-04 09:09:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730219775] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20820383] [2023-08-04 09:09:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:08,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:08,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:08,832 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:08,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 09:09:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:08,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:09:08,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:09:08,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:09:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20820383] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:08,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:08,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:09:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205645434] [2023-08-04 09:09:08,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:08,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:08,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 405 [2023-08-04 09:09:08,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:08,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:08,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 405 [2023-08-04 09:09:08,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:09,305 INFO L124 PetriNetUnfolderBase]: 4138/5533 cut-off events. [2023-08-04 09:09:09,305 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2023-08-04 09:09:09,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11988 conditions, 5533 events. 4138/5533 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22874 event pairs, 747 based on Foata normal form. 108/3588 useless extension candidates. Maximal degree in co-relation 10564. Up to 2084 conditions per place. [2023-08-04 09:09:09,324 INFO L140 encePairwiseOnDemand]: 401/405 looper letters, 59 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-04 09:09:09,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 362 flow [2023-08-04 09:09:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:09:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:09:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 757 transitions. [2023-08-04 09:09:09,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46728395061728395 [2023-08-04 09:09:09,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 757 transitions. [2023-08-04 09:09:09,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 757 transitions. [2023-08-04 09:09:09,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:09,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 757 transitions. [2023-08-04 09:09:09,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:09,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:09,336 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:09,336 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 183 flow. Second operand 4 states and 757 transitions. [2023-08-04 09:09:09,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 362 flow [2023-08-04 09:09:09,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 352 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:09:09,343 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 194 flow [2023-08-04 09:09:09,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-08-04 09:09:09,343 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2023-08-04 09:09:09,343 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 194 flow [2023-08-04 09:09:09,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:09,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:09,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:09,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 09:09:09,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 09:09:09,549 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:09,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2038455266, now seen corresponding path program 1 times [2023-08-04 09:09:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675792317] [2023-08-04 09:09:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:09:09,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675792317] [2023-08-04 09:09:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675792317] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:09,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756149656] [2023-08-04 09:09:09,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:09,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:09,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:09,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:09,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 09:09:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:09,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:09:09,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:09:09,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:09:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756149656] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:09,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:09:09,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321093540] [2023-08-04 09:09:09,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:09,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:09,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:09,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:09,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 405 [2023-08-04 09:09:09,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:09,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:09,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 405 [2023-08-04 09:09:09,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:10,141 INFO L124 PetriNetUnfolderBase]: 4122/5506 cut-off events. [2023-08-04 09:09:10,141 INFO L125 PetriNetUnfolderBase]: For 2154/2154 co-relation queries the response was YES. [2023-08-04 09:09:10,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12524 conditions, 5506 events. 4122/5506 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22670 event pairs, 1861 based on Foata normal form. 13/3474 useless extension candidates. Maximal degree in co-relation 11110. Up to 4665 conditions per place. [2023-08-04 09:09:10,156 INFO L140 encePairwiseOnDemand]: 401/405 looper letters, 59 selfloop transitions, 3 changer transitions 2/72 dead transitions. [2023-08-04 09:09:10,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 374 flow [2023-08-04 09:09:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:09:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:09:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 757 transitions. [2023-08-04 09:09:10,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46728395061728395 [2023-08-04 09:09:10,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 757 transitions. [2023-08-04 09:09:10,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 757 transitions. [2023-08-04 09:09:10,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:10,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 757 transitions. [2023-08-04 09:09:10,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:10,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:10,161 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:10,161 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 194 flow. Second operand 4 states and 757 transitions. [2023-08-04 09:09:10,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 374 flow [2023-08-04 09:09:10,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 370 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:10,167 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 198 flow [2023-08-04 09:09:10,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-04 09:09:10,168 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-08-04 09:09:10,168 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 198 flow [2023-08-04 09:09:10,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:10,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:10,168 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:10,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 09:09:10,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 09:09:10,373 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:10,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1682216868, now seen corresponding path program 1 times [2023-08-04 09:09:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:10,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300872009] [2023-08-04 09:09:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 09:09:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300872009] [2023-08-04 09:09:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300872009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:09:10,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440389547] [2023-08-04 09:09:10,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:10,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:09:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:10,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:09:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:09:10,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 405 [2023-08-04 09:09:10,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:10,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:10,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 405 [2023-08-04 09:09:10,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:11,205 INFO L124 PetriNetUnfolderBase]: 5808/7717 cut-off events. [2023-08-04 09:09:11,205 INFO L125 PetriNetUnfolderBase]: For 3997/3997 co-relation queries the response was YES. [2023-08-04 09:09:11,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17931 conditions, 7717 events. 5808/7717 cut-off events. For 3997/3997 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 32982 event pairs, 945 based on Foata normal form. 2/4843 useless extension candidates. Maximal degree in co-relation 17541. Up to 5895 conditions per place. [2023-08-04 09:09:11,226 INFO L140 encePairwiseOnDemand]: 396/405 looper letters, 100 selfloop transitions, 12 changer transitions 2/122 dead transitions. [2023-08-04 09:09:11,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 758 flow [2023-08-04 09:09:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:09:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:09:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 784 transitions. [2023-08-04 09:09:11,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4839506172839506 [2023-08-04 09:09:11,228 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 784 transitions. [2023-08-04 09:09:11,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 784 transitions. [2023-08-04 09:09:11,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:11,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 784 transitions. [2023-08-04 09:09:11,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:11,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:11,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:11,231 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 198 flow. Second operand 4 states and 784 transitions. [2023-08-04 09:09:11,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 758 flow [2023-08-04 09:09:11,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 122 transitions, 734 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-04 09:09:11,241 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 269 flow [2023-08-04 09:09:11,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-08-04 09:09:11,241 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-04 09:09:11,242 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 269 flow [2023-08-04 09:09:11,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:11,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:11,242 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 09:09:11,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:11,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -359864513, now seen corresponding path program 1 times [2023-08-04 09:09:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:11,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244590018] [2023-08-04 09:09:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:09:11,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244590018] [2023-08-04 09:09:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244590018] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:09:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595640127] [2023-08-04 09:09:11,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:11,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:09:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:11,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:09:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:09:11,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:09:11,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 176.25) internal successors, (705), 4 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:11,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:11,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:09:11,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:12,162 INFO L124 PetriNetUnfolderBase]: 6538/9470 cut-off events. [2023-08-04 09:09:12,162 INFO L125 PetriNetUnfolderBase]: For 6613/6613 co-relation queries the response was YES. [2023-08-04 09:09:12,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25452 conditions, 9470 events. 6538/9470 cut-off events. For 6613/6613 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 51354 event pairs, 3451 based on Foata normal form. 870/10340 useless extension candidates. Maximal degree in co-relation 24845. Up to 7254 conditions per place. [2023-08-04 09:09:12,201 INFO L140 encePairwiseOnDemand]: 398/405 looper letters, 49 selfloop transitions, 2 changer transitions 35/94 dead transitions. [2023-08-04 09:09:12,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 94 transitions, 603 flow [2023-08-04 09:09:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:09:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:09:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 748 transitions. [2023-08-04 09:09:12,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4617283950617284 [2023-08-04 09:09:12,203 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 748 transitions. [2023-08-04 09:09:12,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 748 transitions. [2023-08-04 09:09:12,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:12,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 748 transitions. [2023-08-04 09:09:12,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:12,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:12,206 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:12,206 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 269 flow. Second operand 4 states and 748 transitions. [2023-08-04 09:09:12,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 94 transitions, 603 flow [2023-08-04 09:09:12,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 603 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:09:12,227 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 285 flow [2023-08-04 09:09:12,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-08-04 09:09:12,227 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-04 09:09:12,227 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 285 flow [2023-08-04 09:09:12,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.25) internal successors, (705), 4 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:12,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:12,228 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:12,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 09:09:12,228 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:12,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1625483691, now seen corresponding path program 1 times [2023-08-04 09:09:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648275287] [2023-08-04 09:09:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:09:12,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:12,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648275287] [2023-08-04 09:09:12,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648275287] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:12,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424603968] [2023-08-04 09:09:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:12,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:12,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:12,335 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:12,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 09:09:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:12,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 09:09:12,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:09:12,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:09:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424603968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:12,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:09:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-08-04 09:09:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944130597] [2023-08-04 09:09:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:12,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:09:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:09:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-04 09:09:12,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:09:12,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:12,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:12,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:09:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:13,090 INFO L124 PetriNetUnfolderBase]: 5176/7256 cut-off events. [2023-08-04 09:09:13,090 INFO L125 PetriNetUnfolderBase]: For 6597/6597 co-relation queries the response was YES. [2023-08-04 09:09:13,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19775 conditions, 7256 events. 5176/7256 cut-off events. For 6597/6597 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 35151 event pairs, 2561 based on Foata normal form. 435/7691 useless extension candidates. Maximal degree in co-relation 19749. Up to 6026 conditions per place. [2023-08-04 09:09:13,128 INFO L140 encePairwiseOnDemand]: 398/405 looper letters, 45 selfloop transitions, 2 changer transitions 32/87 dead transitions. [2023-08-04 09:09:13,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 567 flow [2023-08-04 09:09:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:09:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:09:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2023-08-04 09:09:13,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604938271604938 [2023-08-04 09:09:13,131 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 746 transitions. [2023-08-04 09:09:13,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 746 transitions. [2023-08-04 09:09:13,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:13,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 746 transitions. [2023-08-04 09:09:13,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.5) internal successors, (746), 4 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:13,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:13,139 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 405.0) internal successors, (2025), 5 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:13,139 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 285 flow. Second operand 4 states and 746 transitions. [2023-08-04 09:09:13,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 567 flow [2023-08-04 09:09:13,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 555 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-04 09:09:13,152 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 253 flow [2023-08-04 09:09:13,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-08-04 09:09:13,153 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-04 09:09:13,153 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 253 flow [2023-08-04 09:09:13,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:13,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:13,153 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:13,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 09:09:13,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 09:09:13,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:13,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:13,358 INFO L85 PathProgramCache]: Analyzing trace with hash -284123433, now seen corresponding path program 1 times [2023-08-04 09:09:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304141999] [2023-08-04 09:09:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:13,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:09:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304141999] [2023-08-04 09:09:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304141999] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306134758] [2023-08-04 09:09:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:13,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:13,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 09:09:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:13,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:09:13,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:09:13,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:09:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306134758] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:13,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:13,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 09:09:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591504481] [2023-08-04 09:09:13,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:13,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:09:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:13,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:09:13,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:09:13,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:09:13,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 253 flow. Second operand has 8 states, 8 states have (on average 174.25) internal successors, (1394), 8 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:13,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:13,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:09:13,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:14,550 INFO L124 PetriNetUnfolderBase]: 8326/11132 cut-off events. [2023-08-04 09:09:14,550 INFO L125 PetriNetUnfolderBase]: For 7228/7228 co-relation queries the response was YES. [2023-08-04 09:09:14,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30241 conditions, 11132 events. 8326/11132 cut-off events. For 7228/7228 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 53744 event pairs, 871 based on Foata normal form. 196/11328 useless extension candidates. Maximal degree in co-relation 30203. Up to 4866 conditions per place. [2023-08-04 09:09:14,595 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 140 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2023-08-04 09:09:14,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 151 transitions, 997 flow [2023-08-04 09:09:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 969 transitions. [2023-08-04 09:09:14,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785185185185185 [2023-08-04 09:09:14,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 969 transitions. [2023-08-04 09:09:14,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 969 transitions. [2023-08-04 09:09:14,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:14,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 969 transitions. [2023-08-04 09:09:14,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:14,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:14,601 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:14,601 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 253 flow. Second operand 5 states and 969 transitions. [2023-08-04 09:09:14,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 151 transitions, 997 flow [2023-08-04 09:09:14,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 151 transitions, 985 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-04 09:09:14,617 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 280 flow [2023-08-04 09:09:14,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2023-08-04 09:09:14,617 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-08-04 09:09:14,618 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 280 flow [2023-08-04 09:09:14,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 174.25) internal successors, (1394), 8 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:14,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:14,618 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:14,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 09:09:14,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 09:09:14,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:14,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1985597407, now seen corresponding path program 1 times [2023-08-04 09:09:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80558250] [2023-08-04 09:09:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:09:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:14,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80558250] [2023-08-04 09:09:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80558250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:14,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:09:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568212460] [2023-08-04 09:09:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:14,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:14,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:09:14,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:14,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:14,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:09:14,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:16,222 INFO L124 PetriNetUnfolderBase]: 13306/18237 cut-off events. [2023-08-04 09:09:16,222 INFO L125 PetriNetUnfolderBase]: For 20662/20662 co-relation queries the response was YES. [2023-08-04 09:09:16,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54269 conditions, 18237 events. 13306/18237 cut-off events. For 20662/20662 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 99400 event pairs, 3385 based on Foata normal form. 184/18421 useless extension candidates. Maximal degree in co-relation 54229. Up to 8250 conditions per place. [2023-08-04 09:09:16,317 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 144 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2023-08-04 09:09:16,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 157 transitions, 1082 flow [2023-08-04 09:09:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 976 transitions. [2023-08-04 09:09:16,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819753086419753 [2023-08-04 09:09:16,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 976 transitions. [2023-08-04 09:09:16,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 976 transitions. [2023-08-04 09:09:16,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:16,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 976 transitions. [2023-08-04 09:09:16,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.2) internal successors, (976), 5 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:16,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:16,323 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:16,323 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 280 flow. Second operand 5 states and 976 transitions. [2023-08-04 09:09:16,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 157 transitions, 1082 flow [2023-08-04 09:09:16,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 1077 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:16,370 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 324 flow [2023-08-04 09:09:16,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2023-08-04 09:09:16,371 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-08-04 09:09:16,371 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 324 flow [2023-08-04 09:09:16,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:16,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:16,371 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:16,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 09:09:16,371 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:16,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1643656278, now seen corresponding path program 1 times [2023-08-04 09:09:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121999722] [2023-08-04 09:09:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:09:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:16,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121999722] [2023-08-04 09:09:16,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121999722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:16,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:16,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:09:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361875535] [2023-08-04 09:09:16,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:16,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:16,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:16,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:16,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:09:16,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:16,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:16,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:09:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:18,047 INFO L124 PetriNetUnfolderBase]: 14282/19982 cut-off events. [2023-08-04 09:09:18,047 INFO L125 PetriNetUnfolderBase]: For 36371/36371 co-relation queries the response was YES. [2023-08-04 09:09:18,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64549 conditions, 19982 events. 14282/19982 cut-off events. For 36371/36371 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 113841 event pairs, 4128 based on Foata normal form. 184/20166 useless extension candidates. Maximal degree in co-relation 64506. Up to 8874 conditions per place. [2023-08-04 09:09:18,132 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 155 selfloop transitions, 6 changer transitions 0/167 dead transitions. [2023-08-04 09:09:18,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 167 transitions, 1202 flow [2023-08-04 09:09:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 980 transitions. [2023-08-04 09:09:18,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4839506172839506 [2023-08-04 09:09:18,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 980 transitions. [2023-08-04 09:09:18,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 980 transitions. [2023-08-04 09:09:18,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:18,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 980 transitions. [2023-08-04 09:09:18,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:18,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:18,138 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:18,138 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 324 flow. Second operand 5 states and 980 transitions. [2023-08-04 09:09:18,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 167 transitions, 1202 flow [2023-08-04 09:09:18,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 167 transitions, 1167 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:18,228 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 347 flow [2023-08-04 09:09:18,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2023-08-04 09:09:18,228 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-08-04 09:09:18,229 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 347 flow [2023-08-04 09:09:18,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:18,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:18,229 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:18,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 09:09:18,229 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:18,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1030161371, now seen corresponding path program 2 times [2023-08-04 09:09:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148399874] [2023-08-04 09:09:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:09:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:18,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148399874] [2023-08-04 09:09:18,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148399874] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:18,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249520061] [2023-08-04 09:09:18,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:09:18,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:18,293 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:18,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 09:09:18,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:09:18,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:09:18,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:09:18,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:09:18,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:09:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249520061] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:18,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:18,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 09:09:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079339097] [2023-08-04 09:09:18,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:18,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 09:09:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:18,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 09:09:18,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:09:18,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:09:18,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 347 flow. Second operand has 10 states, 10 states have (on average 173.4) internal successors, (1734), 10 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:18,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:18,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:09:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:20,874 INFO L124 PetriNetUnfolderBase]: 18604/25923 cut-off events. [2023-08-04 09:09:20,874 INFO L125 PetriNetUnfolderBase]: For 55887/55887 co-relation queries the response was YES. [2023-08-04 09:09:20,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87830 conditions, 25923 events. 18604/25923 cut-off events. For 55887/55887 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 151716 event pairs, 6479 based on Foata normal form. 196/26118 useless extension candidates. Maximal degree in co-relation 87784. Up to 9023 conditions per place. [2023-08-04 09:09:20,988 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 147 selfloop transitions, 13 changer transitions 0/166 dead transitions. [2023-08-04 09:09:20,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 166 transitions, 1230 flow [2023-08-04 09:09:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 972 transitions. [2023-08-04 09:09:20,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-04 09:09:20,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 972 transitions. [2023-08-04 09:09:20,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 972 transitions. [2023-08-04 09:09:20,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:20,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 972 transitions. [2023-08-04 09:09:20,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:20,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:20,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:20,993 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 347 flow. Second operand 5 states and 972 transitions. [2023-08-04 09:09:20,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 166 transitions, 1230 flow [2023-08-04 09:09:21,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 166 transitions, 1198 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-04 09:09:21,118 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 433 flow [2023-08-04 09:09:21,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2023-08-04 09:09:21,118 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-08-04 09:09:21,118 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 433 flow [2023-08-04 09:09:21,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 173.4) internal successors, (1734), 10 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:21,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:21,119 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:21,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-04 09:09:21,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:21,319 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:21,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash -108929384, now seen corresponding path program 2 times [2023-08-04 09:09:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112490206] [2023-08-04 09:09:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:09:21,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:21,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112490206] [2023-08-04 09:09:21,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112490206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:21,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:21,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:09:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429719481] [2023-08-04 09:09:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:21,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:21,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 405 [2023-08-04 09:09:21,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 433 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:21,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:21,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 405 [2023-08-04 09:09:21,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:24,851 INFO L124 PetriNetUnfolderBase]: 24291/34860 cut-off events. [2023-08-04 09:09:24,851 INFO L125 PetriNetUnfolderBase]: For 102467/104281 co-relation queries the response was YES. [2023-08-04 09:09:24,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124654 conditions, 34860 events. 24291/34860 cut-off events. For 102467/104281 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 226114 event pairs, 4115 based on Foata normal form. 3056/37635 useless extension candidates. Maximal degree in co-relation 124605. Up to 10211 conditions per place. [2023-08-04 09:09:25,038 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 174 selfloop transitions, 22 changer transitions 0/204 dead transitions. [2023-08-04 09:09:25,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 204 transitions, 1637 flow [2023-08-04 09:09:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 09:09:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 09:09:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1158 transitions. [2023-08-04 09:09:25,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765432098765432 [2023-08-04 09:09:25,041 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1158 transitions. [2023-08-04 09:09:25,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1158 transitions. [2023-08-04 09:09:25,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:25,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1158 transitions. [2023-08-04 09:09:25,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:25,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 405.0) internal successors, (2835), 7 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:25,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 405.0) internal successors, (2835), 7 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:25,044 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 433 flow. Second operand 6 states and 1158 transitions. [2023-08-04 09:09:25,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 204 transitions, 1637 flow [2023-08-04 09:09:25,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 204 transitions, 1586 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:25,295 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 569 flow [2023-08-04 09:09:25,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2023-08-04 09:09:25,296 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2023-08-04 09:09:25,296 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 569 flow [2023-08-04 09:09:25,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:25,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:25,296 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:25,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-04 09:09:25,296 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:25,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:25,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1970315246, now seen corresponding path program 3 times [2023-08-04 09:09:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789484287] [2023-08-04 09:09:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:09:25,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:25,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789484287] [2023-08-04 09:09:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789484287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:09:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241173991] [2023-08-04 09:09:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:25,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:25,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:09:25,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 569 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:25,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:25,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:09:25,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:28,820 INFO L124 PetriNetUnfolderBase]: 24457/35155 cut-off events. [2023-08-04 09:09:28,820 INFO L125 PetriNetUnfolderBase]: For 111073/112068 co-relation queries the response was YES. [2023-08-04 09:09:28,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136913 conditions, 35155 events. 24457/35155 cut-off events. For 111073/112068 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 231846 event pairs, 4344 based on Foata normal form. 1007/35539 useless extension candidates. Maximal degree in co-relation 136862. Up to 23759 conditions per place. [2023-08-04 09:09:29,087 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 148 selfloop transitions, 17 changer transitions 0/173 dead transitions. [2023-08-04 09:09:29,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 1394 flow [2023-08-04 09:09:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 975 transitions. [2023-08-04 09:09:29,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2023-08-04 09:09:29,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 975 transitions. [2023-08-04 09:09:29,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 975 transitions. [2023-08-04 09:09:29,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:29,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 975 transitions. [2023-08-04 09:09:29,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:29,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:29,094 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:29,094 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 569 flow. Second operand 5 states and 975 transitions. [2023-08-04 09:09:29,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 1394 flow [2023-08-04 09:09:29,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 173 transitions, 1390 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 09:09:29,398 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 639 flow [2023-08-04 09:09:29,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=639, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2023-08-04 09:09:29,398 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2023-08-04 09:09:29,399 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 639 flow [2023-08-04 09:09:29,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:29,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:29,399 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-04 09:09:29,399 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:29,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1252654613, now seen corresponding path program 1 times [2023-08-04 09:09:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056475638] [2023-08-04 09:09:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:09:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056475638] [2023-08-04 09:09:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056475638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:09:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245312350] [2023-08-04 09:09:29,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:29,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:29,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:29,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:29,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:09:29,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 639 flow. Second operand has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:29,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:29,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:09:29,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:33,809 INFO L124 PetriNetUnfolderBase]: 27931/41208 cut-off events. [2023-08-04 09:09:33,809 INFO L125 PetriNetUnfolderBase]: For 170426/171994 co-relation queries the response was YES. [2023-08-04 09:09:34,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160921 conditions, 41208 events. 27931/41208 cut-off events. For 170426/171994 co-relation queries the response was YES. Maximal size of possible extension queue 1410. Compared 286775 event pairs, 7134 based on Foata normal form. 1921/42901 useless extension candidates. Maximal degree in co-relation 160867. Up to 15055 conditions per place. [2023-08-04 09:09:34,178 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 194 selfloop transitions, 13 changer transitions 0/215 dead transitions. [2023-08-04 09:09:34,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 215 transitions, 1943 flow [2023-08-04 09:09:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 977 transitions. [2023-08-04 09:09:34,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48246913580246914 [2023-08-04 09:09:34,180 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 977 transitions. [2023-08-04 09:09:34,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 977 transitions. [2023-08-04 09:09:34,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:34,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 977 transitions. [2023-08-04 09:09:34,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.4) internal successors, (977), 5 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:34,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:34,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:34,184 INFO L175 Difference]: Start difference. First operand has 99 places, 84 transitions, 639 flow. Second operand 5 states and 977 transitions. [2023-08-04 09:09:34,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 215 transitions, 1943 flow [2023-08-04 09:09:35,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 215 transitions, 1903 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-04 09:09:35,027 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 676 flow [2023-08-04 09:09:35,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=676, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2023-08-04 09:09:35,028 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2023-08-04 09:09:35,028 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 676 flow [2023-08-04 09:09:35,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:35,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:35,028 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:35,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-04 09:09:35,028 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:35,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -334703236, now seen corresponding path program 1 times [2023-08-04 09:09:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836819495] [2023-08-04 09:09:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:09:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836819495] [2023-08-04 09:09:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836819495] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949614243] [2023-08-04 09:09:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:35,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:35,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:35,080 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:35,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 09:09:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:35,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:09:35,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:09:35,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:09:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949614243] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:35,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 09:09:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856940914] [2023-08-04 09:09:35,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:09:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:09:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:09:35,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:09:35,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 676 flow. Second operand has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:35,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:35,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:09:35,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:39,361 INFO L124 PetriNetUnfolderBase]: 28386/41994 cut-off events. [2023-08-04 09:09:39,362 INFO L125 PetriNetUnfolderBase]: For 189037/191518 co-relation queries the response was YES. [2023-08-04 09:09:39,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169536 conditions, 41994 events. 28386/41994 cut-off events. For 189037/191518 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 290583 event pairs, 11283 based on Foata normal form. 2898/44611 useless extension candidates. Maximal degree in co-relation 169480. Up to 28135 conditions per place. [2023-08-04 09:09:39,607 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 152 selfloop transitions, 17 changer transitions 1/179 dead transitions. [2023-08-04 09:09:39,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 179 transitions, 1559 flow [2023-08-04 09:09:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 962 transitions. [2023-08-04 09:09:39,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750617283950617 [2023-08-04 09:09:39,610 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 962 transitions. [2023-08-04 09:09:39,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 962 transitions. [2023-08-04 09:09:39,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:39,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 962 transitions. [2023-08-04 09:09:39,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.4) internal successors, (962), 5 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:39,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:39,613 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:39,613 INFO L175 Difference]: Start difference. First operand has 103 places, 87 transitions, 676 flow. Second operand 5 states and 962 transitions. [2023-08-04 09:09:39,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 179 transitions, 1559 flow [2023-08-04 09:09:40,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 179 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:09:40,197 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 731 flow [2023-08-04 09:09:40,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=731, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2023-08-04 09:09:40,198 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2023-08-04 09:09:40,198 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 731 flow [2023-08-04 09:09:40,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:40,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:40,198 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:40,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-04 09:09:40,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:40,402 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:40,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1892229367, now seen corresponding path program 2 times [2023-08-04 09:09:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:40,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140615859] [2023-08-04 09:09:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:09:40,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:40,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140615859] [2023-08-04 09:09:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140615859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:09:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667360554] [2023-08-04 09:09:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:40,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:40,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 405 [2023-08-04 09:09:40,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 731 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:40,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:40,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 405 [2023-08-04 09:09:40,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:45,973 INFO L124 PetriNetUnfolderBase]: 33731/50203 cut-off events. [2023-08-04 09:09:45,973 INFO L125 PetriNetUnfolderBase]: For 255340/257062 co-relation queries the response was YES. [2023-08-04 09:09:46,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210089 conditions, 50203 events. 33731/50203 cut-off events. For 255340/257062 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 368318 event pairs, 7570 based on Foata normal form. 2738/52834 useless extension candidates. Maximal degree in co-relation 210031. Up to 16383 conditions per place. [2023-08-04 09:09:46,302 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 181 selfloop transitions, 29 changer transitions 0/218 dead transitions. [2023-08-04 09:09:46,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 218 transitions, 2133 flow [2023-08-04 09:09:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 970 transitions. [2023-08-04 09:09:46,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47901234567901235 [2023-08-04 09:09:46,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 970 transitions. [2023-08-04 09:09:46,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 970 transitions. [2023-08-04 09:09:46,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:46,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 970 transitions. [2023-08-04 09:09:46,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:46,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:46,307 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:46,307 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 731 flow. Second operand 5 states and 970 transitions. [2023-08-04 09:09:46,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 218 transitions, 2133 flow [2023-08-04 09:09:47,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 218 transitions, 2073 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-04 09:09:47,630 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 994 flow [2023-08-04 09:09:47,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=994, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2023-08-04 09:09:47,630 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places. [2023-08-04 09:09:47,630 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 994 flow [2023-08-04 09:09:47,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:47,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:47,631 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:47,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-04 09:09:47,631 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:47,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash -679524487, now seen corresponding path program 1 times [2023-08-04 09:09:47,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:47,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972411417] [2023-08-04 09:09:47,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:47,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:09:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972411417] [2023-08-04 09:09:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972411417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:09:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283291104] [2023-08-04 09:09:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:47,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:09:47,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:09:47,685 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:09:47,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 09:09:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:47,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:09:47,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:09:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:09:47,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:09:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:09:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283291104] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:09:47,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:09:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 09:09:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95875397] [2023-08-04 09:09:47,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:09:47,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:09:47,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:47,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:09:47,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:09:47,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:09:47,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 994 flow. Second operand has 8 states, 8 states have (on average 173.875) internal successors, (1391), 8 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:47,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:47,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:09:47,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:09:54,799 INFO L124 PetriNetUnfolderBase]: 45335/66938 cut-off events. [2023-08-04 09:09:54,799 INFO L125 PetriNetUnfolderBase]: For 413070/423739 co-relation queries the response was YES. [2023-08-04 09:09:55,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310733 conditions, 66938 events. 45335/66938 cut-off events. For 413070/423739 co-relation queries the response was YES. Maximal size of possible extension queue 2027. Compared 486945 event pairs, 8185 based on Foata normal form. 7197/73003 useless extension candidates. Maximal degree in co-relation 310672. Up to 39021 conditions per place. [2023-08-04 09:09:55,564 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 179 selfloop transitions, 23 changer transitions 0/213 dead transitions. [2023-08-04 09:09:55,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 213 transitions, 2234 flow [2023-08-04 09:09:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:09:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:09:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 954 transitions. [2023-08-04 09:09:55,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711111111111111 [2023-08-04 09:09:55,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 954 transitions. [2023-08-04 09:09:55,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 954 transitions. [2023-08-04 09:09:55,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:09:55,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 954 transitions. [2023-08-04 09:09:55,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:55,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:55,569 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:55,569 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 994 flow. Second operand 5 states and 954 transitions. [2023-08-04 09:09:55,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 213 transitions, 2234 flow [2023-08-04 09:09:58,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 213 transitions, 2205 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-04 09:09:58,184 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 1087 flow [2023-08-04 09:09:58,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1087, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2023-08-04 09:09:58,184 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places. [2023-08-04 09:09:58,184 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 1087 flow [2023-08-04 09:09:58,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 173.875) internal successors, (1391), 8 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:58,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:09:58,185 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:09:58,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 09:09:58,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-04 09:09:58,386 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:09:58,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:09:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1855494954, now seen corresponding path program 1 times [2023-08-04 09:09:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:09:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210409580] [2023-08-04 09:09:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:09:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:09:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:09:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:09:58,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:09:58,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210409580] [2023-08-04 09:09:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210409580] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:09:58,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:09:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:09:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457783655] [2023-08-04 09:09:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:09:58,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:09:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:09:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:09:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:09:58,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:09:58,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 1087 flow. Second operand has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:09:58,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:09:58,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:09:58,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:10:07,354 INFO L124 PetriNetUnfolderBase]: 53030/80728 cut-off events. [2023-08-04 09:10:07,354 INFO L125 PetriNetUnfolderBase]: For 622761/637782 co-relation queries the response was YES. [2023-08-04 09:10:07,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387216 conditions, 80728 events. 53030/80728 cut-off events. For 622761/637782 co-relation queries the response was YES. Maximal size of possible extension queue 2687. Compared 634332 event pairs, 13102 based on Foata normal form. 11555/91516 useless extension candidates. Maximal degree in co-relation 387152. Up to 28027 conditions per place. [2023-08-04 09:10:08,063 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 205 selfloop transitions, 17 changer transitions 8/248 dead transitions. [2023-08-04 09:10:08,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 248 transitions, 2738 flow [2023-08-04 09:10:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:10:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:10:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 975 transitions. [2023-08-04 09:10:08,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2023-08-04 09:10:08,065 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 975 transitions. [2023-08-04 09:10:08,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 975 transitions. [2023-08-04 09:10:08,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:10:08,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 975 transitions. [2023-08-04 09:10:08,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:08,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:08,068 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:08,068 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 1087 flow. Second operand 5 states and 975 transitions. [2023-08-04 09:10:08,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 248 transitions, 2738 flow [2023-08-04 09:10:11,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 248 transitions, 2697 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-04 09:10:11,296 INFO L231 Difference]: Finished difference. Result has 123 places, 110 transitions, 1120 flow [2023-08-04 09:10:11,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1120, PETRI_PLACES=123, PETRI_TRANSITIONS=110} [2023-08-04 09:10:11,296 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places. [2023-08-04 09:10:11,296 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 1120 flow [2023-08-04 09:10:11,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:11,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:10:11,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:10:11,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-04 09:10:11,297 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:10:11,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:10:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1221166178, now seen corresponding path program 2 times [2023-08-04 09:10:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:10:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403026185] [2023-08-04 09:10:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:10:11,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:10:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:10:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:10:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:10:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403026185] [2023-08-04 09:10:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403026185] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:10:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762106648] [2023-08-04 09:10:11,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:10:11,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:10:11,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:10:11,350 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:10:11,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 09:10:11,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:10:11,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:10:11,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:10:11,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:10:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:10:11,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:10:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:10:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762106648] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:10:11,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:10:11,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 09:10:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718680593] [2023-08-04 09:10:11,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:10:11,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 09:10:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:10:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 09:10:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:10:11,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:10:11,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 110 transitions, 1120 flow. Second operand has 10 states, 10 states have (on average 173.7) internal successors, (1737), 10 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:11,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:10:11,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:10:11,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:10:20,614 INFO L124 PetriNetUnfolderBase]: 53802/81833 cut-off events. [2023-08-04 09:10:20,614 INFO L125 PetriNetUnfolderBase]: For 622214/627980 co-relation queries the response was YES. [2023-08-04 09:10:21,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401885 conditions, 81833 events. 53802/81833 cut-off events. For 622214/627980 co-relation queries the response was YES. Maximal size of possible extension queue 2709. Compared 649574 event pairs, 12983 based on Foata normal form. 6102/86613 useless extension candidates. Maximal degree in co-relation 401819. Up to 29074 conditions per place. [2023-08-04 09:10:21,642 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 181 selfloop transitions, 36 changer transitions 1/229 dead transitions. [2023-08-04 09:10:21,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 229 transitions, 2548 flow [2023-08-04 09:10:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:10:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:10:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 963 transitions. [2023-08-04 09:10:21,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47555555555555556 [2023-08-04 09:10:21,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 963 transitions. [2023-08-04 09:10:21,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 963 transitions. [2023-08-04 09:10:21,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:10:21,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 963 transitions. [2023-08-04 09:10:21,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:21,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:21,648 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:21,648 INFO L175 Difference]: Start difference. First operand has 123 places, 110 transitions, 1120 flow. Second operand 5 states and 963 transitions. [2023-08-04 09:10:21,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 229 transitions, 2548 flow [2023-08-04 09:10:26,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 229 transitions, 2483 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 09:10:26,044 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 1461 flow [2023-08-04 09:10:26,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1461, PETRI_PLACES=128, PETRI_TRANSITIONS=125} [2023-08-04 09:10:26,044 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places. [2023-08-04 09:10:26,044 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 1461 flow [2023-08-04 09:10:26,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 173.7) internal successors, (1737), 10 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:26,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:10:26,045 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:10:26,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 09:10:26,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-04 09:10:26,248 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:10:26,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:10:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 841930945, now seen corresponding path program 3 times [2023-08-04 09:10:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:10:26,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289132519] [2023-08-04 09:10:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:10:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:10:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:10:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 09:10:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:10:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289132519] [2023-08-04 09:10:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289132519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:10:26,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:10:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:10:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488492553] [2023-08-04 09:10:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:10:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:10:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:10:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:10:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:10:26,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 405 [2023-08-04 09:10:26,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 1461 flow. Second operand has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:26,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:10:26,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 405 [2023-08-04 09:10:26,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:10:36,708 INFO L124 PetriNetUnfolderBase]: 57642/87740 cut-off events. [2023-08-04 09:10:36,709 INFO L125 PetriNetUnfolderBase]: For 729517/735754 co-relation queries the response was YES. [2023-08-04 09:10:37,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447246 conditions, 87740 events. 57642/87740 cut-off events. For 729517/735754 co-relation queries the response was YES. Maximal size of possible extension queue 2924. Compared 703166 event pairs, 14162 based on Foata normal form. 5699/91793 useless extension candidates. Maximal degree in co-relation 447177. Up to 35581 conditions per place. [2023-08-04 09:10:37,596 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 183 selfloop transitions, 47 changer transitions 0/243 dead transitions. [2023-08-04 09:10:37,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 243 transitions, 2912 flow [2023-08-04 09:10:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:10:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:10:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 968 transitions. [2023-08-04 09:10:37,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47802469135802467 [2023-08-04 09:10:37,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 968 transitions. [2023-08-04 09:10:37,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 968 transitions. [2023-08-04 09:10:37,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:10:37,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 968 transitions. [2023-08-04 09:10:37,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 193.6) internal successors, (968), 5 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:37,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:37,601 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:37,601 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 1461 flow. Second operand 5 states and 968 transitions. [2023-08-04 09:10:37,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 243 transitions, 2912 flow [2023-08-04 09:10:43,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 243 transitions, 2806 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-04 09:10:43,262 INFO L231 Difference]: Finished difference. Result has 133 places, 145 transitions, 1862 flow [2023-08-04 09:10:43,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1862, PETRI_PLACES=133, PETRI_TRANSITIONS=145} [2023-08-04 09:10:43,262 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2023-08-04 09:10:43,263 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 145 transitions, 1862 flow [2023-08-04 09:10:43,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:43,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:10:43,263 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:10:43,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-04 09:10:43,263 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:10:43,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:10:43,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2057162599, now seen corresponding path program 4 times [2023-08-04 09:10:43,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:10:43,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261871375] [2023-08-04 09:10:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:10:43,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:10:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:10:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 09:10:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:10:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261871375] [2023-08-04 09:10:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261871375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:10:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:10:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:10:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077245318] [2023-08-04 09:10:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:10:43,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:10:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:10:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:10:43,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:10:43,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:10:43,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 145 transitions, 1862 flow. Second operand has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:43,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:10:43,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:10:43,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:10:54,086 INFO L124 PetriNetUnfolderBase]: 58398/88961 cut-off events. [2023-08-04 09:10:54,086 INFO L125 PetriNetUnfolderBase]: For 823050/830358 co-relation queries the response was YES. [2023-08-04 09:10:54,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463106 conditions, 88961 events. 58398/88961 cut-off events. For 823050/830358 co-relation queries the response was YES. Maximal size of possible extension queue 2980. Compared 707548 event pairs, 19223 based on Foata normal form. 7133/94406 useless extension candidates. Maximal degree in co-relation 463034. Up to 50990 conditions per place. [2023-08-04 09:10:54,997 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 187 selfloop transitions, 41 changer transitions 1/242 dead transitions. [2023-08-04 09:10:54,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 242 transitions, 3051 flow [2023-08-04 09:10:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:10:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:10:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 966 transitions. [2023-08-04 09:10:54,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47703703703703704 [2023-08-04 09:10:54,999 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 966 transitions. [2023-08-04 09:10:54,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 966 transitions. [2023-08-04 09:10:54,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:10:54,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 966 transitions. [2023-08-04 09:10:55,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 193.2) internal successors, (966), 5 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:55,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:55,003 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:55,003 INFO L175 Difference]: Start difference. First operand has 133 places, 145 transitions, 1862 flow. Second operand 5 states and 966 transitions. [2023-08-04 09:10:55,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 242 transitions, 3051 flow [2023-08-04 09:10:58,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 242 transitions, 3023 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-08-04 09:10:58,957 INFO L231 Difference]: Finished difference. Result has 139 places, 151 transitions, 2058 flow [2023-08-04 09:10:58,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2058, PETRI_PLACES=139, PETRI_TRANSITIONS=151} [2023-08-04 09:10:58,958 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places. [2023-08-04 09:10:58,958 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 151 transitions, 2058 flow [2023-08-04 09:10:58,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:58,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:10:58,958 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:10:58,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-04 09:10:58,958 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:10:58,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:10:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1901934848, now seen corresponding path program 2 times [2023-08-04 09:10:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:10:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803081301] [2023-08-04 09:10:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:10:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:10:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:10:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:10:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:10:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803081301] [2023-08-04 09:10:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803081301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:10:59,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:10:59,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:10:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313135408] [2023-08-04 09:10:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:10:59,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:10:59,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:10:59,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:10:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:10:59,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:10:59,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 151 transitions, 2058 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:10:59,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:10:59,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:10:59,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:11:14,263 INFO L124 PetriNetUnfolderBase]: 69437/109154 cut-off events. [2023-08-04 09:11:14,264 INFO L125 PetriNetUnfolderBase]: For 1073371/1089199 co-relation queries the response was YES. [2023-08-04 09:11:14,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567985 conditions, 109154 events. 69437/109154 cut-off events. For 1073371/1089199 co-relation queries the response was YES. Maximal size of possible extension queue 3587. Compared 935515 event pairs, 16466 based on Foata normal form. 10813/119448 useless extension candidates. Maximal degree in co-relation 567910. Up to 35757 conditions per place. [2023-08-04 09:11:15,285 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 232 selfloop transitions, 29 changer transitions 8/295 dead transitions. [2023-08-04 09:11:15,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 295 transitions, 4085 flow [2023-08-04 09:11:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:11:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:11:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 971 transitions. [2023-08-04 09:11:15,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4795061728395062 [2023-08-04 09:11:15,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 971 transitions. [2023-08-04 09:11:15,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 971 transitions. [2023-08-04 09:11:15,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:11:15,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 971 transitions. [2023-08-04 09:11:15,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:15,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:15,290 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:15,290 INFO L175 Difference]: Start difference. First operand has 139 places, 151 transitions, 2058 flow. Second operand 5 states and 971 transitions. [2023-08-04 09:11:15,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 295 transitions, 4085 flow [2023-08-04 09:11:25,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 295 transitions, 4001 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-04 09:11:25,703 INFO L231 Difference]: Finished difference. Result has 143 places, 153 transitions, 2089 flow [2023-08-04 09:11:25,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2089, PETRI_PLACES=143, PETRI_TRANSITIONS=153} [2023-08-04 09:11:25,703 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2023-08-04 09:11:25,703 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 153 transitions, 2089 flow [2023-08-04 09:11:25,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:25,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:11:25,704 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:11:25,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-04 09:11:25,704 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:11:25,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:11:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -770229528, now seen corresponding path program 4 times [2023-08-04 09:11:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:11:25,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464527456] [2023-08-04 09:11:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:11:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:11:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:11:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:11:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:11:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464527456] [2023-08-04 09:11:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464527456] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:11:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246510386] [2023-08-04 09:11:25,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 09:11:25,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:11:25,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:11:25,751 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:11:25,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-04 09:11:25,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 09:11:25,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:11:25,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:11:25,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:11:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:11:25,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:11:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:11:25,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246510386] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:11:25,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:11:25,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 09:11:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647171747] [2023-08-04 09:11:25,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:11:25,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 09:11:25,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:11:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 09:11:25,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:11:25,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:11:25,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 153 transitions, 2089 flow. Second operand has 10 states, 10 states have (on average 173.5) internal successors, (1735), 10 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:25,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:11:25,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:11:25,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:11:38,776 INFO L124 PetriNetUnfolderBase]: 65814/103035 cut-off events. [2023-08-04 09:11:38,776 INFO L125 PetriNetUnfolderBase]: For 1122825/1129731 co-relation queries the response was YES. [2023-08-04 09:11:39,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557153 conditions, 103035 events. 65814/103035 cut-off events. For 1122825/1129731 co-relation queries the response was YES. Maximal size of possible extension queue 3473. Compared 876504 event pairs, 19290 based on Foata normal form. 7134/108079 useless extension candidates. Maximal degree in co-relation 557076. Up to 45200 conditions per place. [2023-08-04 09:11:40,070 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 279 selfloop transitions, 48 changer transitions 4/351 dead transitions. [2023-08-04 09:11:40,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 351 transitions, 4321 flow [2023-08-04 09:11:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 09:11:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 09:11:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1539 transitions. [2023-08-04 09:11:40,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-08-04 09:11:40,072 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1539 transitions. [2023-08-04 09:11:40,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1539 transitions. [2023-08-04 09:11:40,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:11:40,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1539 transitions. [2023-08-04 09:11:40,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 192.375) internal successors, (1539), 8 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:40,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 405.0) internal successors, (3645), 9 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:40,075 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 405.0) internal successors, (3645), 9 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:40,075 INFO L175 Difference]: Start difference. First operand has 143 places, 153 transitions, 2089 flow. Second operand 8 states and 1539 transitions. [2023-08-04 09:11:40,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 351 transitions, 4321 flow [2023-08-04 09:11:47,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 351 transitions, 4264 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-04 09:11:47,720 INFO L231 Difference]: Finished difference. Result has 150 places, 160 transitions, 2297 flow [2023-08-04 09:11:47,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2297, PETRI_PLACES=150, PETRI_TRANSITIONS=160} [2023-08-04 09:11:47,721 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places. [2023-08-04 09:11:47,721 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 160 transitions, 2297 flow [2023-08-04 09:11:47,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 173.5) internal successors, (1735), 10 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:47,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:11:47,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:11:47,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 09:11:47,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:11:47,925 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:11:47,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:11:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 161931791, now seen corresponding path program 5 times [2023-08-04 09:11:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:11:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168786396] [2023-08-04 09:11:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:11:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:11:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:11:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:11:47,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:11:47,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168786396] [2023-08-04 09:11:47,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168786396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:11:47,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:11:47,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:11:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61304977] [2023-08-04 09:11:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:11:47,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:11:47,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:11:47,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:11:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:11:47,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 405 [2023-08-04 09:11:47,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 160 transitions, 2297 flow. Second operand has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:11:47,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:11:47,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 405 [2023-08-04 09:11:47,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:12:02,640 INFO L124 PetriNetUnfolderBase]: 61995/97984 cut-off events. [2023-08-04 09:12:02,641 INFO L125 PetriNetUnfolderBase]: For 1108173/1114818 co-relation queries the response was YES. [2023-08-04 09:12:03,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539037 conditions, 97984 events. 61995/97984 cut-off events. For 1108173/1114818 co-relation queries the response was YES. Maximal size of possible extension queue 3381. Compared 835530 event pairs, 22426 based on Foata normal form. 6603/102906 useless extension candidates. Maximal degree in co-relation 538958. Up to 35155 conditions per place. [2023-08-04 09:12:03,682 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 206 selfloop transitions, 52 changer transitions 0/273 dead transitions. [2023-08-04 09:12:03,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 273 transitions, 3760 flow [2023-08-04 09:12:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:12:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:12:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 970 transitions. [2023-08-04 09:12:03,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47901234567901235 [2023-08-04 09:12:03,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 970 transitions. [2023-08-04 09:12:03,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 970 transitions. [2023-08-04 09:12:03,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:12:03,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 970 transitions. [2023-08-04 09:12:03,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:03,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:03,686 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:03,686 INFO L175 Difference]: Start difference. First operand has 150 places, 160 transitions, 2297 flow. Second operand 5 states and 970 transitions. [2023-08-04 09:12:03,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 273 transitions, 3760 flow [2023-08-04 09:12:10,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 273 transitions, 3626 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-04 09:12:10,533 INFO L231 Difference]: Finished difference. Result has 150 places, 163 transitions, 2359 flow [2023-08-04 09:12:10,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2359, PETRI_PLACES=150, PETRI_TRANSITIONS=163} [2023-08-04 09:12:10,534 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places. [2023-08-04 09:12:10,534 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 163 transitions, 2359 flow [2023-08-04 09:12:10,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:10,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:12:10,534 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:12:10,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-04 09:12:10,534 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:12:10,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:12:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2042606045, now seen corresponding path program 3 times [2023-08-04 09:12:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:12:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891481171] [2023-08-04 09:12:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:12:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:12:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:12:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:12:10,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:12:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891481171] [2023-08-04 09:12:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891481171] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:12:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375194978] [2023-08-04 09:12:10,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 09:12:10,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:12:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:12:10,586 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:12:10,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-04 09:12:10,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 09:12:10,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:12:10,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:12:10,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:12:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:12:10,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:12:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:12:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375194978] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:12:10,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:12:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 09:12:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087554462] [2023-08-04 09:12:10,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:12:10,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 09:12:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:12:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 09:12:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:12:10,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:12:10,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 163 transitions, 2359 flow. Second operand has 10 states, 10 states have (on average 174.4) internal successors, (1744), 10 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:10,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:12:10,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:12:10,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:12:13,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, 142#L47-4true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 516#true, thread2Thread1of2ForFork0InUse, Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 170#L83-6true, 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:13,117 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:12:13,117 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:12:13,117 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:12:13,117 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:12:13,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 86#thread1EXITtrue, Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 516#true, thread2Thread1of2ForFork0InUse, Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 170#L83-6true, 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:13,649 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:12:13,649 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:12:13,649 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:12:13,649 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:12:14,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 142#L47-4true, Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 98#L83-11true, Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:14,469 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:12:14,469 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:12:14,469 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:12:14,469 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:12:15,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 86#thread1EXITtrue, Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), 2975#true, Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 98#L83-11true, Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:15,246 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:12:15,246 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:12:15,246 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:12:15,246 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:12:15,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 48#L84-8true, Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 142#L47-4true, Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:15,287 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:12:15,287 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:12:15,287 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:12:15,287 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:12:15,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 86#thread1EXITtrue, Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 48#L84-8true, Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:15,919 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:12:15,919 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:12:15,919 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:12:15,919 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:12:15,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), 2975#true, Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 142#L47-4true, Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 93#L84-3true, Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:15,967 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:12:15,967 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:12:15,967 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:12:15,967 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:12:16,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 86#thread1EXITtrue, Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 93#L84-3true, Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:16,812 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 09:12:16,812 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:12:16,812 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:12:16,812 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:12:16,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 142#L47-4true, Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 72#L84-4true, Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:16,864 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 09:12:16,864 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:12:16,864 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:12:16,864 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:12:17,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 72#L84-4true, Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1NotInUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:17,746 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 09:12:17,746 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:12:17,746 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:12:17,746 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:12:17,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 86#thread1EXITtrue, Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 72#L84-4true, Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:17,747 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 09:12:17,747 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:12:17,747 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:12:17,747 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:12:18,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 1167#(= ~counter~0 0), 2975#true, Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 48#L84-8true, Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 142#L47-4true, Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:18,897 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 09:12:18,897 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:12:18,897 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:12:18,897 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:12:19,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 48#L84-8true, Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1NotInUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:19,919 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 09:12:19,919 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:12:19,919 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:12:19,919 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:12:19,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 86#thread1EXITtrue, Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 1167#(= ~counter~0 0), 2975#true, Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 48#L84-8true, Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:19,920 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 09:12:19,920 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:12:19,920 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:12:19,920 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:12:19,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 142#L47-4true, Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 93#L84-3true, Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:19,983 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 09:12:19,983 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:12:19,983 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:12:19,983 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:12:20,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 86#thread1EXITtrue, Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1InUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 93#L84-3true, Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:20,873 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 09:12:20,873 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:12:20,873 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:12:20,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:12:20,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1NotInUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 20#thread1EXITtrue, Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 93#L84-3true, Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:20,875 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 09:12:20,875 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:12:20,875 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:12:20,875 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:12:21,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 704#true, Black: 1167#(= ~counter~0 0), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 72#L84-4true, Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1NotInUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:21,396 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 09:12:21,396 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:12:21,396 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 09:12:21,397 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:12:22,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1167#(= ~counter~0 0), Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 48#L84-8true, Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1NotInUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:22,836 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 09:12:22,836 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 09:12:22,836 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 09:12:22,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:12:23,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 916#true, Black: 1167#(= ~counter~0 0), Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 46#L85-8true, Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1NotInUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:23,591 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 09:12:23,591 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:12:23,592 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 09:12:23,592 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 09:12:23,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1411] L60-4-->L60-4: Formula: (let ((.cse0 (select (select |v_#memory_int_315| v_~f_inv~0.base_157) (+ v_~f_inv~0.offset_157 (* v_~counter~0_266 4))))) (and (<= 0 .cse0) (not (= (ite |v_thread2_#t~short11#1_113| 1 0) 0)) (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (select (select |v_#memory_int_315| v_~f~0.base_158) (+ v_~f~0.offset_158 (* .cse0 4))) v_~counter~0_266) 1 0)) (not (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= .cse0 v_~counter~0_265) (< |v_thread2Thread1of2ForFork0_~i~1#1_24| v_~N~0_125) (= |v_thread2Thread1of2ForFork0_~i~1#1_23| (+ |v_thread2Thread1of2ForFork0_~i~1#1_24| 1)) (not (= (ite (and (< v_~counter~0_266 v_~n_inv~0_146) (<= 0 v_~counter~0_266)) 1 0) 0)) (< .cse0 v_~n~0_148) |v_thread2_#t~short11#1_114| (= |v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9| |v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|))) InVars {~counter~0=v_~counter~0_266, ~f_inv~0.offset=v_~f_inv~0.offset_157, ~f~0.base=v_~f~0.base_158, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_24|, #memory_int=|v_#memory_int_315|, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_158, ~n_inv~0=v_~n_inv~0_146} OutVars{~counter~0=v_~counter~0_265, thread2Thread1of2ForFork0_#t~post8#1=|v_thread2Thread1of2ForFork0_#t~post8#1_17|, ~f_inv~0.offset=v_~f_inv~0.offset_157, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of2ForFork0_#t~mem13#1=|v_thread2Thread1of2ForFork0_#t~mem13#1_9|, ~f~0.base=v_~f~0.base_158, ~N~0=v_~N~0_125, ~f_inv~0.base=v_~f_inv~0.base_157, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of2ForFork0_#t~mem14#1=|v_thread2Thread1of2ForFork0_#t~mem14#1_9|, thread2Thread1of2ForFork0_#t~mem9#1=|v_thread2Thread1of2ForFork0_#t~mem9#1_9|, thread2Thread1of2ForFork0_~i~1#1=|v_thread2Thread1of2ForFork0_~i~1#1_23|, #memory_int=|v_#memory_int_315|, thread2Thread1of2ForFork0_#t~short11#1=|v_thread2Thread1of2ForFork0_#t~short11#1_9|, thread2Thread1of2ForFork0_#t~mem12#1=|v_thread2Thread1of2ForFork0_#t~mem12#1_9|, ~n~0=v_~n~0_148, thread2Thread1of2ForFork0_#t~mem10#1=|v_thread2Thread1of2ForFork0_#t~mem10#1_11|, ~n_inv~0=v_~n_inv~0_146} AuxVars[|v_thread2_#t~short11#1_114|, |v_thread2_#t~short11#1_113|] AssignedVars[~counter~0, thread2Thread1of2ForFork0_#t~mem14#1, thread2Thread1of2ForFork0_#t~post8#1, thread2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of2ForFork0_#t~mem13#1, thread2Thread1of2ForFork0_#t~mem9#1, thread2Thread1of2ForFork0_~i~1#1, thread2Thread1of2ForFork0_#t~short11#1, thread2Thread1of2ForFork0_#t~mem12#1, thread2Thread1of2ForFork0_#t~mem10#1, thread2Thread1of2ForFork0_assume_abort_if_not_~cond#1][214], [Black: 355#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1662#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1666#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 919#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1669#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 916#true, Black: 1167#(= ~counter~0 0), Black: 707#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1169#(and (= ~counter~0 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 2975#true, 90#L60-4true, Black: 2324#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 2667#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 279#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 2969#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), 1986#true, Black: 2666#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2330#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 2331#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2334#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2978#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2977#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2979#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2988#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 2642#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0)), Black: 1193#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 143#L60-4true, 2000#(<= 1 ~N~0), thread1Thread1of2ForFork1NotInUse, Black: 3001#(and (<= ~N~0 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 2998#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread2Thread1of2ForFork0InUse, Black: 519#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1677#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1678#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1980#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 196#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 349#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1989#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1992#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 2987#(<= 1 ~N~0), Black: 2001#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2341#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 2645#(and (<= 0 |thread2Thread1of2ForFork0_~i~1#1|) (<= 1 ~N~0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 2011#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3070#(<= 0 |thread1Thread2of2ForFork1_~i~0#1|), Black: 2014#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 3366#(<= 0 |thread1Thread1of2ForFork1_~i~0#1|), Black: 2657#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 2660#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread2Thread2of2ForFork0_~i~1#1| 0)), Black: 1336#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 227#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1640#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 149#L85-3true, 3318#true, Black: 3310#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 3074#(and (<= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 |thread1Thread2of2ForFork1_~i~0#1|)), Black: 1647#(= |thread1Thread2of2ForFork1_~i~0#1| 0), Black: 1651#(and (<= ~N~0 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1653#(and (<= ~N~0 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 3322#(and (<= 1 ~N~0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1637#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of2ForFork1_~i~0#1|)), 1164#true]) [2023-08-04 09:12:23,957 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 09:12:23,957 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 09:12:23,957 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 09:12:23,957 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 09:12:24,902 INFO L124 PetriNetUnfolderBase]: 63782/100003 cut-off events. [2023-08-04 09:12:24,902 INFO L125 PetriNetUnfolderBase]: For 1148128/1158696 co-relation queries the response was YES. [2023-08-04 09:12:25,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556175 conditions, 100003 events. 63782/100003 cut-off events. For 1148128/1158696 co-relation queries the response was YES. Maximal size of possible extension queue 3527. Compared 854303 event pairs, 18685 based on Foata normal form. 9456/107821 useless extension candidates. Maximal degree in co-relation 556095. Up to 39110 conditions per place. [2023-08-04 09:12:25,985 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 311 selfloop transitions, 66 changer transitions 4/401 dead transitions. [2023-08-04 09:12:25,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 401 transitions, 5189 flow [2023-08-04 09:12:25,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 09:12:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 09:12:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1558 transitions. [2023-08-04 09:12:25,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808641975308642 [2023-08-04 09:12:25,990 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1558 transitions. [2023-08-04 09:12:25,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1558 transitions. [2023-08-04 09:12:25,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:12:25,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1558 transitions. [2023-08-04 09:12:25,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 194.75) internal successors, (1558), 8 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:25,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 405.0) internal successors, (3645), 9 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:25,993 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 405.0) internal successors, (3645), 9 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:25,993 INFO L175 Difference]: Start difference. First operand has 150 places, 163 transitions, 2359 flow. Second operand 8 states and 1558 transitions. [2023-08-04 09:12:25,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 401 transitions, 5189 flow [2023-08-04 09:12:34,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 401 transitions, 5045 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-04 09:12:34,108 INFO L231 Difference]: Finished difference. Result has 158 places, 187 transitions, 2872 flow [2023-08-04 09:12:34,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2872, PETRI_PLACES=158, PETRI_TRANSITIONS=187} [2023-08-04 09:12:34,109 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2023-08-04 09:12:34,109 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 187 transitions, 2872 flow [2023-08-04 09:12:34,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.4) internal successors, (1744), 10 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:34,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:12:34,109 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:12:34,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-04 09:12:34,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:12:34,313 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:12:34,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:12:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 625385158, now seen corresponding path program 3 times [2023-08-04 09:12:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:12:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380012293] [2023-08-04 09:12:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:12:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:12:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:12:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:12:34,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:12:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380012293] [2023-08-04 09:12:34,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380012293] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:12:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245553770] [2023-08-04 09:12:34,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 09:12:34,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:12:34,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:12:34,361 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:12:34,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-04 09:12:34,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 09:12:34,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:12:34,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:12:34,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:12:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:12:34,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:12:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:12:34,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245553770] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:12:34,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:12:34,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 09:12:34,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063041863] [2023-08-04 09:12:34,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:12:34,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 09:12:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:12:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 09:12:34,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:12:34,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 405 [2023-08-04 09:12:34,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 187 transitions, 2872 flow. Second operand has 10 states, 10 states have (on average 174.3) internal successors, (1743), 10 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:34,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:12:34,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 405 [2023-08-04 09:12:34,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:12:56,596 INFO L124 PetriNetUnfolderBase]: 98196/153953 cut-off events. [2023-08-04 09:12:56,596 INFO L125 PetriNetUnfolderBase]: For 2116719/2147712 co-relation queries the response was YES. [2023-08-04 09:12:57,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883443 conditions, 153953 events. 98196/153953 cut-off events. For 2116719/2147712 co-relation queries the response was YES. Maximal size of possible extension queue 5366. Compared 1389988 event pairs, 14469 based on Foata normal form. 22249/175430 useless extension candidates. Maximal degree in co-relation 883359. Up to 41175 conditions per place. [2023-08-04 09:12:58,643 INFO L140 encePairwiseOnDemand]: 399/405 looper letters, 521 selfloop transitions, 183 changer transitions 20/747 dead transitions. [2023-08-04 09:12:58,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 747 transitions, 12245 flow [2023-08-04 09:12:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 09:12:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 09:12:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2093 transitions. [2023-08-04 09:12:58,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698092031425365 [2023-08-04 09:12:58,647 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2093 transitions. [2023-08-04 09:12:58,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2093 transitions. [2023-08-04 09:12:58,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:12:58,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2093 transitions. [2023-08-04 09:12:58,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 190.27272727272728) internal successors, (2093), 11 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:58,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 405.0) internal successors, (4860), 12 states have internal predecessors, (4860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:58,652 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 405.0) internal successors, (4860), 12 states have internal predecessors, (4860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:12:58,652 INFO L175 Difference]: Start difference. First operand has 158 places, 187 transitions, 2872 flow. Second operand 11 states and 2093 transitions. [2023-08-04 09:12:58,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 747 transitions, 12245 flow [2023-08-04 09:13:12,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 747 transitions, 11946 flow, removed 59 selfloop flow, removed 2 redundant places. [2023-08-04 09:13:12,573 INFO L231 Difference]: Finished difference. Result has 173 places, 325 transitions, 5672 flow [2023-08-04 09:13:12,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=2787, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5672, PETRI_PLACES=173, PETRI_TRANSITIONS=325} [2023-08-04 09:13:12,573 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2023-08-04 09:13:12,574 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 325 transitions, 5672 flow [2023-08-04 09:13:12,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.3) internal successors, (1743), 10 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:12,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:12,574 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:12,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-04 09:13:12,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-08-04 09:13:12,774 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:12,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash -390206282, now seen corresponding path program 4 times [2023-08-04 09:13:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245733120] [2023-08-04 09:13:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:13:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245733120] [2023-08-04 09:13:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245733120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:12,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:13:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688537702] [2023-08-04 09:13:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:12,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:12,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 405 [2023-08-04 09:13:12,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 325 transitions, 5672 flow. Second operand has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:12,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:12,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 405 [2023-08-04 09:13:12,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:46,139 INFO L124 PetriNetUnfolderBase]: 131596/204613 cut-off events. [2023-08-04 09:13:46,140 INFO L125 PetriNetUnfolderBase]: For 2853819/2870205 co-relation queries the response was YES. [2023-08-04 09:13:48,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261504 conditions, 204613 events. 131596/204613 cut-off events. For 2853819/2870205 co-relation queries the response was YES. Maximal size of possible extension queue 6684. Compared 1860455 event pairs, 27650 based on Foata normal form. 14657/219046 useless extension candidates. Maximal degree in co-relation 1261412. Up to 95326 conditions per place. [2023-08-04 09:13:48,860 INFO L140 encePairwiseOnDemand]: 400/405 looper letters, 567 selfloop transitions, 41 changer transitions 4/649 dead transitions. [2023-08-04 09:13:48,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 649 transitions, 12189 flow [2023-08-04 09:13:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:13:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:13:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 960 transitions. [2023-08-04 09:13:48,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2023-08-04 09:13:48,862 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 960 transitions. [2023-08-04 09:13:48,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 960 transitions. [2023-08-04 09:13:48,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:48,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 960 transitions. [2023-08-04 09:13:48,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.0) internal successors, (960), 5 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-04 09:13:48,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:48,864 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 405.0) internal successors, (2430), 6 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:48,864 INFO L175 Difference]: Start difference. First operand has 173 places, 325 transitions, 5672 flow. Second operand 5 states and 960 transitions. [2023-08-04 09:13:48,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 649 transitions, 12189 flow [2023-08-04 09:14:38,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 649 transitions, 12157 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-08-04 09:14:38,032 INFO L231 Difference]: Finished difference. Result has 180 places, 353 transitions, 6376 flow [2023-08-04 09:14:38,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=405, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6376, PETRI_PLACES=180, PETRI_TRANSITIONS=353} [2023-08-04 09:14:38,032 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places. [2023-08-04 09:14:38,032 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 353 transitions, 6376 flow [2023-08-04 09:14:38,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:14:38,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:14:38,033 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:14:38,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-04 09:14:38,033 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:14:38,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:14:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1201933550, now seen corresponding path program 3 times [2023-08-04 09:14:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:14:38,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895811023] [2023-08-04 09:14:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:14:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:14:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:14:38,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895811023] [2023-08-04 09:14:38,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895811023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:14:38,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:14:38,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:14:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061725440] [2023-08-04 09:14:38,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:14:38,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:14:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:14:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:14:38,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:14:38,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 405 [2023-08-04 09:14:38,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 353 transitions, 6376 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:14:38,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:14:38,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 405 [2023-08-04 09:14:38,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand